Safe Haskell | None |
---|---|
Language | Haskell2010 |
- data ComputeDag v e = ComputeDag {}
- computeGraphToGraph :: ComputeDag v e -> Graph v e
- graphToComputeGraph :: Graph v e -> ComputeDag v e
- _mapVerticesAdj :: (Vertex v -> v') -> AdjacencyMap v e -> AdjacencyMap v' e
- mapVertices :: (Vertex v -> v') -> ComputeDag v e -> ComputeDag v' e
- mapVertexData :: (v -> v') -> ComputeDag v e -> ComputeDag v' e
- buildCGraph :: (GraphOperations v e, Show v, Show e) => v -> DagTry (ComputeDag v e)
- graphDataLexico :: ComputeDag v e -> [v]
Documentation
data ComputeDag v e Source #
A DAG of computation nodes.
At a high level, it is a total function with a number of inputs and a number of outputs.
Note about the edges: the edges flow along the path of dependencies.
computeGraphToGraph :: ComputeDag v e -> Graph v e Source #
Conversion
graphToComputeGraph :: Graph v e -> ComputeDag v e Source #
Conversion
_mapVerticesAdj :: (Vertex v -> v') -> AdjacencyMap v e -> AdjacencyMap v' e Source #
mapVertices :: (Vertex v -> v') -> ComputeDag v e -> ComputeDag v' e Source #
mapVertexData :: (v -> v') -> ComputeDag v e -> ComputeDag v' e Source #
buildCGraph :: (GraphOperations v e, Show v, Show e) => v -> DagTry (ComputeDag v e) Source #
graphDataLexico :: ComputeDag v e -> [v] Source #