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

ID Title Solved By Correct Ratio
DEG Degree Array 1500
DDEG Double-Degree Array 1197
BFS Breadth-First Search 712
CC Connected Components 692
BIP Testing Bipartiteness 405
DAG Testing Acyclicity 396
DIJ Dijkstra's Algorithm 383
SQ Square in a Graph 282
BF Bellman-Ford Algorithm 291
CTE Shortest Cycle Through a Given Edge 204
TS Topological Sorting 315
HDAG Hamiltonian Path in DAG 215
NWC Negative Weight Cycle 227
SCC Strongly Connected Components 224
2SAT 2-Satisfiability 128
GS General Sink 174
SC Semi-Connected Graph 168
SDAG Shortest Paths in DAG 186