Ticket #7409: RoutingGraph.java.patch
| File RoutingGraph.java.patch, 1.8 KB (added by , 14 years ago) |
|---|
-
src/com/innovant/josm/jrt/core/RoutingGraph.java
184 184 */ 185 185 186 186 String oneway_val = way.get("oneway"); /* get (oneway=?) tag for this way. */ 187 String junction_val = way.get("junction"); /* get (junction=?) tag for this way. */ 187 188 188 189 from = nodes.get(0); /* 1st node A */ 189 190 graph.addVertex(from); /* add vertex A */ … … 197 198 198 199 199 200 //this is where we link the vertices 200 if (oneway_val == null || oneway_val == "false" || oneway_val == "no" || oneway_val == "0") { 201 //Case 1 (bi-way): oneway=false OR oneway=unset OR oneway=0 OR oneway=no 201 if (oneway_val == null && junction_val == "roundabout") { 202 //Case (roundabout): oneway=implicit yes 203 addEdgeNormalOneway(way, from, to); 204 205 } else if (oneway_val == null || oneway_val == "false" || oneway_val == "no" || oneway_val == "0") { 206 //Case (bi-way): oneway=false OR oneway=unset OR oneway=0 OR oneway=no 202 207 addEdgeBidirectional(way, from, to); 203 208 204 209 } else if (oneway_val == "-1") { 205 //Case 2(oneway reverse): oneway=-1210 //Case (oneway reverse): oneway=-1 206 211 addEdgeReverseOneway(way, from, to); 207 212 208 213 } else if (oneway_val == "1" || oneway_val == "yes" || oneway_val == "true") { 209 //Case 3(oneway normal): oneway=yes OR 1 OR true214 //Case (oneway normal): oneway=yes OR 1 OR true 210 215 addEdgeNormalOneway(way, from, to); 211 216 212 217 }
