A network containing a collection of nodes, pairs of which are joined by edges.
| ID | Title | Solved By | Correct Ratio |
|---|---|---|---|
| DEG | Degree Array | 2674 |
|
| DDEG | Double-Degree Array | 2114 |
|
| BFS | Breadth-First Search | 1255 |
|
| CC | Connected Components | 1222 |
|
| BIP | Testing Bipartiteness | 663 |
|
| DAG | Testing Acyclicity | 725 |
|
| DIJ | Dijkstra's Algorithm | 727 |
|
| SQ | Square in a Graph | 476 |
|
| BF | Bellman-Ford Algorithm | 524 |
|
| CTE | Shortest Cycle Through a Given Edge | 434 |
|
| TS | Topological Sorting | 570 |
|
| HDAG | Hamiltonian Path in DAG | 417 |
|
| NWC | Negative Weight Cycle | 418 |
|
| SCC | Strongly Connected Components | 420 |
|
| 2SAT | 2-Satisfiability | 259 |
|
| GS | General Sink | 306 |
|
| SC | Semi-Connected Graph | 299 |
|
| SDAG | Shortest Paths in DAG | 354 |
|
