ARCHIVE/xahaud
3
0
Fork 0
mirror of https://github.com/Xahau/xahaud.git synced 2025-12-06 17:27:52 +00:00
Code Issues Packages Projects Releases Wiki Activity

Fix gcc compile

Browse Source
This commit is contained in:
Vinnie Falco
2014-02-07 09:09:01 -08:00
parent 588cf4bfca
commit 575b0bb7b0
1 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
src/ripple/peerfinder/sim/GraphAlgorithms.h
View File

@@ -40,11 +40,11 @@ void breadth_first_traverse (Vertex& start, Function f)
typedef typename Traits::Edge Edge;
typedef std::pair <Vertex*, int> Probe;
typedef std::deque <Probe const> Work;
typedef std::deque <Probe> Work;
typedef std::set <Vertex*> Visited;
Work work;
Visited visited;
work.emplace_back (std::make_pair (&start, 0));
work.emplace_back (&start, 0);
int diameter (0);
while (! work.empty ())
{
@@ -62,7 +62,7 @@ void breadth_first_traverse (Vertex& start, Function f)
if (visited.find (v) != visited.end())
continue;
if (! iter->closed())
work.emplace_back (std::make_pair (v, p.second + 1));
work.emplace_back (v, p.second + 1);
}
f (*p.first, diameter);
}