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

DEG  Degree Array  1835 

DDEG  DoubleDegree Array  1444 

BFS  BreadthFirst Search  848 

CC  Connected Components  828 

BIP  Testing Bipartiteness  473 

DAG  Testing Acyclicity  478 

DIJ  Dijkstra's Algorithm  466 

SQ  Square in a Graph  332 

BF  BellmanFord Algorithm  354 

CTE  Shortest Cycle Through a Given Edge  250 

TS  Topological Sorting  375 

HDAG  Hamiltonian Path in DAG  254 

NWC  Negative Weight Cycle  273 

SCC  Strongly Connected Components  265 

2SAT  2Satisfiability  150 

GS  General Sink  205 

SC  SemiConnected Graph  199 

SDAG  Shortest Paths in DAG  226 
