readOSRMGraphFromStream() counts the number of distinct nodes

Util/GraphLoader.h

@@ -69,6 +69,123 @@ NodeID readOSRMGraphFromStream(istream &in, vector<EdgeT>& edgeList, vector<Node
         assert(weight > 0);
         assert(0<=dir && dir<=2);
 
+        bool forward = true;
+        bool backward = true;
+        if (1 == dir) backward = false;
+        if (2 == dir) forward = false;
+
+        if(length == 0)
+        { cerr << "loaded null length edge" << endl; exit(1); }
+
+        //         translate the external NodeIDs to internal IDs
+        ExternalNodeMap::iterator intNodeID = ext2IntNodeMap.find(source);
+        if( ext2IntNodeMap.find(source) == ext2IntNodeMap.end())
+        {
+            cerr << "after " << edgeList.size() << " edges" << endl;
+            cerr << "->" << source << "," << target << "," << length << "," << dir << "," << weight << endl;
+            cerr << "unresolved source NodeID: " << source << endl; exit(0);
+        }
+        source = intNodeID->second;
+        intNodeID = ext2IntNodeMap.find(target);
+        if(ext2IntNodeMap.find(target) == ext2IntNodeMap.end()) { cerr << "unresolved target NodeID : " << target << endl; exit(0); }
+        target = intNodeID->second;
+
+        if(source == UINT_MAX || target == UINT_MAX) { cerr << "nonexisting source or target" << endl; exit(0); }
+
+        EdgeT inputEdge(source, target, nameID, weight, forward, backward, type );
+        edgeList.push_back(inputEdge);
+    }
+    ext2IntNodeMap.clear();
+    vector<ImportEdge>(edgeList.begin(), edgeList.end()).swap(edgeList); //remove excess candidates.
+    cout << "ok" << endl;
+    return n;
+}
+
+template<typename EdgeT>
+NodeID readDTMPGraphFromStream(istream &in, vector<EdgeT>& edgeList, vector<NodeInfo> * int2ExtNodeMap) {
+    NodeID n, source, target, id;
+    EdgeID m;
+    int dir, xcoord, ycoord;// direction (0 = open, 1 = forward, 2+ = open)
+    ExternalNodeMap ext2IntNodeMap;
+    ext2IntNodeMap.set_empty_key(UINT_MAX);
+    in >> n;
+    VERBOSE(cout << "Importing n = " << n << " nodes ..." << flush;)
+    for (NodeID i=0; i<n;i++) {
+        in >> id >> ycoord >> xcoord;
+        int2ExtNodeMap->push_back(NodeInfo(xcoord, ycoord, id));
+        ext2IntNodeMap.insert(make_pair(id, i));
+    }
+    in >> m;
+    VERBOSE(cout << " and " << m << " edges ..." << flush;)
+
+    edgeList.reserve(m);
+    for (EdgeID i=0; i<m; i++) {
+        EdgeWeight weight;
+        unsigned speedType(0);
+        short type(0);
+       // NodeID nameID;
+        int length;
+        in >> source >> target >> length >> dir >> speedType;
+
+        if(dir == 3)
+            dir = 0;
+
+        switch(speedType) {
+        case 1:
+            weight = 130;
+            break;
+        case 2:
+            weight = 120;
+            break;
+        case 3:
+            weight = 110;
+            break;
+        case 4:
+            weight = 100;
+            break;
+        case 5:
+            weight = 90;
+            break;
+        case 6:
+            weight = 80;
+            break;
+        case 7:
+            weight = 70;
+            break;
+        case 8:
+            weight = 60;
+            break;
+        case 9:
+            weight = 50;
+            break;
+        case 10:
+            weight = 40;
+            break;
+        case 11:
+            weight = 30;
+            break;
+        case 12:
+            weight = 20;
+            break;
+        case 13:
+            weight = length;
+            break;
+        case 15:
+            weight = 10;
+            break;
+        default:
+            weight = 0;
+        }
+
+        weight = length*weight/3.6;
+        if(speedType == 13)
+            weight = length;
+        assert(length > 0);
+        assert(weight > 0);
+        if(dir <0 || dir > 2)
+            std::cerr << "[error] direction bogus: " << dir << std::endl;
+        assert(0<=dir && dir<=2);
+
         bool forward = true;
         bool backward = true;
         if (dir == 1) backward = false;
@@ -92,7 +209,53 @@ NodeID readOSRMGraphFromStream(istream &in, vector<EdgeT>& edgeList, vector<Node
 
         if(source == UINT_MAX || target == UINT_MAX) { cerr << "nonexisting source or target" << endl; exit(0); }
 
-        EdgeT inputEdge(source, target, nameID, weight, forward, backward, type );
+        EdgeT inputEdge(source, target, 0, weight, forward, backward, type );
+        edgeList.push_back(inputEdge);
+    }
+    ext2IntNodeMap.clear();
+    vector<ImportEdge>(edgeList.begin(), edgeList.end()).swap(edgeList); //remove excess candidates.
+    cout << "ok" << endl;
+    return n;
+}
+template<typename EdgeT>
+
+NodeID readDDSGGraphFromStream(istream &in, vector<EdgeT>& edgeList, vector<NodeInfo> * int2ExtNodeMap) {
+    NodeID n, source, target;
+    char d;
+    EdgeID m;
+    int dir;// direction (0 = open, 1 = forward, 2+ = open)
+    ExternalNodeMap ext2IntNodeMap;
+    ext2IntNodeMap.set_empty_key(UINT_MAX);
+    in >> d;
+    in >> n;
+    in >> m;
+    std::cout << n << " nodes and " << m << " edges ..." << flush;
+
+    edgeList.reserve(m);
+    for (EdgeID i=0; i<m; i++) {
+        EdgeWeight weight;
+        in >> source >> target >> weight >> dir;
+
+//        if(dir == 3)
+//            dir = 0;
+
+        assert(weight > 0);
+        if(dir <0 || dir > 3)
+            std::cerr << "[error] direction bogus: " << dir << std::endl;
+        assert(0<=dir && dir<=3);
+
+        bool forward = true;
+        bool backward = true;
+        if (dir == 1) backward = false;
+        if (dir == 2) forward = false;
+        if (dir == 3) {backward = true; forward = true;}
+
+        if(weight == 0)
+        { cerr << "loaded null length edge" << endl; exit(1); }
+
+        if(source == UINT_MAX || target == UINT_MAX) { cerr << "nonexisting source or target" << endl; exit(0); }
+
+        EdgeT inputEdge(source, target, 0, weight, forward, backward, 1 );
         edgeList.push_back(inputEdge);
     }
     ext2IntNodeMap.clear();