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

ID Title Solved By Correct Ratio
DEG Degree Array 1606
DDEG Double-Degree Array 1274
BFS Breadth-First Search 752
CC Connected Components 730
BIP Testing Bipartiteness 424
DAG Testing Acyclicity 419
DIJ Dijkstra's Algorithm 406
SQ Square in a Graph 295
BF Bellman-Ford Algorithm 306
CTE Shortest Cycle Through a Given Edge 220
TS Topological Sorting 332
HDAG Hamiltonian Path in DAG 226
NWC Negative Weight Cycle 240
SCC Strongly Connected Components 237
2SAT 2-Satisfiability 137
GS General Sink 184
SC Semi-Connected Graph 180
SDAG Shortest Paths in DAG 197