Course_COP5725/MapLoader.cpp at main · hzhou10cs/Course_COP5725 · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
#include "MapLoader.h"

int DataLoader::numNodes = 0;
int DataLoader::numEdges = 0;

vector<Node> DataLoader::nodes;
vector<Edge> DataLoader::edges;

map<int, adj_node> DataLoader::adj_matrix;

/***************************************
 * Reading Node stream
 ***************************************/

istream& operator>>(istream& in, Node& n)
{
    in >> n.nodeID >> n.longitude >> n.latitude;
    if (!in) n = Node();
    return in;
}

ostream& operator<<(ostream& out, const Node& n)
{
    out << n.nodeID << " " << n.longitude << " "
        << n.latitude << endl;
    return out;
}

/***************************************
 * Reading Edge stream
 ***************************************/

istream& operator>>(istream& in, Edge& e)
{
    in >> e.edgeID >> e.startNodeID >> e.endNodeID >> e.length;
    if (!in) e = Edge();
    return in;
}

ostream& operator<<(ostream& out, const Edge& e)
{
    out << e.edgeID << " " << e.startNodeID << " " << e.endNodeID << " "
        << e.length << endl;
    return out;
}

/***************************************
 * Dataloader Scheduler
 ***************************************/

void DataLoader::load()
{
    cout << endl;
    cout << "-------------Loading Road Map------------" << endl;

    srand(150);
    readNodes();
    readEdges();

    // test only -->
    if(ArgumentManager::mapdata == "test")
    {
        nodes.at(0).cateID = 0;
        nodes.at(1).cateID = 1;
        nodes.at(2).cateID = 2;
        nodes.at(3).cateID = 1;
        nodes.at(4).cateID = 3;
        nodes.at(5).cateID = 2;
        nodes.at(6).cateID = 3;
        nodes.at(7).cateID = 4;
    }

}

/***************************************
 * Dataloader Read Nodes
 ***************************************/

void DataLoader::readNodes()
{
    string filename;
    filename = "data/"+ArgumentManager::mapdata+".cnode";
    ifstream nodefile(filename);
    if(nodefile.is_open())
    {
        while(nodefile.good())
        {
            Node node;
            nodefile >> node;
            node.cateID = rand()%ArgumentManager::totalCate;
            nodes.push_back(node);
            numNodes++;
            if(numNodes==8000){
                break;
            }
        }
        nodefile.close();
    }
    else
    {
        cout << "cal.cnode is not open" << endl;
    }
    // numNodes--;
    cout << numNodes << " vertex has been loaded ... ..." << endl;
}

/***************************************
 * Dataloader Read Edge
 ***************************************/

void DataLoader::readEdges()
{
    string filename;
    filename = "data/"+ArgumentManager::mapdata+".cedge";
    ifstream edgefile(filename);
    if(edgefile.is_open())
    {
        while(edgefile.good())
        {
            Edge edge;
            edgefile >> edge;
            if(edge.startNodeID>=8000||edge.endNodeID>=8000){
                continue;
            }
            edges.push_back(edge);
            numEdges++;
        }
        edgefile.close();

    }
    else
    {
        cout << "cal.edge is not open" << endl;
    }
    int total_edges = numEdges;
    cout << "numedge is " << endl;
    if (ArgumentManager::direct==0)
    {
        for (int e = 0; e<total_edges; e++)
        {
            Edge reversed_edge;
            reversed_edge.edgeID = edges.at(e).edgeID +total_edges;
            reversed_edge.startNodeID = edges.at(e).endNodeID;
            reversed_edge.endNodeID = edges.at(e).startNodeID;
            reversed_edge.length= edges.at(e).length;
            edges.push_back(reversed_edge);
            numEdges++;
        }
    }
    cout << numEdges << " Edges has been loaded ... ..." << endl;

}

/***************************************
 * Dataloader Read Edge
 ***************************************/

void DataLoader::constructing()
{
    int startID;
    node_dis nd_pair;
    for (int i=0; i<numEdges; i++)
    {
        startID = edges.at(i).startNodeID;
        nd_pair.first = edges.at(i).endNodeID;
        nd_pair.second = edges.at(i).length;
        adj_matrix[startID].push_back(nd_pair);
    }
    // if (ArgumentManager::direct==0)
    // {
    //     for (int i=0; i<numEdges; i++)
    //     {
    //         startID = edges.at(i).endNodeID;
    //         nd_pair.first = edges.at(i).startNodeID;
    //         nd_pair.second = edges.at(i).length;
    //         adj_matrix[startID].push_back(nd_pair);
    //     }
    // }
}