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
|
/* DefaultEmbedding.java
* =========================================================================
* This file is part of the GrInvIn project - http://www.grinvin.org
*
* Copyright (C) 2005-2008 Universiteit Gent
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or (at
* your option) any later version.
*
* This program is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* General Public License for more details.
*
* A copy of the GNU General Public License can be found in the file
* LICENSE.txt provided with the source distribution of this program (see
* the META-INF directory in the source jar). This license can also be
* found on the GNU website at http://www.gnu.org/licenses/gpl.html.
*
* If you did not receive a copy of the GNU General Public License along
* with this program, contact the lead developer, or write to the Free
* Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
* 02110-1301, USA.
*/
package org.grinvin.graphs;
import java.util.HashMap;
import java.util.Map;
/**
* Default implementation of {@link Embedding}. Stores
* coordinates in a hash table.
*/
public class DefaultEmbedding implements Embedding {
/**
* Dimension of this embedding.
*/
protected int dimension;
//
private GraphView peer;
//
private Map<Vertex, double[]> map;
/**
* Create an embedding of the given dimension for the given peer graph.
*/
public DefaultEmbedding(GraphView peer, int dimension) {
this.peer = peer;
this.dimension = dimension;
this.map = new HashMap<Vertex, double[]>();
}
/**
* Create a copy of a given embedding which shares the same peer.
*/
public DefaultEmbedding(EmbeddingView original) {
this.peer = original.getPeer();
this.dimension = original.getDimension();
this.map = new HashMap<Vertex, double[]>();
for (Vertex v : peer.vertices()) {
map.put(v, original.getCoordinates(v));
}
}
// implements EmbeddingView
public double[] getCoordinates(Vertex v) {
if (!peer.contains(v)) {
throw new IllegalArgumentException("Vertex does not belong to the graph");
}
double[] result = map.get(v);
if (result == null) {
// lazily create all zero coordinates
result = new double[dimension];
map.put(v, result);
}
return result.clone();
}
// implements Embedding
public void setCoordinates(Vertex vertex, double[] coordinates) {
if (!peer.contains(vertex)) {
throw new IllegalArgumentException("Vertex does not belong to the graph");
} else if (coordinates == null || coordinates.length != dimension) {
throw new IllegalArgumentException("Invalid coordinates");
}
map.put(vertex, coordinates.clone());
}
// implements Embedding
public void setDimension(int dimension) {
if (dimension != this.dimension) {
map.clear();
this.dimension = dimension;
}
}
// implements EmbeddingView
public GraphView getPeer() {
return this.peer;
}
// implements EmbeddingView
public int getDimension() {
return this.dimension;
}
// implements Embedding
public void copy(EmbeddingView original) {
if (this == original) {
return;
}
this.peer = original.getPeer();
this.dimension = original.getDimension();
map.clear();
for (Vertex v : peer.vertices()) {
map.put(v, original.getCoordinates(v));
}
}
// implements Embedding
public void copy(EmbeddingView original, GraphView newPeer) {
if (this == original) {
throw new IllegalArgumentException("Cannot make copy of self with different peer");
}
GraphView originalPeer = original.getPeer();
if (newPeer == originalPeer) {
copy(original);
} else {
this.peer = newPeer;
this.dimension = original.getDimension();
this.map.clear();
for (Vertex v : originalPeer.vertices()) {
map.put(newPeer.getVertex(v.getIndex()), original.getCoordinates(v));
}
}
}
}
|
