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

ID Title Solved By Correct Ratio
DEG Degree Array 2341
DDEG Double-Degree Array 1845
BFS Breadth-First Search 1076
CC Connected Components 1052
BIP Testing Bipartiteness 571
DAG Testing Acyclicity 606
DIJ Dijkstra's Algorithm 605
SQ Square in a Graph 419
BF Bellman-Ford Algorithm 439
CTE Shortest Cycle Through a Given Edge 346
TS Topological Sorting 490
HDAG Hamiltonian Path in DAG 348
NWC Negative Weight Cycle 348
SCC Strongly Connected Components 353
2SAT 2-Satisfiability 212
GS General Sink 270
SC Semi-Connected Graph 265
SDAG Shortest Paths in DAG 292