A network containing a collection of nodes, pairs of which are joined by edges.
| ID | Title | Solved By | Correct Ratio |
|---|---|---|---|
| DEG | Degree Array | 1428 |
|
| DDEG | Double-Degree Array | 1132 |
|
| BFS | Breadth-First Search | 673 |
|
| CC | Connected Components | 653 |
|
| BIP | Testing Bipartiteness | 385 |
|
| DAG | Testing Acyclicity | 375 |
|
| DIJ | Dijkstra's Algorithm | 364 |
|
| SQ | Square in a Graph | 267 |
|
| BF | Bellman-Ford Algorithm | 277 |
|
| CTE | Shortest Cycle Through a Given Edge | 197 |
|
| TS | Topological Sorting | 304 |
|
| HDAG | Hamiltonian Path in DAG | 209 |
|
| NWC | Negative Weight Cycle | 219 |
|
| SCC | Strongly Connected Components | 218 |
|
| 2SAT | 2-Satisfiability | 126 |
|
| GS | General Sink | 169 |
|
| SC | Semi-Connected Graph | 162 |
|
| SDAG | Shortest Paths in DAG | 179 |
|
