A network containing a collection of nodes, pairs of which are joined by edges.
| ID | Title | Solved By | Correct Ratio |
|---|---|---|---|
| DEG | Degree Array | 2730 |
|
| DDEG | Double-Degree Array | 2156 |
|
| BFS | Breadth-First Search | 1284 |
|
| CC | Connected Components | 1251 |
|
| BIP | Testing Bipartiteness | 683 |
|
| DAG | Testing Acyclicity | 745 |
|
| DIJ | Dijkstra's Algorithm | 750 |
|
| SQ | Square in a Graph | 498 |
|
| BF | Bellman-Ford Algorithm | 543 |
|
| CTE | Shortest Cycle Through a Given Edge | 452 |
|
| TS | Topological Sorting | 589 |
|
| HDAG | Hamiltonian Path in DAG | 434 |
|
| NWC | Negative Weight Cycle | 435 |
|
| SCC | Strongly Connected Components | 434 |
|
| 2SAT | 2-Satisfiability | 271 |
|
| GS | General Sink | 320 |
|
| SC | Semi-Connected Graph | 312 |
|
| SDAG | Shortest Paths in DAG | 369 |
|
