Man Page: graph::adjacencymap
Operating Environment: debian
Section: 3pm
Graph::AdjacencyMap(3pm) User Contributed Perl Documentation Graph::AdjacencyMap(3pm)NAMEGraph::AdjacencyMap - create and a map of graph vertices or edgesSYNOPSISInternal.DESCRIPTIONThis 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 COPYRIGHTJarkko Hietaniemi jhi@iki.fiLICENSEThis module is licensed under the same terms as Perl itself. perl v5.10.0 2008-11-27 Graph::AdjacencyMap(3pm)
| Related Man Pages |
|---|
| graph::adjacencymatrix(3pm) - debian |
| graph::reader::xml(3pm) - debian |
| graph::traversal(3pm) - debian |
| graph::unionfind(3pm) - debian |
| graph::writer::xml(3pm) - debian |
| Similar Topics in the Unix Linux Community |
|---|
| How can I do this in VI editor? |
| Is UNIX an open source OS ? |
| Find columns in a file based on header and print to new file |
| Weird 'find' results |