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

ID Title Solved By Correct Ratio
DEG Degree Array 2151
DDEG Double-Degree Array 1689
BFS Breadth-First Search 982
CC Connected Components 962
BIP Testing Bipartiteness 526
DAG Testing Acyclicity 559
DIJ Dijkstra's Algorithm 555
SQ Square in a Graph 382
BF Bellman-Ford Algorithm 401
CTE Shortest Cycle Through a Given Edge 311
TS Topological Sorting 451
HDAG Hamiltonian Path in DAG 315
NWC Negative Weight Cycle 314
SCC Strongly Connected Components 321
2SAT 2-Satisfiability 187
GS General Sink 243
SC Semi-Connected Graph 238
SDAG Shortest Paths in DAG 260