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

ID Title Solved By Correct Ratio
DEG Degree Array 1247
DDEG Double-Degree Array 1002
BFS Breadth-First Search 592
CC Connected Components 584
BIP Testing Bipartiteness 348
DAG Testing Acyclicity 340
DIJ Dijkstra's Algorithm 322
SQ Square in a Graph 239
BF Bellman-Ford Algorithm 248
CTE Shortest Cycle Through a Given Edge 177
TS Topological Sorting 273
HDAG Hamiltonian Path in DAG 187
NWC Negative Weight Cycle 194
SCC Strongly Connected Components 197
2SAT 2-Satisfiability 112
GS General Sink 154
SC Semi-Connected Graph 148
SDAG Shortest Paths in DAG 160