A network containing a collection of nodes, pairs of which are joined by edges.
| ID | Title | Solved By | Correct Ratio |
|---|---|---|---|
| DEG | Degree Array | 1214 |
|
| DDEG | Double-Degree Array | 977 |
|
| BFS | Breadth-First Search | 576 |
|
| CC | Connected Components | 570 |
|
| BIP | Testing Bipartiteness | 344 |
|
| DAG | Testing Acyclicity | 335 |
|
| DIJ | Dijkstra's Algorithm | 317 |
|
| SQ | Square in a Graph | 236 |
|
| BF | Bellman-Ford Algorithm | 244 |
|
| CTE | Shortest Cycle Through a Given Edge | 176 |
|
| TS | Topological Sorting | 269 |
|
| HDAG | Hamiltonian Path in DAG | 185 |
|
| NWC | Negative Weight Cycle | 192 |
|
| SCC | Strongly Connected Components | 196 |
|
| 2SAT | 2-Satisfiability | 111 |
|
| GS | General Sink | 153 |
|
| SC | Semi-Connected Graph | 147 |
|
| SDAG | Shortest Paths in DAG | 159 |
|
