Given a non-oriented graph G = (V, E), we consider the function w: E → R +, called the cost function, which assigns a numerical value to each edge.
It is required to determine a subgraph that includes all the nodes and a part of the edges, so that the subgraph determined to have the tree structure (linked and acyclic) and the sum of the edges of the edges forming it is minimally possible. The subgraph with the above properties will be called the minimum cover tree for the given graph.
9 freelancer menawar dengan rata-rata $48 untuk pekerjaan ini
I am student of IIT Bombay. I am expert in algorithms . I can easily do the task for you .I have written many codes of such type . currently i come under world top 100 hundred programmer in spoj