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

ID Title Solved By Correct Ratio
DEG Degree Array 1291
DDEG Double-Degree Array 1029
BFS Breadth-First Search 606
CC Connected Components 594
BIP Testing Bipartiteness 354
DAG Testing Acyclicity 345
DIJ Dijkstra's Algorithm 326
SQ Square in a Graph 246
BF Bellman-Ford Algorithm 252
CTE Shortest Cycle Through a Given Edge 182
TS Topological Sorting 279
HDAG Hamiltonian Path in DAG 193
NWC Negative Weight Cycle 198
SCC Strongly Connected Components 202
2SAT 2-Satisfiability 116
GS General Sink 158
SC Semi-Connected Graph 152
SDAG Shortest Paths in DAG 164