A network containing a collection of nodes, pairs of which are joined by edges.
| ID | Title | Solved By | Correct Ratio |
|---|---|---|---|
| DEG | Degree Array | 2747 |
|
| DDEG | Double-Degree Array | 2169 |
|
| BFS | Breadth-First Search | 1287 |
|
| CC | Connected Components | 1256 |
|
| BIP | Testing Bipartiteness | 685 |
|
| DAG | Testing Acyclicity | 748 |
|
| DIJ | Dijkstra's Algorithm | 753 |
|
| SQ | Square in a Graph | 500 |
|
| BF | Bellman-Ford Algorithm | 545 |
|
| CTE | Shortest Cycle Through a Given Edge | 454 |
|
| TS | Topological Sorting | 592 |
|
| HDAG | Hamiltonian Path in DAG | 437 |
|
| NWC | Negative Weight Cycle | 438 |
|
| SCC | Strongly Connected Components | 438 |
|
| 2SAT | 2-Satisfiability | 275 |
|
| GS | General Sink | 323 |
|
| SC | Semi-Connected Graph | 315 |
|
| SDAG | Shortest Paths in DAG | 372 |
|
