A network containing a collection of nodes, pairs of which are joined by edges.
| ID | Title | Solved By | Correct Ratio |
|---|---|---|---|
| DEG | Degree Array | 1465 |
|
| DDEG | Double-Degree Array | 1166 |
|
| BFS | Breadth-First Search | 696 |
|
| CC | Connected Components | 674 |
|
| BIP | Testing Bipartiteness | 396 |
|
| DAG | Testing Acyclicity | 386 |
|
| DIJ | Dijkstra's Algorithm | 376 |
|
| SQ | Square in a Graph | 275 |
|
| BF | Bellman-Ford Algorithm | 285 |
|
| CTE | Shortest Cycle Through a Given Edge | 203 |
|
| TS | Topological Sorting | 312 |
|
| HDAG | Hamiltonian Path in DAG | 212 |
|
| NWC | Negative Weight Cycle | 225 |
|
| SCC | Strongly Connected Components | 223 |
|
| 2SAT | 2-Satisfiability | 127 |
|
| GS | General Sink | 173 |
|
| SC | Semi-Connected Graph | 167 |
|
| SDAG | Shortest Paths in DAG | 184 |
|
