Glossary · Computer science
Graph algorithm
An algorithm that works on networks of nodes and edges, such as Dijkstra’s shortest path or breadth-first search.
In the game
You will meet graph algorithm in 1 prompt of Icillion. Of the 33 answers they accept, only 24 reach The Deep or below.
For example
From the prompt “Name a graph algorithm”, the familiar end of the list:
- Dijkstra
- Breadth first search
- Depth first search
- A star
- Bellman Ford
- Floyd Warshall
- Kruskal
- Prim
- Topological sort
Prompts that use it
Related terms
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 ▼