Search results for "module:Algorithm::Graphs::TransitiveClosure"
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 UTC
Algorithm::Graphs::TransitiveClosure::Tiny - Calculate the transitive closure.
This module provides a single function, "floyd_warshall", which is exported on demand. It is an implementation of the well known *Floyd-Warshall* algorithm for computing the transitive closure of a graph. The code is taken from Algorithm::Graphs::Tra...
AAHAZRED/Algorithm-Graphs-TransitiveClosure-Tiny-1.03 - 05 May 2023 15:26:24 UTC
Algorithm::Graphs::Reachable::Tiny - Compute rechable nodes in a graph.
Provides a function to determine all nodes reachable from a set of nodes in a graph. A graph must be represented like this: my $graph = { this => {that => undef, # ... }, # ... }; In this example, there is an edge from 'this' to 'that'. Note that you...
AAHAZRED/Algorithm-Graphs-Reachable-Tiny-0.07 - 02 May 2023 05:04:17 UTC