A network containing a collection of nodes, pairs of which are joined by edges.
| ID | Title | Solved By | Correct Ratio |
|---|---|---|---|
| DEG | Degree Array | 2001 |
|
| DDEG | Double-Degree Array | 1576 |
|
| BFS | Breadth-First Search | 910 |
|
| CC | Connected Components | 893 |
|
| BIP | Testing Bipartiteness | 499 |
|
| DAG | Testing Acyclicity | 517 |
|
| DIJ | Dijkstra's Algorithm | 505 |
|
| SQ | Square in a Graph | 361 |
|
| BF | Bellman-Ford Algorithm | 377 |
|
| CTE | Shortest Cycle Through a Given Edge | 280 |
|
| TS | Topological Sorting | 416 |
|
| HDAG | Hamiltonian Path in DAG | 286 |
|
| NWC | Negative Weight Cycle | 296 |
|
| SCC | Strongly Connected Components | 293 |
|
| 2SAT | 2-Satisfiability | 165 |
|
| GS | General Sink | 225 |
|
| SC | Semi-Connected Graph | 220 |
|
| SDAG | Shortest Paths in DAG | 244 |
|
