Search results for "dist:Graph"
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...
ETJ/Graph-0.9727 - 25 Jun 2023 17:34:56 UTC
Graph::Matrix - create and manipulate a V x V matrix of graph G
This module is meant for internal use by the Graph module. Class Methods new($g) Construct a new Matrix from the Graph $g. Object Methods get($u, $v) Return the value at the edge from $u to $v. set($u, $v, $val) Set the edge from $u to $v to value $v...
ETJ/Graph-0.9727 - 25 Jun 2023 17:34:56 UTC
Graph::Directed - directed graphs
Graph::Directed allows you to create directed graphs. For the available methods, see Graph....
ETJ/Graph-0.9727 - 25 Jun 2023 17:34:56 UTC
Graph::UnionFind - union-find data structures
*Union-find* is a special data structure that can be used to track the partitioning of a set into subsets (a problem also known as *disjoint sets*). "Graph::UnionFind" is used for "connected_components" in Graph, "connected_component" in Graph, and "...
ETJ/Graph-0.9727 - 25 Jun 2023 17:34:56 UTC
Graph::BitMatrix - create and manipulate a V x V bit matrix of graph G
This class enables creating bit matrices that compactly describe the connected of the graphs. Class Methods new($g) Create a bit matrix from a Graph $g. The %opt, if present, can have the following options: * connect_edges If true or if not present, ...
ETJ/Graph-0.9727 - 25 Jun 2023 17:34:56 UTC
Graph::Traversal - traverse graphs
You can control how the graph is traversed by the various callback parameters in the %opt. In the parameters descriptions below the $u and $v are vertices, and the $self is the traversal object itself. Callback parameters The following callback param...
ETJ/Graph-0.9727 - 25 Jun 2023 17:34:56 UTC
Graph::Undirected - undirected graphs
Graph::Undirected allows you to create undirected graphs. For the available methods, see Graph....
ETJ/Graph-0.9727 - 25 Jun 2023 17:34:56 UTC
Graph::AdjacencyMap - map of graph vertices or edges
This module is meant for internal use by the Graph module....
ETJ/Graph-0.9727 - 25 Jun 2023 17:34:56 UTC
Graph::Traversal::DFS - depth-first traversal of graphs
With this class one can traverse a Graph in depth-first order. The callback parameters %opt are explained in Graph::Traversal. Methods The following methods are available: dfs Traverse the graph in depth-first order. Returns all vertices traversed in...
ETJ/Graph-0.9727 - 25 Jun 2023 17:34:56 UTC
Graph::Traversal::BFS - breadth-first traversal of graphs
With this class one can traverse a Graph in breadth-first order. The callback parameters %opt are explained in Graph::Traversal. Methods The following methods are available: bfs Traverse the graph in breadth-first order. Returns all vertices traverse...
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
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