A network containing a collection of nodes, pairs of which are joined by edges.
| ID | Title | Solved By | Correct Ratio |
|---|---|---|---|
| DEG | Degree Array | 2708 |
|
| DDEG | Double-Degree Array | 2136 |
|
| BFS | Breadth-First Search | 1269 |
|
| CC | Connected Components | 1236 |
|
| BIP | Testing Bipartiteness | 673 |
|
| DAG | Testing Acyclicity | 735 |
|
| DIJ | Dijkstra's Algorithm | 738 |
|
| SQ | Square in a Graph | 490 |
|
| BF | Bellman-Ford Algorithm | 532 |
|
| CTE | Shortest Cycle Through a Given Edge | 443 |
|
| TS | Topological Sorting | 580 |
|
| HDAG | Hamiltonian Path in DAG | 425 |
|
| NWC | Negative Weight Cycle | 425 |
|
| SCC | Strongly Connected Components | 427 |
|
| 2SAT | 2-Satisfiability | 264 |
|
| GS | General Sink | 313 |
|
| SC | Semi-Connected Graph | 305 |
|
| SDAG | Shortest Paths in DAG | 360 |
|
