Scroll to navigation

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

NAME

Graph::AdjacencyMap - map of graph vertices or edges

SYNOPSIS

    Internal.

DESCRIPTION

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

OBJECT METHODS

del_path(\@seq)

Delete a Map path.

del_path_by_multi_id(\@seq, $id)

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

get_multi_ids(\@seq)

Return the multi ids.

has_path(\@seq)

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

has_paths

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

has_path_by_multi_id(\@seq, $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(\@seq)

Set the path by @ids.

set_path_by_multi_id(\@seq, $id)

Set the path in the Map by the multi id.

get_paths_by_ids([ \@idlist1, \@idlist2... ])

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

paths_non_existing

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

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

get_ids_by_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_path($from, $to)

Rename the path.

stringify

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

AUTHOR AND COPYRIGHT

Jarkko Hietaniemi jhi@iki.fi

LICENSE

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

2021-04-23 perl v5.32.1