Skip to content
/ primsAlgo Public

Java program to compute the Minimum Spanning Tree (MST) using Prim's Algorithm. The program reads an adjacency matrix from an input file, calculates the degree of each node, and displays the MST along with its total cost.

0 stars 0 forks Branches Tags Activity
Star
Notifications You must be signed in to change notification settings

tejb96/primsAlgo

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
src
src
 
 
README.md
README.md
 
 
graph.txt
graph.txt
 
 
runSS.jpg
runSS.jpg
 
 

Repository files navigation

Review Assignment Due Date

Assignment3

About

Java program to compute the Minimum Spanning Tree (MST) using Prim's Algorithm. The program reads an adjacency matrix from an input file, calculates the degree of each node, and displays the MST along with its total cost.

Topics

java graph-theory prims-algorithm adjacency-matrix minimum-spanning-tree

Resources

Readme
Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Contributors 2

  •  
  •  

Languages