Fix basic pathing

src/Dodge/Graph.hs

@@ -1,14 +1,19 @@
+{-# LANGUAGE RankNTypes #-}
 module Dodge.Graph
     ( pairsToSCC
     , incidenceToFunction
     , pairsToIncidence
+    , graphToEdges
     ) where
 -- this deserves tests
 import Data.List.Extra
 
-import Data.Bifunctor (first)
+--import Data.Bifunctor (first)
 import Data.Graph
 import Data.Maybe
+import qualified Data.Graph.Inductive.Graph as F
+import qualified Data.Graph.Inductive.PatriciaTree as F
+import Data.Bifunctor
 
 pairsToIncidence :: Ord a => [(a,a)] -> [(a,[a])]
 pairsToIncidence 
@@ -24,3 +29,8 @@ mkNode (x,xs) = (x,x,xs)
 
 pairsToSCC :: Ord a => [(a,a)] -> [SCC a]
 pairsToSCC = stronglyConnComp . map mkNode . pairsToIncidence
+
+graphToEdges :: forall a b . F.Gr a b -> [(a,a)]
+graphToEdges g = map (bimap f f) $ F.edges g
+  where
+    f n = fromJust . lookup n $ F.labNodes g