findEdgeFromNames :: String -> String -> Graph -> Maybe Int
findEdgeFromNames f t g = elemIndex (qedge (whereIs f) (whereIs t) 1) (edges g)
    where whereIs s = getIndex s g
findEdgeFromNames :: String -> String -> Graph -> Maybe Int
findEdgeFromNames f t g = elemIndex (qedge (whereIs f) (whereIs t) 1) (edges g)
    where whereIs s = getIndex s g
findEdgeFromNames f t g = elemIndex (qedge (whereIs f) (whereIs t) 1) (edges g)
    where whereIs s = getIndex s g