- Forum
- General C++ Programming
- Graph and MST
Graph and MST
Hi guys.I need your help.I have a homework about graph and minumum spaning tree
homework is suppose for a given graph G1,we have computedv a minumum spanning tree T1.Now ,a new edge to G1 is added.We call this new graph with the added edge G2.Describe an algorithm to compute the minumum spanning tree T2 OF G2 efficiently by jut adjusting T1.
homework is suppose for a given graph G1,we have computedv a minumum spanning tree T1.Now ,a new edge to G1 is added.We call this new graph with the added edge G2.Describe an algorithm to compute the minumum spanning tree T2 OF G2 efficiently by jut adjusting T1.
Last edited on
Topic archived. No new replies allowed.