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

ID Title Solved By Correct Ratio
DEG Degree Array 1374
DDEG Double-Degree Array 1090
BFS Breadth-First Search 645
CC Connected Components 629
BIP Testing Bipartiteness 373
DAG Testing Acyclicity 362
DIJ Dijkstra's Algorithm 350
SQ Square in a Graph 258
BF Bellman-Ford Algorithm 268
CTE Shortest Cycle Through a Given Edge 192
TS Topological Sorting 292
HDAG Hamiltonian Path in DAG 201
NWC Negative Weight Cycle 210
SCC Strongly Connected Components 210
2SAT 2-Satisfiability 121
GS General Sink 164
SC Semi-Connected Graph 157
SDAG Shortest Paths in DAG 172