output.netconvert

Parsing sumo-net from 'input_net.net.xml' ... done (2ms).
Parsing public transport stops from 'input_ptstops.xml' ... done.
Parsing public transport lines from 'input_ptlines.xml' ... done.
 Import done:
   12 nodes loaded.
   10 edges loaded.
Removing self-loops ... done (0ms).
Processing public transport stops ... done (0ms).
Revising public transport stops based on pt lines ... done (0ms).
Align pt stop id signs with corresponding edge id signs ... done (0ms).
Added 2 bidi-edges for public transport stops and a total of 4 bidi-edges to ensure connectivity of stops (0 stops remain disconnected)
DijkstraRouter answered 2 queries and explored 9.00 edges on average.
DijkstraRouter spent 0.00s answering queries (0.00ms on average).
Found 14 railway edges and 12 railway nodes (0 signals).
Railway nodes by number of incoming,outgoing edges:
   0,1 count: 2 broken: 0
   1,0 count: 2 broken: 0
   1,1 count: 4 broken: 0
   2,2 count: 4 broken: 0
Found 0 broken railway nodes (A=0 B=0 C=0 D=0)
Found 0 railway nodes marked as buffer_stop
Found 4 bidirectional rail edges
Removing empty nodes ... done (0ms).
   0 nodes removed.
Computing turning directions ... done (0ms).
Assigning nodes to traffic lights ... done (0ms).
Sorting nodes' edges ... done (0ms).
Computing node shapes ... done (0ms).
Computing edge shapes ... done (0ms).
Computing node types ... done (0ms).
Computing priorities ... done (0ms).
Computing approached edges ... done (0ms).
Guessing and setting roundabouts ... done (0ms).
Computing approaching lanes ... done (0ms).
Dividing of lanes on approached lanes ... done (0ms).
Processing turnarounds ... done (0ms).
Rechecking of lane endings ... done (0ms).
Computing traffic light control information ... done (0ms).
Computing node logics ... done (0ms).
Computing traffic light logics ... done (0ms).
 0 traffic light(s) computed.
Building inner edges ... done (1ms).
Added 2 stops for superposed rail edges.
Find accesses for pt rail stops ... done (0ms).
DijkstraRouter answered 4 queries and explored 3.50 edges on average.
DijkstraRouter spent 0.00s answering queries (0.00ms on average).
-----------------------------------------------------
Summary:
 Node type statistics:
  Unregulated junctions       : 0
  Dead-end junctions          : 5
  Priority junctions          : 7
  Right-before-left junctions : 0
 Network boundaries:
  Original boundary  : -100.95,-200.00,300.00,-87.31
  Applied offset     : 0.00,0.00
  Converted boundary : -100.95,-200.00,300.00,-87.31
-----------------------------------------------------
Writing network ... done (3ms).
Success.