A network containing a collection of nodes, pairs of which are joined by edges.
| ID | Title | Solved By | Correct Ratio |
|---|---|---|---|
| DEG | Degree Array | 1688 |
|
| DDEG | Double-Degree Array | 1333 |
|
| BFS | Breadth-First Search | 783 |
|
| CC | Connected Components | 768 |
|
| BIP | Testing Bipartiteness | 440 |
|
| DAG | Testing Acyclicity | 438 |
|
| DIJ | Dijkstra's Algorithm | 425 |
|
| SQ | Square in a Graph | 306 |
|
| BF | Bellman-Ford Algorithm | 319 |
|
| CTE | Shortest Cycle Through a Given Edge | 231 |
|
| TS | Topological Sorting | 347 |
|
| HDAG | Hamiltonian Path in DAG | 234 |
|
| NWC | Negative Weight Cycle | 250 |
|
| SCC | Strongly Connected Components | 246 |
|
| 2SAT | 2-Satisfiability | 140 |
|
| GS | General Sink | 191 |
|
| SC | Semi-Connected Graph | 186 |
|
| SDAG | Shortest Paths in DAG | 204 |
|
