[Boost-users] [BGL] kruskal_minimum_spanning_tree

From: Cromwell Enage (sponage_at_[hidden])
Date: 2006-06-02 10:29:12

The following code used to work, but no longer does.

    typedef boost::adjacency_list<> G;
    typedef boost::graph_traits<G>::edge_descriptor E;
    G graph;
    std::vector<E> spanning_tree;
    boost::kruskal_minimum_spanning_tree(
        graph
      , std::back_inserter(spanning_tree)
    );

Somehow the concept checking became too restrictive,
and type E is now expected to be Assignable, which
currently doesn't seem to be the case.

Any fixes or workarounds?

                              Cromwell D. Enage

__________________________________________________
Do You Yahoo!?
Tired of spam?  Yahoo! Mail has the best spam protection around 
http://mail.yahoo.com