Closed GoogleCodeExporter closed 9 years ago
That's the behaviour of neighbours() on a regular graph: If node A is an
neighbour of
node B then node B must be a neighbour of node A. That's not the case with a
digraph.
Consider the trivial digraph which can be written A -> B, or
nodes = [ "A", "B" ]
edges = [ ("A", "B"), ]
B is a neighbour of A
A is incident on B
A is NOT a neighbour of B
Original comment by salimfadhley@gmail.com
on 25 May 2010 at 10:21
I agree that the naming is a bit strange, but we need this to ensure
compatibility
between graphs and digraphs.
I'm marking this as Invalid, but this might change on a future API refactoring.
Original comment by pmatiello
on 25 May 2010 at 10:50
Original issue reported on code.google.com by
anand.jeyahar
on 25 May 2010 at 9:40