Search results for "module:Graph::TransitiveClosure"
Graph::TransitiveClosure - create and query transitive closure of graph
You can use "Graph::TransitiveClosure" to compute the transitive closure graph of a graph and optionally also the minimum paths (lengths and vertices) between vertices, and after that query the transitiveness between vertices by using the "is_reachab...
ETJ/Graph-0.9727 - 25 Jun 2023 17:34:56 UTC
Graph::TransitiveClosure::Matrix - create and query transitive closure of graph
You can use "Graph::TransitiveClosure::Matrix" to compute the transitive closure matrix of a graph and optionally also the minimum paths (lengths and vertices) between vertices, and after that query the transitiveness between vertices by using the "i...
ETJ/Graph-0.9727 - 25 Jun 2023 17:34:56 UTC
Graph::AdjacencyMatrix - create and query the adjacency matrix of graph G
You can use "Graph::AdjacencyMatrix" to compute the adjacency matrix and optionally also the distance matrix of a graph, and after that query the adjacencyness between vertices by using the "is_adjacent()" method, or query the distance between vertic...
ETJ/Graph-0.9727 - 25 Jun 2023 17:34:56 UTC