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

ID Title Solved By Correct Ratio
DEG Degree Array 1709
DDEG Double-Degree Array 1350
BFS Breadth-First Search 792
CC Connected Components 774
BIP Testing Bipartiteness 443
DAG Testing Acyclicity 443
DIJ Dijkstra's Algorithm 432
SQ Square in a Graph 311
BF Bellman-Ford Algorithm 325
CTE Shortest Cycle Through a Given Edge 232
TS Topological Sorting 349
HDAG Hamiltonian Path in DAG 234
NWC Negative Weight Cycle 254
SCC Strongly Connected Components 247
2SAT 2-Satisfiability 141
GS General Sink 191
SC Semi-Connected Graph 186
SDAG Shortest Paths in DAG 207