Skip to content

A GHS algorithm (to compute Distributed Minimum Spanning Tree) implementation in Rust

Notifications You must be signed in to change notification settings

vaibspider/ghs-rust

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

43 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

GHS Algorithm implementation in Rust

Build command:

cargo build (for debug build) or cargo build --release

Run GHS:

./target/debug/ghs <input-file> (if using debug build) or ./target/release/ghs <input-file>

Input for GHS is a connected, undirected graph with unique edge weights.

Format for 'input-file':

See example file - input.

The first line is the number of nodes in the input graph.
Every line following the first line is an edge in the format - (nodeindex, nodeindex, weight).

About

A GHS algorithm (to compute Distributed Minimum Spanning Tree) implementation in Rust

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages