A network containing a collection of nodes, pairs of which are joined by edges.
| ID | Title | Solved By | Correct Ratio |
|---|---|---|---|
| DEG | Degree Array | 1798 |
|
| DDEG | Double-Degree Array | 1414 |
|
| BFS | Breadth-First Search | 831 |
|
| CC | Connected Components | 812 |
|
| BIP | Testing Bipartiteness | 462 |
|
| DAG | Testing Acyclicity | 464 |
|
| DIJ | Dijkstra's Algorithm | 455 |
|
| SQ | Square in a Graph | 324 |
|
| BF | Bellman-Ford Algorithm | 344 |
|
| CTE | Shortest Cycle Through a Given Edge | 244 |
|
| TS | Topological Sorting | 365 |
|
| HDAG | Hamiltonian Path in DAG | 247 |
|
| NWC | Negative Weight Cycle | 266 |
|
| SCC | Strongly Connected Components | 258 |
|
| 2SAT | 2-Satisfiability | 147 |
|
| GS | General Sink | 199 |
|
| SC | Semi-Connected Graph | 195 |
|
| SDAG | Shortest Paths in DAG | 219 |
|
