A network containing a collection of nodes, pairs of which are joined by edges.
| ID | Title | Solved By | Correct Ratio |
|---|---|---|---|
| DEG | Degree Array | 1404 |
|
| DDEG | Double-Degree Array | 1109 |
|
| BFS | Breadth-First Search | 661 |
|
| CC | Connected Components | 644 |
|
| BIP | Testing Bipartiteness | 378 |
|
| DAG | Testing Acyclicity | 369 |
|
| DIJ | Dijkstra's Algorithm | 356 |
|
| SQ | Square in a Graph | 263 |
|
| BF | Bellman-Ford Algorithm | 271 |
|
| CTE | Shortest Cycle Through a Given Edge | 194 |
|
| TS | Topological Sorting | 298 |
|
| HDAG | Hamiltonian Path in DAG | 205 |
|
| NWC | Negative Weight Cycle | 213 |
|
| SCC | Strongly Connected Components | 213 |
|
| 2SAT | 2-Satisfiability | 123 |
|
| GS | General Sink | 167 |
|
| SC | Semi-Connected Graph | 159 |
|
| SDAG | Shortest Paths in DAG | 175 |
|
