A network containing a collection of nodes, pairs of which are joined by edges.
| ID | Title | Solved By | Correct Ratio |
|---|---|---|---|
| DEG | Degree Array | 2703 |
|
| DDEG | Double-Degree Array | 2133 |
|
| BFS | Breadth-First Search | 1267 |
|
| CC | Connected Components | 1234 |
|
| BIP | Testing Bipartiteness | 672 |
|
| DAG | Testing Acyclicity | 733 |
|
| DIJ | Dijkstra's Algorithm | 736 |
|
| SQ | Square in a Graph | 489 |
|
| BF | Bellman-Ford Algorithm | 531 |
|
| CTE | Shortest Cycle Through a Given Edge | 442 |
|
| TS | Topological Sorting | 579 |
|
| HDAG | Hamiltonian Path in DAG | 424 |
|
| NWC | Negative Weight Cycle | 424 |
|
| SCC | Strongly Connected Components | 426 |
|
| 2SAT | 2-Satisfiability | 263 |
|
| GS | General Sink | 312 |
|
| SC | Semi-Connected Graph | 304 |
|
| SDAG | Shortest Paths in DAG | 359 |
|
