Graphs#
Contents#
Sections#
Terms#
[ w ] A*
[ w ] Adjacency Matrix
[ w ] Barabási–Albert Model
[ w ] Bellman-Ford Algorithm
[ w ] Biconnected Component
[ w ] Branching Factor
[ w ] Breadth-First Search (BFS)
[ w ] Coffman-Graham Algorithm
[ w ] Component
[ w ] Connected-Component Labeling
[ w ] Connectivity
[ w ] Critical Path Method (CPM)
[ w ] Cycle
[ w ] Degree Distribution
[ w ] Dense Graph
[ w ] Depth-First Search (DFS)
[ w ] Dijkstra’s Algorithm
[ w ] Directed Acyclic Graph (DAG)
[ w ] Directed Graph
[ w ] Dynamic Connectivity
[ w ] Erdős–Rényi Model
[ w ] Feedback Arc Set
[ w ] Flow Network
[ w ] Graph (in discrete mathematics)
[ w ] Graph (as an abstract data type)
[ w ] Graph Invariant
[ w ] Graph Traversal
[ w ] Hypergraph
[ w ] Induced Subgraph
[ w ] Kosaraju’s Algorithm
[ w ] Linear Order
[ w ] Multigraph
[ w ] Null Graph
[ w ] Path
[ w ] Path-Based Strong Component Algorithm
[ w ] Path Finding
[ w ] Pre Topological Order
[ w ] Pruning
[ w ] Reachability
[ w ] Reverse Graph
[ w ] Scale-Free Network
[ w ] Shortest Path Problem
[ w ] Single-Source Shortest Path (SSSP) Problem
[ w ] Spanning Tree
[ w ] Strongly Connected Component
[ w ] Tarjan’s Strongly Connected Components Algorithm
[ w ] Topological Sort
[ w ] Transitive Reduction
[ w ] Vertex
[ w ] Weak Component
[ w ] Webgraph