In a given graph (network), where each node represents a single client and each node initially knows the weight for each edge incident to that node along with the neighboring vertices. Can we generate the minimum spanning tree of this network using Zookeeper?
-- View this message in context: http://zookeeper-user.578899.n2.nabble.com/Use-Zookeeper-to-generate-Minimum-Spanning-tree-tp7579155.html Sent from the zookeeper-user mailing list archive at Nabble.com.
