net.aequologica.neo.dagr.jgrapht

Class TransitiveReduction<V,E>

java.lang.Object

net.aequologica.neo.dagr.jgrapht.TransitiveReduction<V,E>

public class TransitiveReduction<V,E>
extends Object

An implementation of Harry Hsu's transitive reduction algorithm.

cf. Harry Hsu. "An algorithm for finding a minimal equivalent graph of a digraph.", Journal of the ACM, 22(1):11-16, January 1975.

This is a port from a python example by Michael Clerx, posted as an answer to a question about transitive reduction algorithm pseudocode on Stack Overflow

Since:

Aug 13, 2015

Author:

Christophe Thiebaud

Constructor Summary

Constructors

Constructor and Description
TransitiveReduction()

Method Summary

Modifier and Type	Method and Description
void	reduce(org.jgrapht.DirectedGraph<V,E> directedGraph) This method will remove all transitive edges from the graph passed as input parameter.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

TransitiveReduction

public TransitiveReduction()

Method Detail

reduce

public void reduce(org.jgrapht.DirectedGraph<V,E> directedGraph)

This method will remove all transitive edges from the graph passed as input parameter.

You may want to clone the graph before, as transitive edges will be pitilessly removed.

e.g.

 
 DirectedGraph<V, T> soonToBePrunedDirectedGraph;
 
 new TransitiveReduction<V, T>().reduce(soonToBePrunedDirectedGraph);
 
 // pruned !
 
 

Parameters:

directedGraph - the directed graph that will be reduced transitively