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

ID Title Solved By Correct Ratio
DEG Degree Array 1529
DDEG Double-Degree Array 1217
BFS Breadth-First Search 723
CC Connected Components 702
BIP Testing Bipartiteness 410
DAG Testing Acyclicity 404
DIJ Dijkstra's Algorithm 388
SQ Square in a Graph 286
BF Bellman-Ford Algorithm 296
CTE Shortest Cycle Through a Given Edge 210
TS Topological Sorting 320
HDAG Hamiltonian Path in DAG 219
NWC Negative Weight Cycle 233
SCC Strongly Connected Components 229
2SAT 2-Satisfiability 131
GS General Sink 179
SC Semi-Connected Graph 173
SDAG Shortest Paths in DAG 190