A network containing a collection of nodes, pairs of which are joined by edges.
| ID | Title | Solved By | Correct Ratio |
|---|---|---|---|
| DEG | Degree Array | 2689 |
|
| DDEG | Double-Degree Array | 2126 |
|
| BFS | Breadth-First Search | 1263 |
|
| CC | Connected Components | 1230 |
|
| BIP | Testing Bipartiteness | 669 |
|
| DAG | Testing Acyclicity | 731 |
|
| DIJ | Dijkstra's Algorithm | 732 |
|
| SQ | Square in a Graph | 486 |
|
| BF | Bellman-Ford Algorithm | 529 |
|
| CTE | Shortest Cycle Through a Given Edge | 439 |
|
| TS | Topological Sorting | 577 |
|
| HDAG | Hamiltonian Path in DAG | 423 |
|
| NWC | Negative Weight Cycle | 423 |
|
| SCC | Strongly Connected Components | 425 |
|
| 2SAT | 2-Satisfiability | 261 |
|
| GS | General Sink | 311 |
|
| SC | Semi-Connected Graph | 303 |
|
| SDAG | Shortest Paths in DAG | 357 |
|
