I'm trying to implement a distributed minimum spanning tree using GHS algorithm in Rust.
You can see my code at: code
I'm using petgraph for storing a graph.
Node is the custom type I've created. It consists of behaviour needed for each thread.
I want to assign a Node to each thread and call node.initialize() method in each thread (for now).
Each thread also needs access to the created graph and references to all the nodes to communicate with them using channels.
I'm finding it difficult to manage these concurrent accesses.
I would be very grateful to you, if you could suggest a better way to model this situation in Rust.
This topic was automatically closed 90 days after the last reply. New replies are no longer allowed.