nodes connected to a node
a = neighbors(i,g)
integer
a graph_data_structure.
vector of integers
neighbors returns the numbers of the nodes connected with node i for graph g (directed or not).
neighbors
g
ta=[1 6 2 4 7 5 6 8 4 3 5 1]; he=[2 1 3 6 4 8 8 7 2 7 3 5]; g=make_graph('foo',1,8,ta,he); g.nodes.graphics.x=[285 284 335 160 405 189 118 45]/2; g.nodes.graphics.y=[266 179 83 176 368 252 64 309]/2; show_graph(g); a=neighbors(6,g) hilite_nodes(a);