A network containing a collection of nodes, pairs of which are joined by edges.
| ID | Title | Solved By | Correct Ratio |
|---|---|---|---|
| DEG | Degree Array | 2476 |
|
| DDEG | Double-Degree Array | 1954 |
|
| BFS | Breadth-First Search | 1160 |
|
| CC | Connected Components | 1125 |
|
| BIP | Testing Bipartiteness | 603 |
|
| DAG | Testing Acyclicity | 665 |
|
| DIJ | Dijkstra's Algorithm | 663 |
|
| SQ | Square in a Graph | 446 |
|
| BF | Bellman-Ford Algorithm | 468 |
|
| CTE | Shortest Cycle Through a Given Edge | 388 |
|
| TS | Topological Sorting | 542 |
|
| HDAG | Hamiltonian Path in DAG | 394 |
|
| NWC | Negative Weight Cycle | 372 |
|
| SCC | Strongly Connected Components | 397 |
|
| 2SAT | 2-Satisfiability | 243 |
|
| GS | General Sink | 287 |
|
| SC | Semi-Connected Graph | 282 |
|
| SDAG | Shortest Paths in DAG | 311 |
|