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

ID Title Solved By Correct Ratio
DEG Degree Array 2208
DDEG Double-Degree Array 1736
BFS Breadth-First Search 1007
CC Connected Components 982
BIP Testing Bipartiteness 538
DAG Testing Acyclicity 570
DIJ Dijkstra's Algorithm 569
SQ Square in a Graph 389
BF Bellman-Ford Algorithm 409
CTE Shortest Cycle Through a Given Edge 318
TS Topological Sorting 461
HDAG Hamiltonian Path in DAG 323
NWC Negative Weight Cycle 322
SCC Strongly Connected Components 329
2SAT 2-Satisfiability 192
GS General Sink 249
SC Semi-Connected Graph 244
SDAG Shortest Paths in DAG 266