GraphMST/README at master · asad/GraphMST · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
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