prims and krushkal dont' work for directed graphs
On Tue, Jun 22, 2010 at 6:44 AM, Gene wrote:
> On Jun 20, 7:48 am, jalaj jaiswal wrote:
> > give an algo to find a minimum spanning tree of a directed graph ??
> >
> > --
> > With Regards,
> > Jalaj Jaiswal
> > +919026283397
> > B.TECH IT
> > II
On Jun 20, 7:48 am, jalaj jaiswal wrote:
> give an algo to find a minimum spanning tree of a directed graph ??
>
> --
> With Regards,
> Jalaj Jaiswal
> +919026283397
> B.TECH IT
> IIIT ALLAHABAD
Kruskal's algorithm:
Remove all the edges in the graph. Re-insert them in ascending order
of weight,
