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

ID Title Solved By Correct Ratio
DEG Degree Array 1568
DDEG Double-Degree Array 1244
BFS Breadth-First Search 733
CC Connected Components 714
BIP Testing Bipartiteness 415
DAG Testing Acyclicity 410
DIJ Dijkstra's Algorithm 396
SQ Square in a Graph 288
BF Bellman-Ford Algorithm 300
CTE Shortest Cycle Through a Given Edge 213
TS Topological Sorting 324
HDAG Hamiltonian Path in DAG 221
NWC Negative Weight Cycle 235
SCC Strongly Connected Components 231
2SAT 2-Satisfiability 133
GS General Sink 180
SC Semi-Connected Graph 175
SDAG Shortest Paths in DAG 193