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

ID Title Solved By Correct Ratio
DEG Degree Array 1330
DDEG Double-Degree Array 1062
BFS Breadth-First Search 626
CC Connected Components 617
BIP Testing Bipartiteness 364
DAG Testing Acyclicity 355
DIJ Dijkstra's Algorithm 340
SQ Square in a Graph 251
BF Bellman-Ford Algorithm 264
CTE Shortest Cycle Through a Given Edge 187
TS Topological Sorting 285
HDAG Hamiltonian Path in DAG 197
NWC Negative Weight Cycle 205
SCC Strongly Connected Components 206
2SAT 2-Satisfiability 118
GS General Sink 161
SC Semi-Connected Graph 154
SDAG Shortest Paths in DAG 167