MCPcopy Create free account
hub / github.com/davisking/dlib / get_neighbor

Method get_neighbor

dlib/graph_cuts/general_potts_problem.h:41–44  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

39 ) const { return g.node(idx).number_of_neighbors(); }
40
41 unsigned long get_neighbor (
42 unsigned long idx,
43 unsigned long n
44 ) const { return g.node(idx).neighbor(n).index(); }
45
46 unsigned long get_neighbor_idx (
47 unsigned long idx1,

Callers

nothing calls this directly

Calls 2

neighborMethod · 0.80
indexMethod · 0.45

Tested by

no test coverage detected