Commit ce6d6597 authored by Mart Lubbers's avatar Mart Lubbers

uncomment graph modules

parent cea25d12
......@@ -3,7 +3,7 @@ definition module Data.Graph
from Data.Maybe import ::Maybe
from Data.Map import :: Map
from Text.GenJSON import :: JSONNode, generic JSONEncode, generic JSONDecode
from Data.Generics.GenEq import generic gEq
from Data.GenEq import generic gEq
//:: Graph n e
:: Graph n e =
......
......@@ -12,7 +12,7 @@ import Data.Map
import Data.Maybe
import Data.Functor
import Text.GenJSON
from Data.Generics.GenEq import generic gEq
from Data.GenEq import generic gEq
:: Graph n e =
{ nodes :: !Map NodeIndex (Node n)
......
......@@ -5,7 +5,7 @@ definition module Data.Graph.Inductive.Graph
from Data.Maybe import :: Maybe
from StdOverloaded import class <, class ==
from StdClass import class Eq
from Data.Generics.GenLexOrd import generic gLexOrd, :: LexOrd
from Data.GenLexOrd import generic gLexOrd, :: LexOrd
// | Unlabeled node
:: Node :== Int
......
......@@ -13,7 +13,7 @@ import StdBool, StdTuple, StdFunc, StdMisc, StdEnum, StdString, StdOverloaded, S
import Data.List
import Data.Maybe
import Data.Functor
import Data.Generics.GenLexOrd
import Data.GenLexOrd
unLPath :: (LPath a) -> [LNode a]
unLPath (LP xs) = xs
......
......@@ -26,7 +26,7 @@ import qualified Data.IntMap.Strict as IM
from Data.List import instance Functor [], instance Applicative [], instance Monad []
import qualified Data.List as DL
import StdList, StdTuple, StdMisc, StdOrdList
import StdClass, StdFunc, StdOverloaded
import StdClass, StdFunctions, StdOverloaded
import Data.Maybe
import Control.Arrow
......
......@@ -92,19 +92,19 @@ import qualified Data.GenEq
import qualified Data.GenFDomain
import qualified Data.GenLexOrd
import qualified Data.GenZip
//import qualified Data.Graph
//import qualified Data.Graph.Inductive
//import qualified Data.Graph.Inductive.Basic
//import qualified Data.Graph.Inductive.Graph
//import qualified Data.Graph.Inductive.Internal.Queue
//import qualified Data.Graph.Inductive.Internal.RootPath
//import qualified Data.Graph.Inductive.Internal.Thread
//import qualified Data.Graph.Inductive.Monad
//import qualified Data.Graph.Inductive.NodeMap
//import qualified Data.Graph.Inductive.PatriciaTree
//import qualified Data.Graph.Inductive.Query
//import qualified Data.Graph.Inductive.Query.BFS
//import qualified Data.Graph.Inductive.Query.MaxFlow
import qualified Data.Graph
import qualified Data.Graph.Inductive
import qualified Data.Graph.Inductive.Basic
import qualified Data.Graph.Inductive.Graph
import qualified Data.Graph.Inductive.Internal.Queue
import qualified Data.Graph.Inductive.Internal.RootPath
import qualified Data.Graph.Inductive.Internal.Thread
import qualified Data.Graph.Inductive.Monad
import qualified Data.Graph.Inductive.NodeMap
import qualified Data.Graph.Inductive.PatriciaTree
import qualified Data.Graph.Inductive.Query
import qualified Data.Graph.Inductive.Query.BFS
import qualified Data.Graph.Inductive.Query.MaxFlow
import qualified Data.Graphviz
import qualified Data.Heap
import qualified Data.IntMap.Base
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment