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

ID Title Solved By Correct Ratio
DEG Degree Array 1145
DDEG Double-Degree Array 917
BFS Breadth-First Search 549
CC Connected Components 546
BIP Testing Bipartiteness 328
DAG Testing Acyclicity 317
DIJ Dijkstra's Algorithm 299
SQ Square in a Graph 223
BF Bellman-Ford Algorithm 227
CTE Shortest Cycle Through a Given Edge 162
TS Topological Sorting 255
HDAG Hamiltonian Path in DAG 173
NWC Negative Weight Cycle 179
SCC Strongly Connected Components 188
2SAT 2-Satisfiability 104
GS General Sink 145
SC Semi-Connected Graph 139
SDAG Shortest Paths in DAG 149