A network containing a collection of nodes, pairs of which are joined by edges.
| ID | Title | Solved By | Correct Ratio |
|---|---|---|---|
| DEG | Degree Array | 2726 |
|
| DDEG | Double-Degree Array | 2151 |
|
| BFS | Breadth-First Search | 1283 |
|
| CC | Connected Components | 1248 |
|
| BIP | Testing Bipartiteness | 680 |
|
| DAG | Testing Acyclicity | 742 |
|
| DIJ | Dijkstra's Algorithm | 748 |
|
| SQ | Square in a Graph | 496 |
|
| BF | Bellman-Ford Algorithm | 541 |
|
| CTE | Shortest Cycle Through a Given Edge | 450 |
|
| TS | Topological Sorting | 587 |
|
| HDAG | Hamiltonian Path in DAG | 432 |
|
| NWC | Negative Weight Cycle | 434 |
|
| SCC | Strongly Connected Components | 433 |
|
| 2SAT | 2-Satisfiability | 270 |
|
| GS | General Sink | 319 |
|
| SC | Semi-Connected Graph | 311 |
|
| SDAG | Shortest Paths in DAG | 367 |
|
