Haskell, Genetic Algorithm, Graph Theory, Programming.
`elem` reachable (a, 0 :: Int) (U.fromUndirected g) extraEdges :: Ord a => U.Graph a -> Int extraEdges g = edges - (vertices - components) where vertices = U.vertexCount g edges = U.edgeCount g components = vertexCount (scc (toAdjacencyMap (U.fromUndirected g))) scoreGraph :: U.Graph (String, Int)