A network containing a collection of nodes, pairs of which are joined by edges.
| ID | Title | Solved By | Correct Ratio |
|---|---|---|---|
| DEG | Degree Array | 2717 |
|
| DDEG | Double-Degree Array | 2143 |
|
| BFS | Breadth-First Search | 1274 |
|
| CC | Connected Components | 1240 |
|
| BIP | Testing Bipartiteness | 675 |
|
| DAG | Testing Acyclicity | 737 |
|
| DIJ | Dijkstra's Algorithm | 741 |
|
| SQ | Square in a Graph | 491 |
|
| BF | Bellman-Ford Algorithm | 534 |
|
| CTE | Shortest Cycle Through a Given Edge | 444 |
|
| TS | Topological Sorting | 582 |
|
| HDAG | Hamiltonian Path in DAG | 426 |
|
| NWC | Negative Weight Cycle | 427 |
|
| SCC | Strongly Connected Components | 428 |
|
| 2SAT | 2-Satisfiability | 265 |
|
| GS | General Sink | 314 |
|
| SC | Semi-Connected Graph | 306 |
|
| SDAG | Shortest Paths in DAG | 361 |
|
