From charlesreid1

Revision as of 08:44, 9 September 2017 by Admin (talk | contribs) (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...")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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

Graphs

notes on graph theory, graph implementations, and graph algorithms

Part of Computer Science Notes

Series on Data Structures

Graph Theory:

Graphs/Definitions · Graphs/Matching · Graphs/Connectivity

First Theorem of Graph Theory

Graph Implementations:

Graphs/Data Structures · Graphs/ADT

Graphs/Java/Adjacency Map · Graphs/Java/Adjacency Map Lite

Graph Algorithms:

Algorithms/Graphs

Traversal:

Graphs/Traversal · Graphs/Euler Tour · Graphs/Depth First Traversal · Graphs/Breadth First Traversal

Category:Traversal

Connectivity and Cycles:

Graphs/Finding Cycles · Graphs/Finding Connected Components · Graphs/Reachability

Transitive Closure:

Graphs/Transitive Closure · Graphs/Floyd Warshall Algorithm

Shortest Path:

Graphs/Shortest Path · Graphs/Edge Relaxation · Graphs/Dijkstra

Minimum Spanning Tree:

Graphs/Minimum Spanning Tree · Graphs/Prim Jarnik Algorithm · Graphs/Kruskal Algorithm

Graphs/Cluster Finding

Directed Acyclic Graphs:

DAGs · Graphs/Cycles · Graphs/Topological Sort

Category:Graphs · Category:Algorithms · Category:CS · Category:Data Structures

Flags · Template:GraphsFlagBase · e

Retrieved from "https://charlesreid1.com/w/index.php?title=Graphs/Reachability&oldid=21049"