Package mascoptLib.algos.digraph

This package contains algorithms working on digraphs.

See:
          Description

Class Summary
MinCut Provides an algorithm to compute the maximum st-flow and so minimum st-cut of a simple directed graph The algorithm used to compute the s-t flow max is Edmonds-Karp algorithm.
 

Package mascoptLib.algos.digraph Description

This package contains algorithms working on digraphs.