Removing an unnecessary sorting step.
This commit is contained in:
parent
417fcde9db
commit
827b9e4be2
@ -349,8 +349,8 @@ void EdgeBasedGraphFactory::Run(const char * originalEdgeDataFilename) {
|
|||||||
originalEdgeDataOutFile.write((char*)&numberOfOriginalEdges, sizeof(unsigned));
|
originalEdgeDataOutFile.write((char*)&numberOfOriginalEdges, sizeof(unsigned));
|
||||||
originalEdgeDataOutFile.close();
|
originalEdgeDataOutFile.close();
|
||||||
|
|
||||||
INFO("Sorting edge-based Nodes");
|
// INFO("Sorting edge-based Nodes");
|
||||||
std::sort(edgeBasedNodes.begin(), edgeBasedNodes.end());
|
// std::sort(edgeBasedNodes.begin(), edgeBasedNodes.end());
|
||||||
// INFO("Removing duplicate nodes (if any)");
|
// INFO("Removing duplicate nodes (if any)");
|
||||||
// edgeBasedNodes.erase( std::unique(edgeBasedNodes.begin(), edgeBasedNodes.end()), edgeBasedNodes.end() );
|
// edgeBasedNodes.erase( std::unique(edgeBasedNodes.begin(), edgeBasedNodes.end()), edgeBasedNodes.end() );
|
||||||
// INFO("Applying vector self-swap trick to free up memory");
|
// INFO("Applying vector self-swap trick to free up memory");
|
||||||
|
Loading…
Reference in New Issue
Block a user