A network containing a collection of nodes, pairs of which are joined by edges.
| ID | Title | Solved By | Correct Ratio |
|---|---|---|---|
| DEG | Degree Array | 2622 |
|
| DDEG | Double-Degree Array | 2069 |
|
| BFS | Breadth-First Search | 1239 |
|
| CC | Connected Components | 1195 |
|
| BIP | Testing Bipartiteness | 653 |
|
| DAG | Testing Acyclicity | 715 |
|
| DIJ | Dijkstra's Algorithm | 719 |
|
| SQ | Square in a Graph | 471 |
|
| BF | Bellman-Ford Algorithm | 517 |
|
| CTE | Shortest Cycle Through a Given Edge | 430 |
|
| TS | Topological Sorting | 564 |
|
| HDAG | Hamiltonian Path in DAG | 413 |
|
| NWC | Negative Weight Cycle | 411 |
|
| SCC | Strongly Connected Components | 415 |
|
| 2SAT | 2-Satisfiability | 256 |
|
| GS | General Sink | 303 |
|
| SC | Semi-Connected Graph | 295 |
|
| SDAG | Shortest Paths in DAG | 349 |
|
