Algorithm::Graphs::TransitiveClosure - Calculate the transitive closure.

This is an implementation of the well known *Floyd-Warshall* algorithm. [1,2] The subroutine "floyd_warshall" takes a directed graph, and calculates its transitive closure, which will be returned. The given graph is actually modified, so be sure to p...

ABIGAIL/Algorithm-Graphs-TransitiveClosure-2009110901 - 09 Nov 2009 22:52:55 GMT - Search in distribution

Graph - graph data structures and algorithms

Non-Description This module is not for drawing or rendering any sort of *graphics* or *images*, business, visualization, or otherwise. Description Instead, this module is for creating *abstract data structures* called graphs, and for doing various op...

JHI/Graph-0.9704 - 07 Oct 2015 12:34:03 GMT - Search in distribution

2 results (0.152 seconds)