A network containing a collection of nodes, pairs of which are joined by edges.
| ID | Title | Solved By | Correct Ratio |
|---|---|---|---|
| DEG | Degree Array | 2647 |
|
| DDEG | Double-Degree Array | 2085 |
|
| BFS | Breadth-First Search | 1249 |
|
| CC | Connected Components | 1206 |
|
| BIP | Testing Bipartiteness | 658 |
|
| DAG | Testing Acyclicity | 720 |
|
| DIJ | Dijkstra's Algorithm | 723 |
|
| SQ | Square in a Graph | 472 |
|
| BF | Bellman-Ford Algorithm | 519 |
|
| CTE | Shortest Cycle Through a Given Edge | 431 |
|
| TS | Topological Sorting | 567 |
|
| HDAG | Hamiltonian Path in DAG | 414 |
|
| NWC | Negative Weight Cycle | 414 |
|
| SCC | Strongly Connected Components | 417 |
|
| 2SAT | 2-Satisfiability | 257 |
|
| GS | General Sink | 304 |
|
| SC | Semi-Connected Graph | 297 |
|
| SDAG | Shortest Paths in DAG | 351 |
|
