DOKK / manpages / debian 11 / libgraph-perl / Graph::AdjacencyMap.3pm.en
Graph::AdjacencyMap(3pm) User Contributed Perl Documentation Graph::AdjacencyMap(3pm)

Graph::AdjacencyMap - map of graph vertices or edges

    Internal.

This module is meant for internal use by the Graph module.

Delete a Map path.

Delete a Map path by a multi(vertex) id.

Return the multi ids.

Return true if the Map has the path, false if not.

Return true if the Map has any paths, false if not.

Return true if the Map has the path by a multi(vertex) id, false if not.

Return all the paths of the Map.

Set the path by @ids.

Set the path in the Map by the multi id.

Given an array-ref of array-refs of vertex IDs, returns a list of array-refs of paths.

    @non_existing = $m->paths_non_existing([ \@seq1, \@seq2... ]);

Given an array-ref of array-refs with paths, returns a list of non-existing paths.

    @ids = $m->get_ids_by_paths([ \@seq1, \@seq2... ]);

Given an array-ref of array-refs with paths, returns a list of IDs of existing paths (non-existing ones will not be represented).

Rename the path.

Return a string describing the object in a human-friendly(ish) way.

Jarkko Hietaniemi jhi@iki.fi

This module is licensed under the same terms as Perl itself.

2021-04-23 perl v5.32.1