A network containing a collection of nodes, pairs of which are joined by edges.
| ID | Title | Solved By | Correct Ratio |
|---|---|---|---|
| DEG | Degree Array | 2605 |
|
| DDEG | Double-Degree Array | 2056 |
|
| BFS | Breadth-First Search | 1233 |
|
| CC | Connected Components | 1192 |
|
| BIP | Testing Bipartiteness | 650 |
|
| DAG | Testing Acyclicity | 711 |
|
| DIJ | Dijkstra's Algorithm | 713 |
|
| SQ | Square in a Graph | 467 |
|
| BF | Bellman-Ford Algorithm | 512 |
|
| CTE | Shortest Cycle Through a Given Edge | 426 |
|
| TS | Topological Sorting | 561 |
|
| HDAG | Hamiltonian Path in DAG | 410 |
|
| NWC | Negative Weight Cycle | 408 |
|
| SCC | Strongly Connected Components | 413 |
|
| 2SAT | 2-Satisfiability | 254 |
|
| GS | General Sink | 301 |
|
| SC | Semi-Connected Graph | 293 |
|
| SDAG | Shortest Paths in DAG | 346 |
|
