1Graph::AdjacencyMap(3)User Contributed Perl DocumentationGraph::AdjacencyMap(3)
2
3
4

NAME

6       Graph::AdjacencyMap - map of graph vertices or edges
7

SYNOPSIS

9           Internal.
10

DESCRIPTION

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

OBJECT METHODS

15   del_path(\@seq)
16       Delete a Map path.
17
18   del_path_by_multi_id(\@seq, $id)
19       Delete a Map path by a multi(vertex) id.
20
21   get_multi_ids(\@seq)
22       Return the multi ids.
23
24   has_path(\@seq)
25       Return true if the Map has the path, false if not.
26
27   has_paths
28       Return true if the Map has any paths, false if not.
29
30   has_path_by_multi_id(\@seq, $id)
31       Return true if the Map has the path by a multi(vertex) id, false if
32       not.
33
34   paths
35       Return all the paths of the Map.
36
37   set_path(\@seq)
38       Set the path by @ids.
39
40   set_path_by_multi_id(\@seq, $id)
41       Set the path in the Map by the multi id.
42
43   get_paths_by_ids([ \@idlist1, \@idlist2... ])
44       Given an array-ref of array-refs of vertex IDs, returns a list of
45       array-refs of paths.
46
47   paths_non_existing
48           @non_existing = $m->paths_non_existing([ \@seq1, \@seq2... ]);
49
50       Given an array-ref of array-refs with paths, returns a list of non-
51       existing paths.
52
53   get_ids_by_paths
54           @ids = $m->get_ids_by_paths([ \@seq1, \@seq2... ]);
55
56       Given an array-ref of array-refs with paths, returns a list of IDs of
57       existing paths (non-existing ones will not be represented).
58
59   rename_path($from, $to)
60       Rename the path.
61
62   stringify
63       Return a string describing the object in a human-friendly(ish) way.
64

66       Jarkko Hietaniemi jhi@iki.fi
67

LICENSE

69       This module is licensed under the same terms as Perl itself.
70
71
72
73perl v5.32.1                      2021-01-27            Graph::AdjacencyMap(3)
Impressum