A network containing a collection of nodes, pairs of which are joined by edges.

ID Title Solved By Correct Ratio
DEG Degree Array 1665
DDEG Double-Degree Array 1319
BFS Breadth-First Search 777
CC Connected Components 761
BIP Testing Bipartiteness 436
DAG Testing Acyclicity 436
DIJ Dijkstra's Algorithm 421
SQ Square in a Graph 304
BF Bellman-Ford Algorithm 316
CTE Shortest Cycle Through a Given Edge 229
TS Topological Sorting 345
HDAG Hamiltonian Path in DAG 231
NWC Negative Weight Cycle 249
SCC Strongly Connected Components 245
2SAT 2-Satisfiability 140
GS General Sink 190
SC Semi-Connected Graph 185
SDAG Shortest Paths in DAG 203