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

ID Title Solved By Correct Ratio
DEG Degree Array 1158
DDEG Double-Degree Array 930
BFS Breadth-First Search 556
CC Connected Components 552
BIP Testing Bipartiteness 334
DAG Testing Acyclicity 323
DIJ Dijkstra's Algorithm 304
SQ Square in a Graph 230
BF Bellman-Ford Algorithm 233
CTE Shortest Cycle Through a Given Edge 167
TS Topological Sorting 261
HDAG Hamiltonian Path in DAG 179
NWC Negative Weight Cycle 183
SCC Strongly Connected Components 191
2SAT 2-Satisfiability 107
GS General Sink 148
SC Semi-Connected Graph 142
SDAG Shortest Paths in DAG 152