35
32
-- (Edge'(..), allNodes, emptyGraph, insertEdge, graphToList, graphFromList, nodes, lookupEdge, outgoing, incoming, diagonal, transClos)
36
33
import qualified Agda.Utils.Graph.AdjacencyMap.Unidirectional as Graph
39
36
import Agda.Utils.Impossible
41
38
type Graph r f a = Graph.Graph (Node r f) (Node r f) a