Package | Description |
---|---|
org.openstreetmap.josm.data.osm |
Provides the classes for OSM data:
Primitives :
Node ,
Way ,
Relation
Users
Tags
Changesets
Utilities classes
|
Modifier and Type | Field and Description |
---|---|
private java.util.Set<NodePair> |
NodeGraph.edges |
private java.util.Map<Node,java.util.List<NodePair>> |
NodeGraph.predecessors |
private java.util.Map<Node,java.util.List<NodePair>> |
NodeGraph.successors |
Modifier and Type | Method and Description |
---|---|
NodePair |
NodePair.swap()
Returns the inversed pair.
|
Modifier and Type | Method and Description |
---|---|
static java.util.List<NodePair> |
NodeGraph.buildNodePairs(java.util.List<Way> ways,
boolean directed)
Builds a list of pair of nodes from the given ways.
|
static java.util.List<NodePair> |
NodeGraph.buildNodePairs(Way way,
boolean directed)
Builds a list of pair of nodes from the given way.
|
static java.util.List<NodePair> |
NodeGraph.eliminateDuplicateNodePairs(java.util.List<NodePair> pairs)
Builds a new list of pair nodes without the duplicated pairs (including inversed copies).
|
private java.util.List<NodePair> |
NodeGraph.getConnectedPairs(Node node) |
protected java.util.List<NodePair> |
NodeGraph.getOutboundPairs(Node node) |
protected java.util.List<NodePair> |
NodeGraph.getOutboundPairs(NodePair pair) |
Modifier and Type | Method and Description |
---|---|
void |
NodeGraph.add(NodePair pair)
Add a node pair.
|
protected java.util.List<NodePair> |
NodeGraph.getOutboundPairs(NodePair pair) |
boolean |
NodePair.isPredecessorOf(NodePair other)
Determines if this pair is predecessor of another one (this.b == other.a)
|
boolean |
NodePair.isSuccessorOf(NodePair other)
Determines if this pair is successor of another one (other.b == this.a)
|
protected void |
NodeGraph.rememberPredecessors(NodePair pair) |
protected void |
NodeGraph.rememberSuccessor(NodePair pair) |
Modifier and Type | Method and Description |
---|---|
void |
NodeGraph.add(java.util.Collection<NodePair> pairs)
Add a list of node pairs.
|
protected java.util.List<Node> |
NodeGraph.buildPathFromNodePairs(java.util.Deque<NodePair> path) |
static NodeGraph |
NodeGraph.createDirectedGraphFromNodePairs(java.util.List<NodePair> pairs) |
static NodeGraph |
NodeGraph.createUndirectedGraphFromNodeList(java.util.List<NodePair> pairs)
Create an undirected graph from the given node pairs.
|
static java.util.List<NodePair> |
NodeGraph.eliminateDuplicateNodePairs(java.util.List<NodePair> pairs)
Builds a new list of pair nodes without the duplicated pairs (including inversed copies).
|
protected boolean |
NodeGraph.isSpanningWay(java.util.Collection<NodePair> way) |