A network containing a collection of nodes, pairs of which are joined by edges.
| ID | Title | Solved By | Correct Ratio |
|---|---|---|---|
| DEG | Degree Array | 2724 |
|
| DDEG | Double-Degree Array | 2149 |
|
| BFS | Breadth-First Search | 1281 |
|
| CC | Connected Components | 1245 |
|
| BIP | Testing Bipartiteness | 679 |
|
| DAG | Testing Acyclicity | 741 |
|
| DIJ | Dijkstra's Algorithm | 746 |
|
| SQ | Square in a Graph | 495 |
|
| BF | Bellman-Ford Algorithm | 539 |
|
| CTE | Shortest Cycle Through a Given Edge | 448 |
|
| TS | Topological Sorting | 586 |
|
| HDAG | Hamiltonian Path in DAG | 431 |
|
| NWC | Negative Weight Cycle | 432 |
|
| SCC | Strongly Connected Components | 432 |
|
| 2SAT | 2-Satisfiability | 269 |
|
| GS | General Sink | 318 |
|
| SC | Semi-Connected Graph | 310 |
|
| SDAG | Shortest Paths in DAG | 365 |
|
