Ticket #9012: CodeSample.cpp

// TestBGL.cpp : Defines the entry point for the console application.
//

#include <boost\graph\adjacency_list.hpp>
#include <boost\graph\prim_minimum_spanning_tree.hpp>

#include <boost\graph\graphviz.hpp>

using namespace std;

using namespace boost;



int _main(int argc, char* argv[])
{

        typedef boost::property<vertex_distance_t, int> VertexProperty;
        typedef boost::property<edge_weight_t, int> EdgeProperty;

        typedef adjacency_list<vecS, vecS, undirectedS, VertexProperty, EdgeProperty> Graph;

        typedef pair<int, int> Edge;

        Edge edges[] =          {Edge(0, 1), Edge(1, 2)};
        int weights[] =         {2, 1}; // this works: int weights[] =   {1, 2}; 

        Graph g(edges, edges + sizeof(edges)/sizeof(Edge), weights, 3);
        std::vector<Graph::vertex_descriptor> predecessors(num_vertices(g));
        prim_minimum_spanning_tree(g, &predecessors[0]);
}