A network containing a collection of nodes, pairs of which are joined by edges.
| ID | Title | Solved By | Correct Ratio |
|---|---|---|---|
| DEG | Degree Array | 2602 |
|
| DDEG | Double-Degree Array | 2052 |
|
| BFS | Breadth-First Search | 1230 |
|
| CC | Connected Components | 1190 |
|
| BIP | Testing Bipartiteness | 648 |
|
| DAG | Testing Acyclicity | 710 |
|
| DIJ | Dijkstra's Algorithm | 711 |
|
| SQ | Square in a Graph | 466 |
|
| BF | Bellman-Ford Algorithm | 511 |
|
| CTE | Shortest Cycle Through a Given Edge | 425 |
|
| TS | Topological Sorting | 560 |
|
| HDAG | Hamiltonian Path in DAG | 409 |
|
| 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 |
|
