GitHub - mlbright/edmonds: Edmonds / Chu-Liu algorithm for minimum spanning tree in a digraph

This repository has been archived by the owner on Jul 28, 2021. It is now read-only.

mlbright / edmonds Public archive

Notifications You must be signed in to change notification settings
Fork 20
Star 31

Edmonds / Chu-Liu algorithm for minimum spanning tree in a digraph

31 stars 20 forks Branches Tags Activity

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 5 Commits
doc/edmonds		doc/edmonds
edmonds		edmonds
README.txt		README.txt
setup.py		setup.py

Repository files navigation

Overview
========

This is a python implementation of Chu-Liu/Edmond's algorithm
to find the minimum spanning tree in a directed graph.

Usage
=====

import edmonds

# Below, g is graph representation of minimum spanning tree
# root is the starting node of the MST, and G is the input graph
g = edmonds.mst(root,G)

References
==========

* http://en.wikipedia.org/wiki/Edmonds's_algorithm
* http://algowiki.net/wiki/index.php/Edmonds's_algorithm (The java code from this is
in the 'doc' directory.)

Build
=====

$ python setup.py sdist
or
$ python setup.py bdist_rpm