Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance. Project price only 1 $
You can buy this project and download/modify it how often you want.
package org.opentripplanner.graph_builder.module;
import org.locationtech.jts.geom.Geometry;
import org.locationtech.jts.geom.Polygon;
import org.opentripplanner.common.geometry.Subgraph;
import org.opentripplanner.graph_builder.DataImportIssueStore;
import org.opentripplanner.graph_builder.services.GraphBuilderModule;
import org.opentripplanner.graph_builder.issues.GraphConnectivity;
import org.opentripplanner.graph_builder.issues.GraphIsland;
import org.opentripplanner.graph_builder.issues.IsolatedStop;
import org.opentripplanner.graph_builder.issues.PrunedIslandStop;
import org.opentripplanner.routing.api.request.RoutingRequest;
import org.opentripplanner.routing.core.State;
import org.opentripplanner.routing.core.TraverseMode;
import org.opentripplanner.routing.core.TraverseModeSet;
import org.opentripplanner.routing.edgetype.ElevatorEdge;
import org.opentripplanner.routing.edgetype.FreeEdge;
import org.opentripplanner.routing.edgetype.StreetEdge;
import org.opentripplanner.routing.edgetype.StreetTransitStopLink;
import org.opentripplanner.routing.edgetype.StreetTraversalPermission;
import org.opentripplanner.routing.edgetype.StreetTransitEntranceLink;
import org.opentripplanner.routing.edgetype.StreetTransitEntityLink;
import org.opentripplanner.routing.graph.Edge;
import org.opentripplanner.routing.graph.Graph;
import org.opentripplanner.routing.graph.Vertex;
import org.opentripplanner.routing.vertextype.StreetVertex;
import org.opentripplanner.routing.vertextype.TransitStopVertex;
import org.slf4j.Logger;
import org.slf4j.LoggerFactory;
import java.io.File;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Collection;
import java.util.HashMap;
import java.util.List;
import java.util.Iterator;
import java.util.LinkedList;
import java.util.Map;
import java.util.Queue;
/**
* this module is part of the {@link org.opentripplanner.graph_builder.services.GraphBuilderModule}
* process. It extends the functionality of PruneFloatingIslands by considering also through traffic
* limitations. It is quite common that no thru edges break connectivity of the graph, creating islands.
* The quality of the graph can be improved by converting such islands to nothru state so that routing
* can start / end from such an island.
*/
public class PruneNoThruIslands implements GraphBuilderModule {
private static final Logger LOG = LoggerFactory.getLogger(PruneNoThruIslands.class);
private static int islandCounter = 0;
/**
* this field indicate the maximum size for island without stops
* island under this size will be pruned.
*/
private int pruningThresholdIslandWithoutStops;
/**
* this field indicate the maximum size for island with stops
* island under this size will be pruned.
*/
private int pruningThresholdIslandWithStops;
private final StreetLinkerModule streetLinkerModule;
public PruneNoThruIslands(StreetLinkerModule streetLinkerModule) {
this.streetLinkerModule = streetLinkerModule;
}
public List provides() {
return Collections.emptyList();
}
public List getPrerequisites() {
/**this module can run after the street module only but if
* the street linker did not run then it couldn't identifies island with stops.
* so if the need is to distinguish between island with stops or without stops
* as explained before this module should run after the streets and the linker modules.
*/
return Arrays.asList("streets");
}
@Override
public void buildGraph(
Graph graph,
HashMap, Object> extra,
DataImportIssueStore issueStore
) {
LOG.info("Pruning islands and areas isolated by nothru edges in street network");
pruneNoThruIslands(graph, pruningThresholdIslandWithoutStops,
pruningThresholdIslandWithStops,
issueStore, TraverseMode.BICYCLE
);
pruneNoThruIslands(graph, pruningThresholdIslandWithoutStops,
pruningThresholdIslandWithStops,
issueStore, TraverseMode.WALK
);
pruneNoThruIslands(graph, pruningThresholdIslandWithoutStops,
pruningThresholdIslandWithStops,
issueStore, TraverseMode.CAR
);
// reconnect stops that got disconnected
if (streetLinkerModule != null) {
LOG.info("Reconnecting stops");
streetLinkerModule.linkTransitStops(graph);
int isolated = 0;
for (TransitStopVertex tStop : graph.getVerticesOfType(TransitStopVertex.class)) {
if (tStop.getDegreeOut() + tStop.getDegreeIn() == 0) {
issueStore.add(new IsolatedStop(tStop));
isolated++;
}
}
LOG.info("{} stops remain isolated", isolated);
}
// clean up pruned street vertices
int removed = 0;
List toRemove = new LinkedList<>();
for (Vertex v : graph.getVerticesOfType(StreetVertex.class)) {
if (v.getDegreeOut() + v.getDegreeIn() == 0)
toRemove.add(v);
}
for (Vertex v : toRemove) {
graph.remove(v);
removed += 1;
}
LOG.info("Removed {} edgeless street vertices", removed);
}
@Override
public void checkInputs() {
//no inputs
}
public void setPruningThresholdIslandWithoutStops(int pruningThresholdIslandWithoutStops) {
this.pruningThresholdIslandWithoutStops = pruningThresholdIslandWithoutStops;
}
public void setPruningThresholdIslandWithStops(int pruningThresholdIslandWithStops) {
this.pruningThresholdIslandWithStops = pruningThresholdIslandWithStops;
}
/* Island pruning strategy:
1. Extract islands without using noThruTraffic edges at all
2. Then create expanded islands by accepting noThruTraffic edges, but do not jump across original islands!
Note: these expanded islands can overlap.
3 Relax connectivity even more: generate islands by allowing jumps between islands. Find out unreachable edges of small islands.
4. Analyze small expanded islands (from step 2). Convert edges which are reachable only via noThruTraffic edges
to noThruTraffic state. Remove traversal mode specific access from unreachable edges. Removed unconnected edges.
*/
private static void pruneNoThruIslands(
Graph graph, int maxIslandSize,
int islandWithStopMaxSize, DataImportIssueStore issueStore,
TraverseMode traverseMode
) {
LOG.debug("nothru pruning");
Map subgraphs = new HashMap();
Map extgraphs = new HashMap();
Map> neighborsForVertex =
new HashMap>();
Map isolated = new HashMap();
ArrayList islands = new ArrayList();
int count;
/* establish vertex neighbourhood without currently relevant noThruTrafficEdges */
collectNeighbourVertices(graph, neighborsForVertex, traverseMode, false);
/* associate each connected vertex with a subgraph */
count = collectSubGraphs(graph, neighborsForVertex, subgraphs, null, null);
LOG.info("Islands without {} noThruTraffic edges: {}", traverseMode, count);
/* Expand vertex neighbourhood with relevant noThruTrafficEdges
Note that we can reuse the original neighbour map here
and simply process a smaller set of noThruTrafficEdges */
collectNeighbourVertices(graph, neighborsForVertex, traverseMode, true);
/* Next: generate subgraphs without considering access limitations */
count = collectSubGraphs(graph, neighborsForVertex, extgraphs, null, islands);
LOG.info("Islands with {} noThruTraffic edges: {}", traverseMode, count);
/* collect unreachable edges to a map */
processIslands(graph, islands, isolated, true,
maxIslandSize, islandWithStopMaxSize, issueStore, traverseMode
);
extgraphs = new HashMap(); // let old map go
islands = new ArrayList(); // reset this too
/* Recompute expanded subgraphs by accepting noThruTraffic edges in graph expansion.
However, expansion is not allowed to jump from an original island to another one
*/
collectSubGraphs(graph, neighborsForVertex, extgraphs, subgraphs, islands);
/* Next round: generate purely noThruTraffic islands if such ones exist */
count = collectSubGraphs(graph, neighborsForVertex, extgraphs, null, islands);
LOG.info("{} noThruTraffic island count: {}", traverseMode, count);
LOG.info("Total {} sub graphs found", islands.size());
/* remove all tiny subgraphs and large subgraphs without stops */
count = processIslands(graph, islands, isolated, false,
maxIslandSize, islandWithStopMaxSize, issueStore, traverseMode
);
LOG.info("Modified {} islands", count);
}
private static int processIslands(
Graph graph,
ArrayList islands,
Map isolated,
boolean markIsolated,
int maxIslandSize,
int islandWithStopMaxSize,
DataImportIssueStore issueStore,
TraverseMode traverseMode
) {
Map stats = new HashMap();
stats.put("isolated", 0);
stats.put("removed", 0);
stats.put("noThru", 0);
stats.put("restricted", 0);
int count = 0;
int islandsWithStops = 0;
int islandsWithStopsChanged = 0;
for (Subgraph island : islands) {
boolean changed = false;
if (island.stopSize() > 0) {
//for islands with stops
islandsWithStops++;
if (island.streetSize() < islandWithStopMaxSize) {
restrictOrRemove(graph, island, isolated, stats, markIsolated, traverseMode, issueStore);
changed = true;
islandsWithStopsChanged++;
count++;
}
}
else {
//for islands without stops
if (island.streetSize() < maxIslandSize) {
restrictOrRemove(graph, island, isolated, stats, markIsolated, traverseMode, issueStore);
changed = true;
count++;
}
}
}
if (markIsolated) {
LOG.info("Detected {} isolated edges", stats.get("isolated"));
}
else {
LOG.info("Number of islands with stops: {}", islandsWithStops);
LOG.warn("Modified connectivity of {} islands with stops", islandsWithStopsChanged);
LOG.info("Removed {} edges", stats.get("removed"));
LOG.info("Removed traversal mode from {} edges", stats.get("restricted"));
LOG.info("Converted {} edges to noThruTraffic", stats.get("noThru"));
issueStore.add(new GraphConnectivity(
traverseMode, islands.size(), islandsWithStops, islandsWithStopsChanged,
stats.get("removed"), stats.get("restricted"), stats.get("noThru")
));
}
return count;
}
private static void collectNeighbourVertices(
Graph graph, Map> neighborsForVertex, TraverseMode traverseMode, boolean shouldMatchNoThruType
) {
RoutingRequest options = new RoutingRequest(new TraverseModeSet(traverseMode));
for (Vertex gv : graph.getVertices()) {
if (!(gv instanceof StreetVertex)) {
continue;
}
State s0 = new State(gv, options);
for (Edge e : gv.getOutgoing()) {
Vertex in = gv;
if (!(
e instanceof StreetEdge || e instanceof StreetTransitStopLink ||
e instanceof StreetTransitEntranceLink || e instanceof ElevatorEdge ||
e instanceof FreeEdge || e instanceof StreetTransitEntityLink
)
) {
continue;
}
if (e instanceof StreetEdge
&& shouldMatchNoThruType != ((StreetEdge) e).isNoThruTraffic(traverseMode)
) {
continue;
}
State s1 = e.traverse(s0);
if (s1 == null) {
continue;
}
Vertex out = s1.getVertex();
ArrayList vertexList = neighborsForVertex.get(in);
if (vertexList == null) {
vertexList = new ArrayList();
neighborsForVertex.put(in, vertexList);
}
vertexList.add(out);
vertexList = neighborsForVertex.get(out);
if (vertexList == null) {
vertexList = new ArrayList();
neighborsForVertex.put(out, vertexList);
}
vertexList.add(in);
}
}
}
private static int collectSubGraphs(
Graph graph,
Map> neighborsForVertex,
Map newgraphs, // put new subgraphs here
Map subgraphs, // optional isolation map from a previous round
ArrayList islands
) { // final list of islands or null
int count = 0;
for (Vertex gv : graph.getVertices()) {
if (!(gv instanceof StreetVertex)) {
continue;
}
Vertex vertex = gv;
if (subgraphs != null && !subgraphs.containsKey(vertex)) {
// do not start new graph generation from non-classified vertex
continue;
}
if (newgraphs.containsKey(vertex)) { // already processed
continue;
}
if (!neighborsForVertex.containsKey(vertex)) {
continue;
}
Subgraph subgraph = computeConnectedSubgraph(neighborsForVertex, vertex, subgraphs);
if (subgraph != null) {
for (Iterator vIter = subgraph.streetIterator(); vIter.hasNext(); ) {
Vertex subnode = vIter.next();
newgraphs.put(subnode, subgraph);
}
if (islands != null) {
islands.add(subgraph);
}
count++;
}
}
return count;
}
private static void restrictOrRemove(
Graph graph,
Subgraph island,
Map isolated,
Map stats,
boolean markIsolated,
TraverseMode traverseMode,
DataImportIssueStore issueStore
) {
//iterate over the street vertex of the subgraph
for (Iterator vIter = island.streetIterator(); vIter.hasNext(); ) {
Vertex v = vIter.next();
Collection outgoing = new ArrayList(v.getOutgoing());
for (Edge e : outgoing) {
if (e instanceof StreetEdge) {
if (markIsolated) {
isolated.put(e, true);
stats.put("isolated", stats.get("isolated") + 1);
}
else {
StreetEdge pse = (StreetEdge) e;
if (!isolated.containsKey(e)) {
// not a true island edge but has limited access
// so convert to noThruTraffic
if (traverseMode == TraverseMode.CAR) {
pse.setMotorVehicleNoThruTraffic(true);
} else if (traverseMode == TraverseMode.BICYCLE) {
pse.setBicycleNoThruTraffic(true);
} else if (traverseMode == TraverseMode.WALK) {
pse.setWalkNoThruTraffic(true);
}
stats.put("noThru", stats.get("noThru") + 1);
}
else {
StreetTraversalPermission permission = pse.getPermission();
if (traverseMode == TraverseMode.CAR) {
permission = permission.remove(StreetTraversalPermission.CAR);
} else if (traverseMode == TraverseMode.BICYCLE) {
permission = permission.remove(StreetTraversalPermission.BICYCLE);
} else if (traverseMode == TraverseMode.WALK) {
permission = permission.remove(StreetTraversalPermission.PEDESTRIAN);
}
if (permission == StreetTraversalPermission.NONE) {
// currently we must update spatial index manually, graph.removeEdge does not do that
graph.getLinker().removePermanentEdgeFromIndex(pse);
graph.removeEdge(pse);
stats.put("removed", stats.get("removed") + 1);
}
else {
pse.setPermission(permission);
stats.put("restricted", stats.get("restricted") + 1);
}
}
}
}
}
}
if (markIsolated) {
return;
}
for (Iterator vIter = island.streetIterator(); vIter.hasNext(); ) {
Vertex v = vIter.next();
if (v.getDegreeOut() + v.getDegreeIn() == 0) {
graph.remove(v);
}
}
//remove street connection form
if (traverseMode == TraverseMode.WALK) {
// note: do not unlink stop if only CAR mode is pruned
// maybe this needs more logic for flex routing cases
for (Iterator vIter = island.stopIterator(); vIter.hasNext(); ) {
Vertex v = vIter.next();
Collection edges = new ArrayList(v.getOutgoing());
edges.addAll(v.getIncoming());
for (Edge e : edges) {
if (e instanceof StreetTransitStopLink || e instanceof StreetTransitEntranceLink) {
graph.removeEdge(e);
}
}
issueStore.add(new PrunedIslandStop(v));
}
}
issueStore.add(new GraphIsland(island.getRepresentativeVertex(), island.streetSize()));
}
private static Subgraph computeConnectedSubgraph(
Map> neighborsForVertex,
Vertex startVertex,
Map anchors
) {
Subgraph subgraph = new Subgraph();
Queue q = new LinkedList();
Subgraph anchor = null;
if (anchors != null) {
// anchor subgraph expansion to this subgraph
anchor = anchors.get(startVertex);
}
q.add(startVertex);
while (!q.isEmpty()) {
Vertex vertex = q.poll();
for (Vertex neighbor : neighborsForVertex.get(vertex)) {
if (!subgraph.contains(neighbor)) {
if (anchor != null) {
Subgraph compare = anchors.get(neighbor);
if (compare != null && compare != anchor) { // do not enter a new island
continue;
}
}
subgraph.addVertex(neighbor);
q.add(neighbor);
}
}
}
return subgraph;
}
}
