A network containing a collection of nodes, pairs of which are joined by edges.
| ID | Title | Solved By | Correct Ratio |
|---|---|---|---|
| DEG | Degree Array | 1894 |
|
| DDEG | Double-Degree Array | 1486 |
|
| BFS | Breadth-First Search | 863 |
|
| CC | Connected Components | 840 |
|
| BIP | Testing Bipartiteness | 481 |
|
| DAG | Testing Acyclicity | 487 |
|
| DIJ | Dijkstra's Algorithm | 473 |
|
| SQ | Square in a Graph | 341 |
|
| BF | Bellman-Ford Algorithm | 360 |
|
| CTE | Shortest Cycle Through a Given Edge | 255 |
|
| TS | Topological Sorting | 385 |
|
| HDAG | Hamiltonian Path in DAG | 262 |
|
| NWC | Negative Weight Cycle | 281 |
|
| SCC | Strongly Connected Components | 269 |
|
| 2SAT | 2-Satisfiability | 154 |
|
| GS | General Sink | 211 |
|
| SC | Semi-Connected Graph | 205 |
|
| SDAG | Shortest Paths in DAG | 231 |
|
