- if ( nodeBranches[0].back() == nodeBranches[1].back() )
- {
- // it is a closed branch, keep theStartNode first
- nodeBranches[0].pop_back();
- nodeBranches[0].reserve( nodeBranches[0].size() + nodeBranches[1].size() );
- nodeBranches[0].insert( nodeBranches[0].end(),
- nodeBranches[1].rbegin(), nodeBranches[1].rend() );
- branches[0].reserve( branches[0].size() + branches[1].size() );
- branches[0].insert( branches[0].end(), branches[1].rbegin(), branches[1].rend() );
- }
- else
- {
- std::reverse( nodeBranches[0].begin(), nodeBranches[0].end() );
- nodeBranches[0].pop_back();
- nodeBranches[0].reserve( nodeBranches[0].size() + nodeBranches[1].size() );
- nodeBranches[0].insert( nodeBranches[0].end(),
- nodeBranches[1].begin(), nodeBranches[1].end() );
-
- std::reverse( branches[0].begin(), branches[0].end() );
- branches[0].reserve( branches[0].size() + branches[1].size() );
- branches[0].insert( branches[0].end(), branches[1].begin(), branches[1].end() );
- }
+ std::reverse( nodeBranches[0].begin(), nodeBranches[0].end() );
+ nodeBranches[0].pop_back();
+ nodeBranches[0].reserve( nodeBranches[0].size() + nodeBranches[1].size() );
+ nodeBranches[0].insert( nodeBranches[0].end(),
+ nodeBranches[1].begin(), nodeBranches[1].end() );
+
+ std::reverse( branches[0].begin(), branches[0].end() );
+ branches[0].reserve( branches[0].size() + branches[1].size() );
+ branches[0].insert( branches[0].end(), branches[1].begin(), branches[1].end() );
+