A network containing a collection of nodes, pairs of which are joined by edges.
| ID | Title | Solved By | Correct Ratio |
|---|---|---|---|
| DEG | Degree Array | 2574 |
|
| DDEG | Double-Degree Array | 2035 |
|
| BFS | Breadth-First Search | 1220 |
|
| CC | Connected Components | 1182 |
|
| BIP | Testing Bipartiteness | 641 |
|
| DAG | Testing Acyclicity | 703 |
|
| DIJ | Dijkstra's Algorithm | 704 |
|
| SQ | Square in a Graph | 462 |
|
| BF | Bellman-Ford Algorithm | 506 |
|
| CTE | Shortest Cycle Through a Given Edge | 421 |
|
| TS | Topological Sorting | 555 |
|
| HDAG | Hamiltonian Path in DAG | 405 |
|
| NWC | Negative Weight Cycle | 404 |
|
| SCC | Strongly Connected Components | 409 |
|
| 2SAT | 2-Satisfiability | 251 |
|
| GS | General Sink | 297 |
|
| SC | Semi-Connected Graph | 290 |
|
| SDAG | Shortest Paths in DAG | 342 |
|
