Skip to content

References: Graph Theory II - Paths, Traversal, and Connectivity

  1. Directed graph - Wikipedia - Covers edge direction, indegree, and outdegree in formal graph-theory terms, the mathematical foundation for this chapter's Directed Edge, Incoming Edge, and Outgoing Edge sections.

  2. Path (graph theory) - Wikipedia - Defines a path as a sequence of edge-connected vertices and formalizes path length as edge count, directly underlying this chapter's Graph Path and Path Length sections.

  3. Reachability - Wikipedia - Explains reachability as the existence of any directed path between two vertices, the precise property this chapter's Reachability section applies to prerequisite chains.

  4. Connectivity (graph theory) - Wikipedia - Distinguishes weak and strong connectivity in directed graphs, the exact contrast this chapter's Weak Connectivity and Strong Connectivity sections draw for learning-graph validation.

  5. Strongly connected component - Wikipedia - Covers how directed graphs decompose into maximal mutually-reachable subsets, useful background for contrasting this chapter's Connected Component (which ignores direction) with its stricter, direction-aware cousin.

  6. Adjacency list - Wikipedia - Explains the per-node neighbor-list representation this chapter's Adjacency List section recommends for sparse graphs like this project's own learning graph.

  7. Adjacency matrix - Wikipedia - Explains the grid-based representation this chapter's Adjacency Matrix section contrasts against adjacency lists on memory and lookup-speed trade-offs.

  8. Depth-first search - Wikipedia - Describes the backtracking traversal strategy this chapter's Depth-First Search section applies to walking a learning graph one branch at a time.

  9. Breadth-first search - Wikipedia - Describes the ring-by-ring traversal strategy this chapter's Breadth-First Search section applies to closest-first concept sequencing.

  10. Introduction to Algorithms (4th Edition) - Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein - MIT Press - The standard graph-algorithms reference covering adjacency-list and adjacency-matrix trade-offs and formal DFS/BFS pseudocode, the theoretical basis for this chapter's traversal comparison and its Graph Traversal Step-Through MicroSim specification.