Skip to content
/ GraphMST Public

Minimum/Maximum Spanning Tree (MST) algorithm for directed and undirected graphs

Notifications You must be signed in to change notification settings

asad/GraphMST

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 
 
 

Repository files navigation

README.txt
Overview
=========================
Finding MST in molecular graphs
=========================
* This is a Java implementation of Chu-Liu/Edmond's algorithm
to find the minimum spanning tree in a directed graph.
* Kosaraju's algorithm finds strongly-connected components in a directed graph.
* Tarjan's algorithm is a slightly faster variation on this.

=====
Usage
=====
Please refer to test cases

======
Depends
======

CDK-core classes

==========
References
==========

* http://en.wikipedia.org/wiki/Edmonds's_algorithm
* http://algowiki.net/wiki/index.php/Edmonds's_algorithm
* http://algowiki.net/wiki/index.php?title=Kruskal%27s_algorithm
* http://algowiki.net/wiki/index.php?title=Kosaraju%27s_algorithm

About

Minimum/Maximum Spanning Tree (MST) algorithm for directed and undirected graphs

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages