Finding the minimum equivalent digraph chart

I am looking for an implementation, preferably in Java, of an algorithm for finding the Minimum Equivalent Digraph Graph ( http://portal.acm.org/citation.cfm?id=321526.321534 ).

It would be even better to implement the "Approximation of the minimum equivalent digraph" http://cat.inist.fr/?aModele=afficheN&cpsidt=3634076 (requires ACM membership, sorry) alternative link http://www.cs.umd.edu/~ samir / grant / kry94b.ps (postscript)

+4

java algorithm graph

kohlerm Mar 15 '10 at 15:14

1 answer

Have you tried to look at java graph algorithm libraries like JGraphIT ?

+1

Riduidel Mar 15 '10 at 15:25

Source: https://habr.com/ru/post/1304162/

All Articles