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

ID Title Solved By Correct Ratio
DEG Degree Array 1729
DDEG Double-Degree Array 1365
BFS Breadth-First Search 800
CC Connected Components 779
BIP Testing Bipartiteness 447
DAG Testing Acyclicity 447
DIJ Dijkstra's Algorithm 436
SQ Square in a Graph 312
BF Bellman-Ford Algorithm 329
CTE Shortest Cycle Through a Given Edge 235
TS Topological Sorting 352
HDAG Hamiltonian Path in DAG 237
NWC Negative Weight Cycle 255
SCC Strongly Connected Components 250
2SAT 2-Satisfiability 142
GS General Sink 193
SC Semi-Connected Graph 188
SDAG Shortest Paths in DAG 210