Hakyll.Core.DirectedGraph.DependencySolver

Given a dependency graph, this module provides a function that will generate an order in which the graph can be visited, so that all the dependencies of a given node have been visited before the node itself is visited.

Documentation

solveDependencies

Arguments

:: Ord a

=> DirectedGraph a

Graph

-> [a]

Resulting plan

Solve a dependency graph. This function returns an order to run the different nodes