A network containing a collection of nodes, pairs of which are joined by edges.
| ID | Title | Solved By | Correct Ratio |
|---|---|---|---|
| DEG | Degree Array | 1745 |
|
| DDEG | Double-Degree Array | 1380 |
|
| BFS | Breadth-First Search | 808 |
|
| CC | Connected Components | 789 |
|
| BIP | Testing Bipartiteness | 450 |
|
| DAG | Testing Acyclicity | 452 |
|
| DIJ | Dijkstra's Algorithm | 442 |
|
| SQ | Square in a Graph | 314 |
|
| BF | Bellman-Ford Algorithm | 332 |
|
| CTE | Shortest Cycle Through a Given Edge | 235 |
|
| TS | Topological Sorting | 356 |
|
| HDAG | Hamiltonian Path in DAG | 239 |
|
| NWC | Negative Weight Cycle | 257 |
|
| SCC | Strongly Connected Components | 252 |
|
| 2SAT | 2-Satisfiability | 142 |
|
| GS | General Sink | 193 |
|
| SC | Semi-Connected Graph | 189 |
|
| SDAG | Shortest Paths in DAG | 211 |
|
