Questions tagged [directed]

The tag has no usage guidance.

Filter by
Sorted by
Tagged with
1 vote
1 answer

What algorithm will visit each node in a graph a number of times equal to the number of paths to that node from the root?

First Few Iterations of the Algorithm We have an algorithm in which a squirrel visits the nodes of a directed graph. Our graph has two colors of edges: black and white. Initially, the graph has black ...