fixing some memory problems
This commit is contained in:
		
							parent
							
								
									a21376f6ce
								
							
						
					
					
						commit
						7d21a4e0fb
					
				@ -146,7 +146,7 @@ void EdgeBasedGraphFactory::Run() {
 | 
				
			|||||||
                        }
 | 
					                        }
 | 
				
			||||||
                    }
 | 
					                    }
 | 
				
			||||||
                    ++secondRestrictionIterator;
 | 
					                    ++secondRestrictionIterator;
 | 
				
			||||||
                } while(u == secondRestrictionIterator->fromNode);
 | 
					                } while(secondRestrictionIterator != inputRestrictions.end() && u == secondRestrictionIterator->fromNode);
 | 
				
			||||||
            }
 | 
					            }
 | 
				
			||||||
            if(_nodeBasedGraph->EndEdges(v) == _nodeBasedGraph->BeginEdges(v) + 1 && _nodeBasedGraph->GetEdgeData(e1).type != INT_MAX) {
 | 
					            if(_nodeBasedGraph->EndEdges(v) == _nodeBasedGraph->BeginEdges(v) + 1 && _nodeBasedGraph->GetEdgeData(e1).type != INT_MAX) {
 | 
				
			||||||
                EdgeBasedNode currentNode;
 | 
					                EdgeBasedNode currentNode;
 | 
				
			||||||
@ -194,7 +194,7 @@ void EdgeBasedGraphFactory::Run() {
 | 
				
			|||||||
                                }
 | 
					                                }
 | 
				
			||||||
                            }
 | 
					                            }
 | 
				
			||||||
                            ++secondRestrictionIterator;
 | 
					                            ++secondRestrictionIterator;
 | 
				
			||||||
                        } while(u == secondRestrictionIterator->fromNode);
 | 
					                        } while(secondRestrictionIterator != inputRestrictions.end() && u == secondRestrictionIterator->fromNode);
 | 
				
			||||||
                    }
 | 
					                    }
 | 
				
			||||||
 | 
					
 | 
				
			||||||
                    if( !isTurnRestricted || (isOnlyAllowed && w == onlyToNode) ) { //only add an edge if turn is not prohibited
 | 
					                    if( !isTurnRestricted || (isOnlyAllowed && w == onlyToNode) ) { //only add an edge if turn is not prohibited
 | 
				
			||||||
 | 
				
			|||||||
@ -155,6 +155,7 @@ int main (int argc, char *argv[]) {
 | 
				
			|||||||
 | 
					
 | 
				
			||||||
    std::vector< ContractionCleanup::Edge > contractedEdges;
 | 
					    std::vector< ContractionCleanup::Edge > contractedEdges;
 | 
				
			||||||
    contractor->GetEdges( contractedEdges );
 | 
					    contractor->GetEdges( contractedEdges );
 | 
				
			||||||
 | 
					    delete contractor;
 | 
				
			||||||
 | 
					
 | 
				
			||||||
    ContractionCleanup * cleanup = new ContractionCleanup(n, contractedEdges);
 | 
					    ContractionCleanup * cleanup = new ContractionCleanup(n, contractedEdges);
 | 
				
			||||||
    contractedEdges.clear();
 | 
					    contractedEdges.clear();
 | 
				
			||||||
 | 
				
			|||||||
		Loading…
	
		Reference in New Issue
	
	Block a user