A network containing a collection of nodes, pairs of which are joined by edges.
| ID | Title | Solved By | Correct Ratio |
|---|---|---|---|
| DEG | Degree Array | 2757 |
|
| DDEG | Double-Degree Array | 2176 |
|
| BFS | Breadth-First Search | 1290 |
|
| CC | Connected Components | 1263 |
|
| BIP | Testing Bipartiteness | 688 |
|
| DAG | Testing Acyclicity | 751 |
|
| DIJ | Dijkstra's Algorithm | 756 |
|
| SQ | Square in a Graph | 502 |
|
| BF | Bellman-Ford Algorithm | 547 |
|
| CTE | Shortest Cycle Through a Given Edge | 456 |
|
| TS | Topological Sorting | 594 |
|
| HDAG | Hamiltonian Path in DAG | 439 |
|
| NWC | Negative Weight Cycle | 440 |
|
| SCC | Strongly Connected Components | 440 |
|
| 2SAT | 2-Satisfiability | 277 |
|
| GS | General Sink | 325 |
|
| SC | Semi-Connected Graph | 317 |
|
| SDAG | Shortest Paths in DAG | 374 |
|
