Artifacts using jutils version 1.0
This package is a generic implementation of a method for producing spreadsheets out of pipeline graphs. It is based on calculating a minimum set of paths that covers all the edges and this in turn is computed by solving a minimum flow problem on the graph that goes from all the left-most nodes to the right-most ones (setting at 1 the minimum flow for each edge). The project originated in the ISA-Tools project (http://isa-tools.org).
Last Release on Mar 16, 2015
This package is a generic implementation of a method for producing spreadsheets out of pipeline graph. It is based on the node splitting metod: all the nodes in the input pipeline are reduced to *normalized* nodes, i.e.: nodes that have at most one input and at most one output. This is done by taking those nodes having splitting or pooling, creating copies of them and distributing the excessive inputs or outputs over the copies.
Last Release on Sep 15, 2010