A network containing a collection of nodes, pairs of which are joined by edges.
| ID | Title | Solved By | Correct Ratio |
|---|---|---|---|
| DEG | Degree Array | 2735 |
|
| DDEG | Double-Degree Array | 2158 |
|
| BFS | Breadth-First Search | 1285 |
|
| CC | Connected Components | 1253 |
|
| BIP | Testing Bipartiteness | 684 |
|
| DAG | Testing Acyclicity | 746 |
|
| DIJ | Dijkstra's Algorithm | 751 |
|
| SQ | Square in a Graph | 499 |
|
| BF | Bellman-Ford Algorithm | 543 |
|
| CTE | Shortest Cycle Through a Given Edge | 452 |
|
| TS | Topological Sorting | 590 |
|
| HDAG | Hamiltonian Path in DAG | 435 |
|
| NWC | Negative Weight Cycle | 436 |
|
| SCC | Strongly Connected Components | 436 |
|
| 2SAT | 2-Satisfiability | 272 |
|
| GS | General Sink | 322 |
|
| SC | Semi-Connected Graph | 314 |
|
| SDAG | Shortest Paths in DAG | 370 |
|
