7 #include <graybat/graphPolicy/Traits.hpp>
12 template<
typename T_GraphPolicy>
15 using GraphPolicy = T_GraphPolicy;
16 using VertexDescription = graybat::graphPolicy::VertexDescription<GraphPolicy>;
17 using EdgeDescription = graybat::graphPolicy::EdgeDescription<GraphPolicy>;
18 using GraphDescription = graybat::graphPolicy::GraphDescription<GraphPolicy>;
19 using EdgeProperty = graybat::graphPolicy::EdgeProperty<GraphPolicy>;
20 using VertexProperty = graybat::graphPolicy::VertexProperty<GraphPolicy>;
22 const unsigned verticesCount;
24 BiStar(
const unsigned verticesCount) :
25 verticesCount(verticesCount) {
30 GraphDescription operator()(){
31 std::vector<VertexDescription> vertices(verticesCount);
33 std::vector<EdgeDescription> edges;
35 for(
unsigned i = 0; i < vertices.size(); ++i){
36 vertices.at(i) = std::make_pair(i, VertexProperty());
38 edges.push_back(std::make_pair(std::make_pair(vertices[i].first, vertices[0].first), EdgeProperty()));
39 edges.push_back(std::make_pair(std::make_pair(vertices[0].first, vertices[i].first), EdgeProperty()));
44 return std::make_pair(vertices,edges);
Definition: BiStar.hpp:13