boost/graph
2
0
Fork 0
mirror of https://github.com/boostorg/graph.git synced 2026-01-30 20:02:12 +00:00
Code Issues Projects Releases Wiki Activity

added generate_random_graph

Browse Source 
[SVN r8966]
This commit is contained in:
Jeremy Siek
2001-02-06 02:02:33 +00:00
parent cfa4f5c4a1
commit 022acc9531
1 changed files with 35 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

35
include/boost/graph/graph_utility.hpp
View File

@@ -199,6 +199,30 @@ namespace boost {
return *i;
}
template <typename MutableGraph>
void generate_random_graph
(MutableGraph& g,
typename graph_traits<MutableGraph>::vertices_size_type V,
typename graph_traits<MutableGraph>::vertices_size_type E,
bool self_edges = false)
{
typedef graph_traits<MutableGraph> Traits;
typedef typename Traits::vertices_size_type v_size_t;
typedef typename Traits::edges_size_type e_size_t;
typedef typename Traits::vertex_descriptor vertex_descriptor;
for (v_size_t i = 0; i < V; ++i)
add_vertex(g);
for (e_size_t j = 0; j < E; ++j) {
vertex_descriptor a = random_vertex(g), b;
do {
b = random_vertex(g);
} while (self_edges == false && a == b);
add_edge(a, b, g);
}
}
template <class Graph, class Vertex>
bool is_adj_dispatch(Graph& g, Vertex a, Vertex b, bidirectional_tag)
{
@@ -287,6 +311,17 @@ namespace boost {
return false;
}
// is x a descendant of y?
template <typename Node, typename ParentMap>
inline bool is_descendant(Node x, Node y, ParentMap p) {
if (p[x] == x) // x is the root of the tree
return false;
else if (p[x] == y)
return true;
else
return is_descendant(p[x], y, p);
}
template <class T1, class T2>
std::pair<T1,T2>
make_list(const T1& t1, const T2& t2)