Date view Thread view Subject view Author view

From: Matthew Galati (magh_at_[hidden])
Date: 2003-11-12 11:24:56

Is there a way to give an advanced start to solve Min Spanning Tree
using boost/graph? That is, I have a list of edges in my graph that must
be in the Min Spanning Tree (i.e., their cost is -M, for very big M).

Since algorithms for MST are greedy, I assume this can be done - but is
their an easy way to interface to boost/graph's MST algorithms?

Thanks for any help.
Matt 

-- 
Matthew Galati
ISE Lehigh University
IBM Service Parts Solutions
610.758.4042 (Office)
610.882.0779 (Home)
magh_at_[hidden], magal11_at_[hidden]
http://sagan.ie.lehigh.edu/mgalati/
Date view Thread view Subject view Author view