forked from graphhopper/graphhopper
/
GraphWrapper.java
100 lines (82 loc) · 2.5 KB
/
GraphWrapper.java
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
/*
* Copyright 2012 Peter Karich info@jetsli.de
*
* 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.
*/
package de.jetsli.graph.storage;
import de.jetsli.graph.coll.MyBitSet;
import de.jetsli.graph.util.MyIteratorable;
/**
*
* @author Peter Karich, info@jetsli.de
*/
public class GraphWrapper implements Graph {
private MyBitSet ignoreNodes;
private int ignoreNodesSize;
private Graph g;
public GraphWrapper(Graph g) {
this.g = g;
}
public void setIgnoreNodes(MyBitSet bitSet) {
ignoreNodes = bitSet;
ignoreNodesSize = (int) bitSet.getCardinality();
}
@Override
public int getLocations() {
int tmp = g.getLocations() - ignoreNodesSize;
assert tmp >= 0;
return tmp;
}
@Override
public MyIteratorable<DistEntry> getEdges(int index) {
if(ignoreNodes.contains(index))
return DistEntry.EMPTY_ITER;
return g.getEdges(index);
}
@Override
public MyIteratorable<DistEntry> getOutgoing(int index) {
if(ignoreNodes.contains(index))
return DistEntry.EMPTY_ITER;
return g.getOutgoing(index);
}
@Override
public MyIteratorable<DistEntry> getIncoming(int index) {
if(ignoreNodes.contains(index))
return DistEntry.EMPTY_ITER;
return g.getIncoming(index);
}
@Override
public int addLocation(double lat, double lon) {
return g.addLocation(lat, lon);
}
@Override
public double getLatitude(int index) {
return g.getLatitude(index);
}
@Override
public double getLongitude(int index) {
return g.getLongitude(index);
}
@Override
public void edge(int a, int b, double distance, boolean bothDirections) {
g.edge(a, b, distance, bothDirections);
}
@Override
public Graph clone() {
return g.clone();
}
@Override
public void ensureCapacity(int cap) {
g.ensureCapacity(cap);
}
}