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

ID Title Solved By Correct Ratio
DEG Degree Array 1170
DDEG Double-Degree Array 942
BFS Breadth-First Search 564
CC Connected Components 560
BIP Testing Bipartiteness 338
DAG Testing Acyclicity 326
DIJ Dijkstra's Algorithm 311
SQ Square in a Graph 232
BF Bellman-Ford Algorithm 238
CTE Shortest Cycle Through a Given Edge 170
TS Topological Sorting 264
HDAG Hamiltonian Path in DAG 180
NWC Negative Weight Cycle 185
SCC Strongly Connected Components 192
2SAT 2-Satisfiability 108
GS General Sink 149
SC Semi-Connected Graph 143
SDAG Shortest Paths in DAG 154