ARCHIVE/rippled
1
0
Fork 0
mirror of https://github.com/XRPLF/rippled.git synced 2025-12-06 17:27:55 +00:00
Code Issues Packages Projects Releases Wiki Activity

Fix clang compile

Browse Source
This commit is contained in:
NATTSiM
2014-02-05 18:27:35 -08:00
committed by Vinnie Falco
parent 9b657ba224
commit 9cc8c341e7
9 changed files with 15 additions and 172 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -31,52 +31,46 @@ struct VertexTraits;
Function will be called with this signature:
void (Vertex&, std::size_t diameter);
*/
template <typename Vertex, typename Function>
void breadth_first_traverse (Vertex& start, Function f)
{
typedef VertexTraits <Vertex> Traits;
typedef typename Traits::Edges Edges;
typedef typename Traits::Edge Edge;
struct Probe
{
Probe (Vertex* v, int d)
: vertex (v), distance (d)
{ }
Vertex* const vertex;
int const distance;
};
typedef std::deque <Probe> Work;
typedef std::pair <Vertex*, int> Probe;
typedef std::deque <Probe const> Work;
typedef std::set <Vertex*> Visited;
Work work;
Visited visited;
work.emplace_back (&start, 0);
work.emplace_back (std::make_pair (&start, 0));
int diameter (0);
while (! work.empty ())
{
Probe const p (work.front());
work.pop_front ();
if (visited.find (p.vertex) != visited.end ())
if (visited.find (p.first) != visited.end ())
continue;
diameter = std::max (p.distance, diameter);
visited.insert (p.vertex);
diameter = std::max (p.second, diameter);
visited.insert (p.first);
for (typename Edges::iterator iter (
Traits::edges (*p.vertex).begin());
iter != Traits::edges (*p.vertex).end(); ++iter)
Traits::edges (*p.first).begin());
iter != Traits::edges (*p.first).end(); ++iter)
{
Vertex* v (Traits::vertex (*iter));
if (visited.find (v) != visited.end())
continue;
if (! iter->closed())
work.emplace_back (v, p.distance + 1);
work.emplace_back (std::make_pair (v, p.second + 1));
}
f (*p.vertex, diameter);
f (*p.first, diameter);
}
}
}
}
}
#endif
#endif