|
|
|
|
|
|
by vinceguidry
1424 days ago
|
|
|
With cycles in the graph, there's no single path to each node, no matter where the root is. Multiple paths to a node is the exact opposite of addressability. As an example, try to devise an algo for enumerating nodes and their paths from root. |
|
|