Category:Graph algorithms
Graph algorithms solve problems related to graph theory.
Subcategories
This category has the following 5 subcategories, out of 5 total.
Pages in category "Graph algorithms"
The following 130 pages are in this category, out of 130 total. This list may not reflect recent changes (learn more).
B
C
D
- D*
- Degeneracy (graph theory)
- Depth-first search
- Dijkstra–Scholten algorithm
- Dijkstra's algorithm
- Dinic's algorithm
- Disparity filter algorithm of weighted network
- Distinctiveness centrality
- Double pushout graph rewriting
- DSatur
- Dulmage–Mendelsohn decomposition
- Dynamic connectivity
- Dynamic link matching