Smallest sum of graph weight, where each node are connceted (like a network)
Posted
by Svisstack
on Stack Overflow
See other posts from Stack Overflow
or by Svisstack
Published on 2010-04-25T23:38:32Z
Indexed on
2010/04/25
23:43 UTC
Read the original article
Hit count: 241
algorithm
Hello,
What algorithm I can use for problem like this:
Have a graph positive weighted, i want to know a smallest possible sum of weights where each node are connected (connected like a network, where each node is a eg. network device).
In this network each node can be connected with other node by some other other nodes in way. But all nodes from input graph must be in a network.
Any one can help me with this?
© Stack Overflow or respective owner
