Graph traversal and connectivity

Graph representations as adjacency lists and adjacency matrices, breadth-first and depth-first search with predecessor trees, strongly connected components, topological sorting, transitive closure and Hierholzer's Euler circuits.

• Adjacency list
• Adjacency matrix
• Breadth-first search
• Depth-first search
• Hierholzer's algorithm for Euler circuits
• Strongly connected components
• Topological sorting
• Transitive closure
• Traversal of implicit binary trees

The dependency explorer needs JavaScript and its graph data.

Download the complete graph data.