A network containing a collection of nodes, pairs of which are joined by edges.
| ID | Title | Solved By | Correct Ratio |
|---|---|---|---|
| DEG | Degree Array | 2246 |
|
| DDEG | Double-Degree Array | 1767 |
|
| BFS | Breadth-First Search | 1031 |
|
| CC | Connected Components | 1004 |
|
| BIP | Testing Bipartiteness | 549 |
|
| DAG | Testing Acyclicity | 582 |
|
| DIJ | Dijkstra's Algorithm | 583 |
|
| SQ | Square in a Graph | 399 |
|
| BF | Bellman-Ford Algorithm | 421 |
|
| CTE | Shortest Cycle Through a Given Edge | 326 |
|
| TS | Topological Sorting | 470 |
|
| HDAG | Hamiltonian Path in DAG | 330 |
|
| NWC | Negative Weight Cycle | 329 |
|
| SCC | Strongly Connected Components | 337 |
|
| 2SAT | 2-Satisfiability | 198 |
|
| GS | General Sink | 256 |
|
| SC | Semi-Connected Graph | 251 |
|
| SDAG | Shortest Paths in DAG | 272 |
|
