A network containing a collection of nodes, pairs of which are joined by edges.
| ID | Title | Solved By | Correct Ratio |
|---|---|---|---|
| DEG | Degree Array | 2122 |
|
| DDEG | Double-Degree Array | 1662 |
|
| BFS | Breadth-First Search | 965 |
|
| CC | Connected Components | 948 |
|
| BIP | Testing Bipartiteness | 519 |
|
| DAG | Testing Acyclicity | 551 |
|
| DIJ | Dijkstra's Algorithm | 544 |
|
| SQ | Square in a Graph | 378 |
|
| BF | Bellman-Ford Algorithm | 395 |
|
| CTE | Shortest Cycle Through a Given Edge | 307 |
|
| TS | Topological Sorting | 443 |
|
| HDAG | Hamiltonian Path in DAG | 309 |
|
| NWC | Negative Weight Cycle | 310 |
|
| SCC | Strongly Connected Components | 316 |
|
| 2SAT | 2-Satisfiability | 183 |
|
| GS | General Sink | 239 |
|
| SC | Semi-Connected Graph | 235 |
|
| SDAG | Shortest Paths in DAG | 257 |
|
