A network containing a collection of nodes, pairs of which are joined by edges.
ID | Title | Solved By | Correct Ratio |
---|---|---|---|
DEG | Degree Array | 2469 |
|
DDEG | Double-Degree Array | 1951 |
|
BFS | Breadth-First Search | 1157 |
|
CC | Connected Components | 1122 |
|
BIP | Testing Bipartiteness | 602 |
|
DAG | Testing Acyclicity | 663 |
|
DIJ | Dijkstra's Algorithm | 660 |
|
SQ | Square in a Graph | 445 |
|
BF | Bellman-Ford Algorithm | 467 |
|
CTE | Shortest Cycle Through a Given Edge | 387 |
|
TS | Topological Sorting | 541 |
|
HDAG | Hamiltonian Path in DAG | 393 |
|
NWC | Negative Weight Cycle | 371 |
|
SCC | Strongly Connected Components | 396 |
|
2SAT | 2-Satisfiability | 242 |
|
GS | General Sink | 286 |
|
SC | Semi-Connected Graph | 281 |
|
SDAG | Shortest Paths in DAG | 310 |
|