1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
|
%% -*- erlang-indent-level: 2 -*-
%%
%% %CopyrightBegin%
%%
%% Copyright Ericsson AB 2001-2016. All Rights Reserved.
%%
%% Licensed under the Apache License, Version 2.0 (the "License");
%% you may not use this file except in compliance with the License.
%% You may obtain a copy of the License at
%%
%% http://www.apache.org/licenses/LICENSE-2.0
%%
%% Unless required by applicable law or agreed to in writing, software
%% distributed under the License is distributed on an "AS IS" BASIS,
%% WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
%% See the License for the specific language governing permissions and
%% limitations under the License.
%%
%% %CopyrightEnd%
%%
%%----------------------------------------------------------------------
%% File : hipe_adj_list.erl
%% Author : Andreas Wallin <[email protected]>
%% Purpose : Keeps track of adjacency lists for the inference graph.
%% Created : 18 Mar 2000 by Andreas Wallin <[email protected]>
%%----------------------------------------------------------------------
-module(hipe_adj_list).
-author("Andreas Wallin").
-export([new/1,
add_edge/3,
%% add_edges/3,
remove_edge/3,
%% remove_edges/3,
edges/2]).
%%----------------------------------------------------------------------
%% Function: new
%%
%% Description: Creates an empty structure for adjacency lists
%%
%% Parameters:
%% Max_nodes -- Limit for node numbers
%%
%% Returns:
%% Empty adj_list structure
%%
%%----------------------------------------------------------------------
new(Max_nodes) ->
hipe_vectors:new(Max_nodes, []).
%%----------------------------------------------------------------------
%% Function: add_edges
%%
%% Description: Adds edges from a node to other nodes
%%
%% Parameters:
%% U -- A node
%% Vs -- Nodes to add edges to
%% Adj_list -- Old adjacency lists
%%
%% Returns:
%% An updated adj_list data-structure
%%
%%----------------------------------------------------------------------
%%add_edges(_, [], Adj_list) -> Adj_list;
%%add_edges(U, Vs, Adj_list) when is_list(Vs), is_integer(U) ->
%% hipe_vectors:set(Adj_list, U, ordsets:union(Vs, hipe_vectors:get(Adj_list, U))).
%%----------------------------------------------------------------------
%% Function: add_edge
%%
%% Description: Creates an edge between two nodes
%%
%% Parameters:
%% U -- A node
%% V -- Another node
%% Adj_list -- Old adjacency lists
%%
%% Returns:
%% New adj_list data-structure with (U and V connected)
%%
%%----------------------------------------------------------------------
add_edge(U, V, Adj_list) -> % PRE: U =/= V, not V \in adjList[U]
hipe_vectors:set(Adj_list, U,
[V | hipe_vectors:get(Adj_list, U)]).
%%----------------------------------------------------------------------
%% Function: remove_edges
%%
%% Description: Removes edges from a node to other nodes
%%
%% Parameters:
%% U -- A node
%% Vs -- Nodes to remove edges to
%% Adj_list -- Old adjacency lists
%%
%% Returns:
%% An updated adj_list data-structure
%%
%%----------------------------------------------------------------------
%% remove_edges(_, [], Adj_list) -> Adj_list;
remove_edges(U, Vs, Adj_list) when is_list(Vs), is_integer(U) ->
hipe_vectors:set(Adj_list, U, hipe_vectors:get(Adj_list, U) -- Vs).
%%----------------------------------------------------------------------
%% Function: remove_edge
%%
%% Description: Removes an edge between two nodes
%%
%% Parameters:
%% U -- A node
%% V -- Another node
%% Adj_list -- Old adjacency lists
%%
%% Returns:
%% New adjacency lists with (U and V not connected)
%%
%%----------------------------------------------------------------------
remove_edge(U, U, Adj_list) -> Adj_list;
remove_edge(U, V, Adj_list) when is_integer(U), is_integer(V) ->
remove_edges(U, [V], Adj_list).
%%----------------------------------------------------------------------
%% Function: edges
%%
%% Description: Tells where the edges of a node go
%%
%% Parameters:
%% U -- A node
%% Adj_list -- Adjacency lists
%%
%% Returns:
%% The set of nodes connected to U
%%
%%----------------------------------------------------------------------
edges(U, Adj_list) ->
hipe_vectors:get(Adj_list, U).
|
