A network containing a collection of nodes, pairs of which are joined by edges.
ID  Title  Solved By  Correct Ratio 

DEG  Degree Array  1184 

DDEG  DoubleDegree Array  951 

BFS  BreadthFirst Search  570 

CC  Connected Components  565 

BIP  Testing Bipartiteness  341 

DAG  Testing Acyclicity  331 

DIJ  Dijkstra's Algorithm  315 

SQ  Square in a Graph  235 

BF  BellmanFord Algorithm  240 

CTE  Shortest Cycle Through a Given Edge  171 

TS  Topological Sorting  265 

HDAG  Hamiltonian Path in DAG  182 

NWC  Negative Weight Cycle  186 

SCC  Strongly Connected Components  195 

2SAT  2Satisfiability  108 

GS  General Sink  150 

SC  SemiConnected Graph  145 

SDAG  Shortest Paths in DAG  155 
