Haskell, Genetic Algorithm, Graph Theory, Programming.
score one of these graphs. There are two kinds of things I care about: the probability of being able to get between any two of the built-in locations, and the number of “excess” edges that create multiple paths. hasPath :: String -> String -> U.Graph (String, Int) -> Bool hasPath a b g = (b, 0)