A network containing a collection of nodes, pairs of which are joined by edges.
| ID | Title | Solved By | Correct Ratio |
|---|---|---|---|
| DEG | Degree Array | 1960 |
|
| DDEG | Double-Degree Array | 1543 |
|
| BFS | Breadth-First Search | 896 |
|
| CC | Connected Components | 879 |
|
| BIP | Testing Bipartiteness | 492 |
|
| DAG | Testing Acyclicity | 507 |
|
| DIJ | Dijkstra's Algorithm | 494 |
|
| SQ | Square in a Graph | 352 |
|
| BF | Bellman-Ford Algorithm | 369 |
|
| CTE | Shortest Cycle Through a Given Edge | 271 |
|
| TS | Topological Sorting | 405 |
|
| HDAG | Hamiltonian Path in DAG | 277 |
|
| NWC | Negative Weight Cycle | 288 |
|
| SCC | Strongly Connected Components | 283 |
|
| 2SAT | 2-Satisfiability | 161 |
|
| GS | General Sink | 217 |
|
| SC | Semi-Connected Graph | 212 |
|
| SDAG | Shortest Paths in DAG | 237 |
|
