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

ID Title Solved By Correct Ratio
DEG Degree Array 2375
DDEG Double-Degree Array 1868
BFS Breadth-First Search 1093
CC Connected Components 1067
BIP Testing Bipartiteness 582
DAG Testing Acyclicity 617
DIJ Dijkstra's Algorithm 617
SQ Square in a Graph 426
BF Bellman-Ford Algorithm 450
CTE Shortest Cycle Through a Given Edge 353
TS Topological Sorting 500
HDAG Hamiltonian Path in DAG 356
NWC Negative Weight Cycle 357
SCC Strongly Connected Components 359
2SAT 2-Satisfiability 214
GS General Sink 274
SC Semi-Connected Graph 268
SDAG Shortest Paths in DAG 299