debian man page for graph::adjacencymap

Query: graph::adjacencymap

OS: debian

Section: 3pm

Format: Original Unix Latex Style Formatted with HTML and a Horizontal Scroll Bar

Graph::AdjacencyMap(3pm)				User Contributed Perl Documentation				  Graph::AdjacencyMap(3pm)

NAME
Graph::AdjacencyMap - create and a map of graph vertices or edges
SYNOPSIS
Internal.
DESCRIPTION
This module is meant for internal use by the Graph module. Object Methods del_path(@id) Delete a Map path by ids. del_path_by_multi_id($id) Delete a Map path by a multi(vertex) id. get_multi_ids Return the multi ids. has_path(@id) Return true if the Map has the path by ids, false if not. has_paths Return true if the Map has any paths, false if not. has_path_by_multi_id($id) Return true if the Map has the path by a multi(vertex) id, false if not. paths Return all the paths of the Map. set_path(@id) Set the path by @ids. set_path_by_multi_id Set the path in the Map by the multi id.
AUTHOR AND COPYRIGHT
Jarkko Hietaniemi jhi@iki.fi
LICENSE
This module is licensed under the same terms as Perl itself. perl v5.10.0 2008-11-27 Graph::AdjacencyMap(3pm)
Related Man Pages
graph::bitmatrix(3pm) - debian
graph::reader::xml(3pm) - debian
graph::transitiveclosure(3pm) - debian
graph::writer::dot(3pm) - debian
graph::writer::davinci(3pm) - debian
Similar Topics in the Unix Linux Community
awk or sed - Convert 2 lines to 1 line
One instance of comparing grep and awk
Find columns in a file based on header and print to new file
Weird 'find' results
New UNIX and Linux History Sections