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

ID Title Solved By Correct Ratio
DEG Degree Array 2293
DDEG Double-Degree Array 1805
BFS Breadth-First Search 1051
CC Connected Components 1027
BIP Testing Bipartiteness 557
DAG Testing Acyclicity 594
DIJ Dijkstra's Algorithm 591
SQ Square in a Graph 406
BF Bellman-Ford Algorithm 426
CTE Shortest Cycle Through a Given Edge 334
TS Topological Sorting 479
HDAG Hamiltonian Path in DAG 338
NWC Negative Weight Cycle 336
SCC Strongly Connected Components 343
2SAT 2-Satisfiability 203
GS General Sink 261
SC Semi-Connected Graph 256
SDAG Shortest Paths in DAG 278