A network containing a collection of nodes, pairs of which are joined by edges.
| ID | Title | Solved By | Correct Ratio |
|---|---|---|---|
| DEG | Degree Array | 2526 |
|
| DDEG | Double-Degree Array | 1991 |
|
| BFS | Breadth-First Search | 1186 |
|
| CC | Connected Components | 1148 |
|
| BIP | Testing Bipartiteness | 612 |
|
| DAG | Testing Acyclicity | 674 |
|
| DIJ | Dijkstra's Algorithm | 673 |
|
| SQ | Square in a Graph | 456 |
|
| BF | Bellman-Ford Algorithm | 476 |
|
| CTE | Shortest Cycle Through a Given Edge | 396 |
|
| TS | Topological Sorting | 551 |
|
| HDAG | Hamiltonian Path in DAG | 402 |
|
| NWC | Negative Weight Cycle | 378 |
|
| SCC | Strongly Connected Components | 406 |
|
| 2SAT | 2-Satisfiability | 248 |
|
| GS | General Sink | 294 |
|
| SC | Semi-Connected Graph | 287 |
|
| SDAG | Shortest Paths in DAG | 317 |
|
