Admin: Created page with "=Notes= The notion of "reachability" boils down to answering the question whether a vertex u can be reached from a source vertex s. To answer this question, use a depth firs..."

2017-09-09T08:44:40Z

Created page with "=Notes= The notion of "reachability" boils down to answering the question whether a vertex u can be reached from a source vertex s. To answer this question, use a depth firs..."

New page

=Notes=

The notion of "reachability" boils down to answering the question whether a vertex u can be reached from a source vertex s.

To answer this question, use a depth first search. See [[Graphs/DFS]].

The notion of the shortest path from a vertex s to a vertex u is answered with breadth first search. See [[Graphs/BFS]].

=Flags=

{{GraphsFlag}}

Graphs/Reachability - Revision history

Admin: Created page with "=Notes= The notion of "reachability" boils down to answering the question whether a vertex u can be reached from a source vertex s. To answer this question, use a depth firs..."