Computer Science · answer list
All answers to “Name a graph algorithm”
Every one of the 33 answers Icillion accepts, A to Z. 3 can be spelled more than one way. Which ones are rare stays a secret.
A
- A staralso A*
B
- Bellman Ford
- Bidirectional search
- Boruvka
- Breadth first searchalso BFS
- Bron Kerbosch
C
- Christofides
D
- Depth first searchalso DFS
- Dijkstra
- Dinic
E
- Edmonds blossom
- Edmonds Karp
- Eppstein
F
- Fleury
- Floyd Warshall
- Ford Fulkerson
H
- Hierholzer
- HITS
- Hopcroft Karp
J
- Johnson
K
- Kahn
- Karger
- Kosaraju
- Kruskal
L
- Label propagation
- Louvain
P
- PageRank
- Prim
- Push relabel
S
- Stoer Wagner
T
- Tarjan
- Topological sort
Y
- Yen
Play computer science trivia nowBack to “Name a graph algorithm”
How deep does your knowledge go?
Seven prompts a day, twenty seconds each. Obvious answers float on the tip of the iceberg; rare ones sink all the way to the trench.
▼ Start today’s iceberg ▼