Fixing an invalid read when contracting rather small graphs. Partially
fixes issue #218
This commit is contained in:
parent
765b1cb3a5
commit
819c1729f1
@ -426,6 +426,7 @@ public:
|
|||||||
template< class Edge >
|
template< class Edge >
|
||||||
void GetEdges( std::vector< Edge >& edges ) {
|
void GetEdges( std::vector< Edge >& edges ) {
|
||||||
NodeID numberOfNodes = _graph->GetNumberOfNodes();
|
NodeID numberOfNodes = _graph->GetNumberOfNodes();
|
||||||
|
if(oldNodeIDFromNewNodeIDMap.size()) {
|
||||||
for ( NodeID node = 0; node < numberOfNodes; ++node ) {
|
for ( NodeID node = 0; node < numberOfNodes; ++node ) {
|
||||||
for ( _DynamicGraph::EdgeIterator edge = _graph->BeginEdges( node ), endEdges = _graph->EndEdges( node ); edge < endEdges; edge++ ) {
|
for ( _DynamicGraph::EdgeIterator edge = _graph->BeginEdges( node ), endEdges = _graph->EndEdges( node ); edge < endEdges; edge++ ) {
|
||||||
const NodeID target = _graph->GetTarget( edge );
|
const NodeID target = _graph->GetTarget( edge );
|
||||||
@ -433,7 +434,6 @@ public:
|
|||||||
Edge newEdge;
|
Edge newEdge;
|
||||||
newEdge.source = oldNodeIDFromNewNodeIDMap[node];
|
newEdge.source = oldNodeIDFromNewNodeIDMap[node];
|
||||||
newEdge.target = oldNodeIDFromNewNodeIDMap[target];
|
newEdge.target = oldNodeIDFromNewNodeIDMap[target];
|
||||||
|
|
||||||
assert(UINT_MAX != newEdge.source);
|
assert(UINT_MAX != newEdge.source);
|
||||||
assert(UINT_MAX != newEdge.target);
|
assert(UINT_MAX != newEdge.target);
|
||||||
|
|
||||||
@ -445,13 +445,12 @@ public:
|
|||||||
newEdge.data.id = data.id;
|
newEdge.data.id = data.id;
|
||||||
|
|
||||||
assert(newEdge.data.id != UINT_MAX);
|
assert(newEdge.data.id != UINT_MAX);
|
||||||
// newEdge.data.nameID = data.nameID;
|
|
||||||
// newEdge.data.turnInstruction = data.turnInstruction;
|
|
||||||
newEdge.data.forward = data.forward;
|
newEdge.data.forward = data.forward;
|
||||||
newEdge.data.backward = data.backward;
|
newEdge.data.backward = data.backward;
|
||||||
edges.push_back( newEdge );
|
edges.push_back( newEdge );
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
}
|
||||||
std::ifstream temporaryEdgeStorage(temporaryEdgeStorageFilename.c_str(), std::ios::binary);
|
std::ifstream temporaryEdgeStorage(temporaryEdgeStorageFilename.c_str(), std::ios::binary);
|
||||||
//Also get the edges from temporary storage
|
//Also get the edges from temporary storage
|
||||||
unsigned numberOfTemporaryEdges = 0;
|
unsigned numberOfTemporaryEdges = 0;
|
||||||
@ -470,8 +469,6 @@ public:
|
|||||||
newEdge.data.distance = data.distance;
|
newEdge.data.distance = data.distance;
|
||||||
newEdge.data.shortcut = data.shortcut;
|
newEdge.data.shortcut = data.shortcut;
|
||||||
newEdge.data.id = data.id;
|
newEdge.data.id = data.id;
|
||||||
// newEdge.data.nameID = data.nameID;
|
|
||||||
// newEdge.data.turnInstruction = data.turnInstruction;
|
|
||||||
newEdge.data.forward = data.forward;
|
newEdge.data.forward = data.forward;
|
||||||
newEdge.data.backward = data.backward;
|
newEdge.data.backward = data.backward;
|
||||||
edges.push_back( newEdge );
|
edges.push_back( newEdge );
|
||||||
|
Loading…
Reference in New Issue
Block a user