62 if (!oc.
isSet(
"output-file")) {
66 std::map<SumoXMLAttr, std::string> attrs;
71 const int cornerDetail = oc.
getInt(
"junctions.corner-detail");
72 if (cornerDetail > 0) {
75 if (!oc.
isDefault(
"junctions.internal-link-detail")) {
78 if (oc.
getBool(
"rectangular-lane-cut")) {
98 if (!oc.
getBool(
"no-internal-links")) {
100 for (std::map<std::string, NBNode*>::const_iterator i = nc.
begin(); i != nc.
end(); ++i) {
109 bool noNames = !oc.
getBool(
"output.street-names");
110 for (std::map<std::string, NBEdge*>::const_iterator i = ec.
begin(); i != ec.
end(); ++i) {
111 writeEdge(device, *(*i).second, noNames);
119 std::set<NBNode*> roundaboutNodes;
120 const bool checkLaneFoesAll = oc.
getBool(
"check-lane-foes.all");
121 const bool checkLaneFoesRoundabout = !checkLaneFoesAll && oc.
getBool(
"check-lane-foes.roundabout");
122 if (checkLaneFoesRoundabout) {
124 for (std::set<EdgeSet>::const_iterator i = roundabouts.begin(); i != roundabouts.end(); ++i) {
125 for (EdgeSet::const_iterator j = (*i).begin(); j != (*i).end(); ++j) {
126 roundaboutNodes.insert((*j)->getToNode());
130 for (std::map<std::string, NBNode*>::const_iterator i = nc.
begin(); i != nc.
end(); ++i) {
131 const bool checkLaneFoes = checkLaneFoesAll || (checkLaneFoesRoundabout && roundaboutNodes.count((*i).second) > 0);
135 const bool includeInternal = !oc.
getBool(
"no-internal-links");
136 if (includeInternal) {
139 for (std::map<std::string, NBNode*>::const_iterator i = nc.
begin(); i != nc.
end(); ++i) {
148 int numConnections = 0;
149 for (std::map<std::string, NBEdge*>::const_iterator it_edge = ec.
begin(); it_edge != ec.
end(); it_edge++) {
150 NBEdge* from = it_edge->second;
151 const std::vector<NBEdge::Connection> connections = from->
getConnections();
152 numConnections += (int)connections.size();
153 for (std::vector<NBEdge::Connection>::const_iterator it_c = connections.begin(); it_c != connections.end(); it_c++) {
157 if (numConnections > 0) {
160 if (includeInternal) {
163 for (std::map<std::string, NBNode*>::const_iterator i = nc.
begin(); i != nc.
end(); ++i) {
170 for (std::map<std::string, NBNode*>::const_iterator i = nc.
begin(); i != nc.
end(); ++i) {
171 NBNode* node = (*i).second;
173 std::vector<NBNode::Crossing*> crossings = node->
getCrossings();
174 for (
auto c : crossings) {
178 const std::vector<NBNode::WalkingArea>& WalkingAreas = node->
getWalkingAreas();
179 for (std::vector<NBNode::WalkingArea>::const_iterator it = WalkingAreas.begin(); it != WalkingAreas.end(); it++) {
180 for (std::string cID : (*it).nextCrossings) {
188 if (nextCrossing.
tlID !=
"") {
200 for (std::vector<std::string>::const_iterator it_sw = (*it).nextSidewalks.begin(); it_sw != (*it).nextSidewalks.end(); ++it_sw) {
204 for (std::vector<std::string>::const_iterator it_sw = (*it).prevSidewalks.begin(); it_sw != (*it).prevSidewalks.end(); ++it_sw) {
212 for (std::map<std::string, NBNode*>::const_iterator i = nc.
begin(); i != nc.
end(); ++i) {
220 for (std::map<std::string, NBDistrict*>::const_iterator i = dc.
begin(); i != dc.
end(); i++) {
223 if (dc.
size() != 0) {
238 assert(succOpp != 0);
239 assert(predOpp != 0);
240 const std::vector<NBEdge::Connection>& connections = succOpp->
getConnections();
241 for (std::vector<NBEdge::Connection>::const_iterator it_c = connections.begin(); it_c != connections.end(); it_c++) {
243 if (succOpp != from &&
245 predOpp == conOpp.
toEdge &&
263 for (EdgeVector::const_iterator i = incoming.begin(); i != incoming.end(); i++) {
264 const std::vector<NBEdge::Connection>& elv = (*i)->getConnections();
265 if (elv.size() > 0) {
266 bool haveVia =
false;
267 std::string edgeID =
"";
269 std::map<std::string, double> lengthSum;
270 std::map<std::string, int> numLanes;
271 for (std::vector<NBEdge::Connection>::const_iterator k = elv.begin(); k != elv.end(); ++k) {
273 numLanes[(*k).id] += 1;
276 for (std::vector<NBEdge::Connection>::const_iterator k = elv.begin(); k != elv.end(); ++k) {
277 if ((*k).toEdge == 0) {
281 if (edgeID != (*k).id) {
294 const NBEdge::Lane& successor = (*k).toEdge->getLanes()[(*k).toLane];
295 const double length = lengthSum[edgeID] / numLanes[edgeID];
299 writeLane(into, (*k).getInternalLaneID(), (*k).vmax,
303 haveVia = haveVia || (*k).haveVia;
309 for (std::vector<NBEdge::Connection>::const_iterator k = elv.begin(); k != elv.end(); ++k) {
313 if ((*k).toEdge == 0) {
317 const NBEdge::Lane& successor = (*k).toEdge->getLanes()[(*k).toLane];
341 const std::vector<NBNode::WalkingArea>& WalkingAreas = n.
getWalkingAreas();
342 for (std::vector<NBNode::WalkingArea>::const_iterator it = WalkingAreas.begin(); it != WalkingAreas.end(); it++) {
382 const std::vector<NBEdge::Lane>& lanes = e.
getLanes();
385 for (
int i = 0; i < (int) lanes.size(); i++) {
402 const std::string& oppositeID,
bool accelRamp,
bool customShape) {
414 WRITE_WARNING(
"Lane '" + lID +
"' has a maximum allowed speed of 0.");
415 }
else if (speed < 0) {
416 throw ProcessError(
"Negative allowed speed (" +
toString(speed) +
") on lane '" + lID +
"', use --speed.minimum to prevent this.");
419 length = length - endOffset;
437 if (oppositeID !=
"" && oppositeID !=
"-") {
458 std::string incLanes;
460 for (std::vector<NBEdge*>::const_iterator i = incoming.begin(); i != incoming.end(); ++i) {
461 int noLanes = (*i)->getNumLanes();
462 for (
int j = 0; j < noLanes; j++) {
463 incLanes += (*i)->getLaneID(j);
464 if (i != incoming.end() - 1 || j < noLanes - 1) {
469 std::vector<NBNode::Crossing*> crossings = n.
getCrossings();
470 std::set<std::string> prevWAs;
472 for (
auto c : crossings) {
473 if (prevWAs.count(c->prevWalkingArea) == 0) {
474 incLanes +=
' ' + c->prevWalkingArea +
"_0";
475 prevWAs.insert(c->prevWalkingArea);
480 std::string intLanes;
483 for (EdgeVector::const_iterator i = incoming.begin(); i != incoming.end(); i++) {
484 const std::vector<NBEdge::Connection>& elv = (*i)->getConnections();
485 for (std::vector<NBEdge::Connection>::const_iterator k = elv.begin(); k != elv.end(); ++k) {
486 if ((*k).toEdge == 0) {
493 intLanes += (*k).getInternalLaneID();
495 intLanes += (*k).viaID +
"_0";
502 for (
auto c : crossings) {
503 intLanes +=
' ' + c->id +
"_0";
531 std::vector<std::string> internalLaneIDs;
532 for (EdgeVector::const_iterator i = incoming.begin(); i != incoming.end(); i++) {
533 const std::vector<NBEdge::Connection>& elv = (*i)->getConnections();
534 for (std::vector<NBEdge::Connection>::const_iterator k = elv.begin(); k != elv.end(); ++k) {
535 if ((*k).toEdge != 0) {
536 internalLaneIDs.push_back((*k).getInternalLaneID());
541 internalLaneIDs.push_back(c->id +
"_0");
544 for (std::vector<NBEdge*>::const_iterator i = incoming.begin(); i != incoming.end(); i++) {
545 const std::vector<NBEdge::Connection>& elv = (*i)->getConnections();
546 for (std::vector<NBEdge::Connection>::const_iterator k = elv.begin(); k != elv.end(); ++k) {
547 if ((*k).toEdge == 0 || !(*k).haveVia) {
554 std::string incLanes = (*k).getInternalLaneID();
555 if ((*k).foeIncomingLanes.length() != 0) {
556 incLanes +=
" " + (*k).foeIncomingLanes;
559 const std::vector<int>& foes = (*k).foeInternalLinks;
560 std::vector<std::string> foeIDs;
561 for (std::vector<int>::const_iterator it = foes.begin(); it != foes.end(); ++it) {
562 foeIDs.push_back(internalLaneIDs[*it]);
600 if (style !=
PLAIN) {
601 if (includeInternal) {
629 for (std::vector<NBEdge*>::const_iterator i = incoming.begin(); i != incoming.end(); ++i) {
631 const std::vector<NBEdge::Connection>& connections = from->
getConnections();
632 for (std::vector<NBEdge::Connection>::const_iterator j = connections.begin(); j != connections.end(); ++j) {
653 const std::string& from,
const std::string& to,
654 int fromLane,
int toLane,
const std::string& via,
674 std::vector<std::vector<std::string> > edgeIDs;
675 for (std::set<EdgeSet>::const_iterator i = roundabouts.begin(); i != roundabouts.end(); ++i) {
676 std::vector<std::string> tEdgeIDs;
677 for (EdgeSet::const_iterator j = (*i).begin(); j != (*i).end(); ++j) {
680 tEdgeIDs.push_back((*j)->getID());
682 std::sort(tEdgeIDs.begin(), tEdgeIDs.end());
683 edgeIDs.push_back(tEdgeIDs);
685 std::sort(edgeIDs.begin(), edgeIDs.end());
687 for (std::vector<std::vector<std::string> >::const_iterator i = edgeIDs.begin(); i != edgeIDs.end(); ++i) {
690 if (roundabouts.size() != 0) {
699 std::vector<std::string> validEdgeIDs;
700 std::vector<std::string> invalidEdgeIDs;
701 std::vector<std::string> nodeIDs;
702 for (std::vector<std::string>::const_iterator i = edgeIDs.begin(); i != edgeIDs.end(); ++i) {
706 validEdgeIDs.push_back(edge->
getID());
708 invalidEdgeIDs.push_back(*i);
711 std::sort(nodeIDs.begin(), nodeIDs.end());
712 if (validEdgeIDs.size() > 0) {
717 if (invalidEdgeIDs.size() > 0) {
719 +
joinToString(invalidEdgeIDs,
" ") +
"' no longer exist'");
738 for (
int i = 0; i < (int)sources.size(); i++) {
745 for (
int i = 0; i < (int)sinks.size(); i++) {
758 if (time == std::floor(time)) {
768 for (NBConnectionProhibits::const_iterator j = prohibitions.begin(); j != prohibitions.end(); j++) {
771 for (NBConnectionVector::const_iterator k = prohibiting.begin(); k != prohibiting.end(); k++) {
790 std::vector<NBTrafficLightLogic*> logics = tllCont.
getComputed();
791 for (std::vector<NBTrafficLightLogic*>::iterator it = logics.begin(); it != logics.end(); it++) {
798 const bool varPhaseLength = (*it)->getType() !=
TLTYPE_STATIC;
799 const std::vector<NBTrafficLightLogic::PhaseDefinition>& phases = (*it)->getPhases();
800 for (std::vector<NBTrafficLightLogic::PhaseDefinition>::const_iterator j = phases.begin(); j != phases.end(); ++j) {
804 if (varPhaseLength) {
815 (*it)->writeParams(into);
818 if (logics.size() > 0) {
static void writeRoundabout(OutputDevice &into, const std::vector< std::string > &r, const NBEdgeCont &ec)
Writes a roundabout.
bool getKeepClear() const
Returns the keepClear flag.
LaneSpreadFunction getLaneSpreadFunction() const
Returns how this edge's lanes' lateral offset is computed.
std::string id
id of Connection
The information about how to spread the lanes from the given position.
int tlLinkNo
The index of this connection within the controlling traffic light.
void writePermissions(OutputDevice &into, SVCPermissions permissions)
writes allowed disallowed attributes if needed;
OutputDevice & writeAttr(const SumoXMLAttr attr, const T &val)
writes a named attribute
void close()
Closes the device and removes it from the dictionary.
static void writeLocation(OutputDevice &into)
writes the location element
A structure which describes a connection between edges or lanes.
const std::vector< NBEdge * > & getSourceEdges() const
Returns the sources.
LinkState getLinkState(const NBEdge *incoming, NBEdge *outgoing, int fromLane, int toLane, bool mayDefinitelyPass, const std::string &tlID) const
get link state
int toLane
The lane the connections yields in.
a list of node ids, used for controlling joining
NBTypeCont & getTypeCont()
Returns a reference to the type container.
int getInt(const std::string &name) const
Returns the int-value of the named option (only for Option_Integer)
Whether vehicles must keep the junction clear.
PositionVector shape
The lane's shape.
whether a given shape is user-defined
a source within a district (connection road)
static void writeDistrict(OutputDevice &into, const NBDistrict &d)
Writes a district.
std::map< std::string, NBNode * >::const_iterator begin() const
Returns the pointer to the begin of the stored nodes.
std::string viaID
if Connection have a via, ID of it
NBEdge * toEdge
The edge the connections yields in.
begin/end of the description of a junction
begin/end of the description of a single lane
static const double UNSPECIFIED_VISIBILITY_DISTANCE
unspecified foe visibility for connections
std::map< std::string, NBNode * >::const_iterator end() const
Returns the pointer to the end of the stored nodes.
static void writeInternalConnection(OutputDevice &into, const std::string &from, const std::string &to, int fromLane, int toLane, const std::string &via, LinkDirection dir=LINKDIR_STRAIGHT)
Writes a single internal connection.
A container for traffic light definitions and built programs.
a traffic assignment zone
void writePreferences(OutputDevice &into, SVCPermissions preferred)
writes allowed disallowed attributes if needed;
connectio between two lanes
std::vector< Crossing * > getCrossings() const
return this junctions pedestrian crossings
int getPriority() const
Returns the priority of the edge.
double length
This lane's width.
const std::string & getTypeID() const
get ID of type
int SVCPermissions
bitset where each bit declares whether a certain SVC may use this edge/lane
bool hasCustomShape() const
return whether the shape was set by the user
std::map< std::string, NBDistrict * >::const_iterator end() const
Returns the pointer to the end of the stored districts.
The representation of a single edge during network building.
foe visibility distance of a link
static void writeProhibitions(OutputDevice &into, const NBConnectionProhibits &prohibitions)
writes the given prohibitions
static const double UNSPECIFIED_RADIUS
unspecified lane width
A container for districts.
static const double UNSPECIFIED_OFFSET
unspecified lane offset
link,node: the traffic light id responsible for this link
bool hasCustomShape
whether this walkingArea has a custom shape
bool hasLoadedLength() const
Returns whether a length was set explicitly.
static const SUMOTime UNSPECIFIED_DURATION
Crossing * getCrossing(const std::string &id) const
return the crossing with the given id
const std::vector< NBEdge::Lane > & getLanes() const
Returns the lane definitions.
bool mayDefinitelyPass
Information about being definitely free to drive (on-ramps)
double endOffset
This lane's offset to the intersection begin.
NBEdge * getFrom() const
returns the from-edge (start of the connection)
double visibility
custom foe visiblity for connection
std::string id
the (edge)-id of this walkingArea
std::map< std::string, NBEdge * >::const_iterator end() const
Returns the pointer to the end of the stored edges.
bool getBool(const std::string &name) const
Returns the boolean-value of the named option (only for Option_Bool)
maximum duration of a phase
const std::string & getID() const
Returns the id.
std::map< std::string, NBDistrict * >::const_iterator begin() const
Returns the pointer to the begin of the stored districts.
bool isDefault(const std::string &name) const
Returns the information whether the named option has still the default value.
const SVCPermissions SVCAll
all VClasses are allowed
static void writeTrafficLights(OutputDevice &into, const NBTrafficLightLogicCont &tllCont)
writes the traffic light logics to the given device
static std::string getOppositeInternalID(const NBEdgeCont &ec, const NBEdge *from, const NBEdge::Connection &con)
retrieve the id of the opposite direction internal lane if it exists
static const double UNSPECIFIED_WIDTH
unspecified lane width
prohibition of circulation between two edges
PositionVector customShape
custom shape for connection
#define WRITE_WARNING(msg)
static OptionsCont & getOptions()
Retrieves the options.
bool accelRamp
Whether this lane is an acceleration lane.
bool priority
whether the pedestrians have priority
void writeParams(OutputDevice &out) const
LinkDirection
The different directions a link between two lanes may take (or a stream between two edges)...
The link is a straight direction.
static const double UNSPECIFIED_SPEED
unspecified lane speed
PositionVector shape
shape of Connection
A class representing a single district.
bool keepClear
whether the junction must be kept clear when using this connection
static std::string prohibitionConnection(const NBConnection &c)
the attribute value for a prohibition
An (internal) definition of a single lane of an edge.
bool isSet(const std::string &name, bool failOnNonExistant=true) const
Returns the information whether the named option is set.
SVCPermissions permissions
List of vehicle types that are allowed on this lane.
static void writeNetwork(const OptionsCont &oc, NBNetBuilder &nb)
Writes the network into a SUMO-file.
bool writeLogic(OutputDevice &into, const bool checkLaneFoes) const
writes the XML-representation of the logic as a bitset-logic XML representation
The turning radius at an intersection in m.
std::map< std::string, NBEdge * >::const_iterator begin() const
Returns the pointer to the begin of the stored edges.
double speed
custom speed for connection
std::string toString(const T &t, std::streamsize accuracy=gPrecision)
std::string tlID
The id of the traffic light that controls this connection.
SVCPermissions preferred
List of vehicle types that are preferred on this lane.
This is an uncontrolled, minor link, has to brake.
const PositionVector & getShape() const
Returns the shape.
std::string getLaneID(int lane) const
get Lane ID (Secure)
static bool writeInternalConnections(OutputDevice &into, const NBNode &n)
Writes inner connections within the node.
int fromLane
The lane the connections starts at.
bool writeXMLHeader(const std::string &rootElement, const std::string &schemaFile, std::map< SumoXMLAttr, std::string > attrs=std::map< SumoXMLAttr, std::string >())
Writes an XML header with optional configuration.
A point in 2D or 3D with translation and scaling methods.
NBEdgeCont & getEdgeCont()
static const double UNSPECIFIED_CONTPOS
unspecified internal junction position
std::string getString(const std::string &name) const
Returns the string-value of the named option (only for Option_String)
bool hasDefaultGeometry() const
Returns whether the geometry consists only of the node positions.
LinkState
The right-of-way state of a link between two lanes used when constructing a NBTrafficLightLogic, in MSLink and GNEInternalLane.
roundabout defined in junction
Storage for edges, including some functionality operating on multiple edges.
const std::string & getStreetName() const
Returns the street name of this edge.
const std::set< EdgeSet > getRoundabouts() const
Returns the determined roundabouts.
static void writePositionLong(const Position &pos, OutputDevice &dev)
Writes the given position to device in long format (one attribute per dimension)
edge: the shape in xml-definition
PositionVector getSubpart(double beginOffset, double endOffset) const
get subpart of a position vector
begin/end of the description of a neighboring lane
An upper class for objects with additional parameters.
static std::string escapeXML(const std::string &orig, const bool maskDoubleHyphen=false)
Replaces the standard escapes by their XML entities.
double speed
The speed allowed on this lane.
double width
This lane's width.
double getFinalLength() const
get length that will be assigned to the lanes in the final network
std::vector< NBConnection > NBConnectionVector
Definition of a connection vector.
begin/end of the description of an edge
static void normaliseSum(std::vector< T > &v, T msum=1.0)
int size() const
Returns the number of districts inside the container.
LinkDirection getDirection(const NBEdge *const incoming, const NBEdge *const outgoing, bool leftHand=false) const
Returns the representation of the described stream's direction.
const PositionVector & getShape() const
retrieve the junction shape
PositionVector simplified() const
return the same shape with intermediate colinear points removed
NBEdge * getTo() const
returns the to-edge (end of the connection)
int internalLaneIndex
The lane index of this internal lane within the internal edge.
const PositionVector & getGeometry() const
Returns the geometry of the edge.
const std::vector< double > & getSinkWeights() const
Returns the weights of the sinks.
double length() const
Returns the length.
std::map< NBConnection, NBConnectionVector > NBConnectionProhibits
Definition of a container for connection block dependencies Includes a list of all connections which ...
std::vector< NBTrafficLightLogic * > getComputed() const
Returns a list of all computed logics.
double getRadius() const
Returns the turning radius of this node.
std::string oppositeID
An opposite lane ID, if given.
a sink within a district (connection road)
the edges crossed by a pedestrian crossing
const EdgeVector & getIncomingEdges() const
Returns this node's incoming edges (The edges which yield in this node)
const std::vector< Connection > & getConnections() const
Returns the connections.
NBNodeCont & getNodeCont()
Returns a reference to the node container.
Instance responsible for building networks.
static OutputDevice & getDevice(const std::string &name)
Returns the described OutputDevice.
int tlLinkNo
the traffic light index of this crossing (if controlled)
static void interpretLaneID(const std::string &lane_id, std::string &edge_id, int &index)
parses edge-id and index from lane-id
std::vector< NBEdge * > EdgeVector
container for (sorted) edges
static bool writeInternalNodes(OutputDevice &into, const NBNode &n)
Writes internal junctions (<junction with id[0]==':' ...) of the given node.
NBEdge * retrieve(const std::string &id, bool retrieveExtracted=false) const
Returns the edge that has the given id.
const std::vector< NBEdge * > & getSinkEdges() const
Returns the sinks.
A definition of a pedestrian walking area.
double contPos
custom position for internal junction on this connection
static void writeLane(OutputDevice &into, const std::string &lID, double speed, SVCPermissions permissions, SVCPermissions preferred, double endOffset, double width, PositionVector shape, const Parameterised *params, double length, int index, const std::string &oppositeID, bool accelRamp=false, bool customShape=false)
Writes a lane (<lane ...) of an edge.
A storage for options typed value containers)
SumoXMLNodeType getType() const
Returns the type of this node.
This is an uncontrolled, major link, may pass.
NBTrafficLightLogicCont & getTLLogicCont()
Returns a reference to the traffic light logics container.
The abstract direction of a link.
const Position & getPosition() const
Represents a single node (junction) during network building.
A definition of a pedestrian crossing.
const std::vector< WalkingArea > & getWalkingAreas() const
return this junctions pedestrian walking areas
Static storage of an output device and its base (abstract) implementation.
bool closeTag()
Closes the most recently opened tag.
static void writeJunction(OutputDevice &into, const NBNode &n, const bool checkLaneFoes)
Writes a junction (<junction ...)
link: the index of the link within the traffic light
std::string tlID
The id of the traffic light that controls this connection.
bool isMacroscopicConnector() const
Returns whether this edge was marked as a macroscopic connector.
const std::vector< double > & getSourceWeights() const
Returns the weights of the sources.
NBNode * getFromNode() const
Returns the origin node of the edge.
Container for nodes during the netbuilding process.
std::string getInternalLaneID() const
get ID of internal lane
static bool writeInternalEdges(OutputDevice &into, const NBEdgeCont &ec, const NBNode &n)
Writes internal edges (<edge ... with id[0]==':') of the given node.
static void writeEdge(OutputDevice &into, const NBEdge &e, bool noNames)
Writes an edge (<edge ...)
bool haveVia
check if Connection have a Via
double getLoadedLength() const
Returns the length was set explicitly or the computed length if it wasn't set.
NBDistrictCont & getDistrictCont()
Returns a reference the districts container.
PositionVector customShape
A custom shape for this lane set by the user.
static const std::string MAJOR_VERSION
The version number for written files.
static void writeRoundabouts(OutputDevice &into, const std::set< EdgeSet > &roundabouts, const NBEdgeCont &ec)
Writes roundabouts.
NBNode * getToNode() const
Returns the destination node of the edge.
a single phase description
static std::string writeSUMOTime(SUMOTime time)
writes a SUMOTime as int if possible, otherwise as a float
std::string joinToString(const std::vector< T > &v, const T_BETWEEN &between, std::streamsize accuracy=gPrecision)
OutputDevice & openTag(const std::string &xmlElement)
Opens an XML tag.
void lf()
writes a line feed if applicable
const SVCPermissions SVC_UNSPECIFIED
permissions not specified
static void writeConnection(OutputDevice &into, const NBEdge &from, const NBEdge::Connection &c, bool includeInternal, ConnectionStyle style=SUMONET)
Writes connections outgoing from the given edge (also used in NWWriter_XML)
PositionVector shape
The polygonal shape.
void writeTypes(OutputDevice &into) const
writes all types a s XML
The link has no direction (is a dead end link)
double width
This lane's width.