A network containing a collection of nodes, pairs of which are joined by edges.
| ID | Title | Solved By | Correct Ratio |
|---|---|---|---|
| DEG | Degree Array | 2058 |
|
| DDEG | Double-Degree Array | 1611 |
|
| BFS | Breadth-First Search | 932 |
|
| CC | Connected Components | 916 |
|
| BIP | Testing Bipartiteness | 508 |
|
| DAG | Testing Acyclicity | 526 |
|
| DIJ | Dijkstra's Algorithm | 518 |
|
| SQ | Square in a Graph | 369 |
|
| BF | Bellman-Ford Algorithm | 388 |
|
| CTE | Shortest Cycle Through a Given Edge | 291 |
|
| TS | Topological Sorting | 424 |
|
| HDAG | Hamiltonian Path in DAG | 293 |
|
| NWC | Negative Weight Cycle | 304 |
|
| SCC | Strongly Connected Components | 300 |
|
| 2SAT | 2-Satisfiability | 171 |
|
| GS | General Sink | 233 |
|
| SC | Semi-Connected Graph | 229 |
|
| SDAG | Shortest Paths in DAG | 250 |
|
