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

Method get_neighbor_idx

dlib/test/graph_cuts.cpp:58–67  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

56 ) const { return number_of_nodes()-1; }
57
58 unsigned long get_neighbor_idx (
59 unsigned long node_id1,
60 unsigned long node_id2
61 ) const
62 {
63 if (node_id2 < node_id1)
64 return node_id2;
65 else
66 return node_id2-1;
67 }
68
69 unsigned long get_neighbor (
70 unsigned long node_id,

Callers

nothing calls this directly

Calls

no outgoing calls

Tested by

no test coverage detected