src/library/Data/TypedGraph/Partition/FromVerigraph.hs from Verites/verigraph

src/library/Data/TypedGraph/Partition/FromVerigraph.hs

import           Data.Graphs                     as G

Found

import Data.Graphs as G

Perhaps

import Data.Graphs as Graph

Applying this change:

    injEdges = filter (\x -> (all (\e' -> TGM.applyEdgeIdUnsafe n e' /= x) (TG.edgeIds $ TGM.domainGraph n))) (TG.edgeIds $ TGM.codomainGraph n)

Found

\ x ->
  (all (\ e' -> TGM.applyEdgeIdUnsafe n e' /= x)
     (TG.edgeIds $ TGM.domainGraph n))

Perhaps

\ x ->
  all (\ e' -> TGM.applyEdgeIdUnsafe n e' /= x)
    (TG.edgeIds $ TGM.domainGraph n)

    injNodes = filter (\x -> (all (\n' -> TGM.applyNodeIdUnsafe n n' /= x) (TG.nodeIds $ TGM.domainGraph n))) (TG.nodeIds $ TGM.codomainGraph n)

Found

\ x ->
  (all (\ n' -> TGM.applyNodeIdUnsafe n n' /= x)
     (TG.nodeIds $ TGM.domainGraph n))

Perhaps

\ x ->
  all (\ n' -> TGM.applyNodeIdUnsafe n n' /= x)
    (TG.nodeIds $ TGM.domainGraph n)

Verites/verigraph