A network containing a collection of nodes, pairs of which are joined by edges.
ID | Title | Solved By | Correct Ratio |
---|---|---|---|
DEG | Degree Array | 2452 |
|
DDEG | Double-Degree Array | 1937 |
|
BFS | Breadth-First Search | 1145 |
|
CC | Connected Components | 1113 |
|
BIP | Testing Bipartiteness | 600 |
|
DAG | Testing Acyclicity | 658 |
|
DIJ | Dijkstra's Algorithm | 658 |
|
SQ | Square in a Graph | 442 |
|
BF | Bellman-Ford Algorithm | 464 |
|
CTE | Shortest Cycle Through a Given Edge | 385 |
|
TS | Topological Sorting | 538 |
|
HDAG | Hamiltonian Path in DAG | 391 |
|
NWC | Negative Weight Cycle | 369 |
|
SCC | Strongly Connected Components | 394 |
|
2SAT | 2-Satisfiability | 241 |
|
GS | General Sink | 284 |
|
SC | Semi-Connected Graph | 279 |
|
SDAG | Shortest Paths in DAG | 309 |
|