python-graph 1.8.2 released

2012-07-15 Thread Pedro Matiello
python-graph 
release 1.8.2
http://code.google.com/p/python-graph/ 
 

python-graph is a library for working with graphs in Python. 

This software provides a suitable data structure for representing 
graphs and a whole set of important algorithms. 

The code is appropriately documented and API reference is generated 
automatically by epydoc. 

Provided features and algorithms: 

* Support for directed, undirected, weighted and non-weighted graphs
* Support for hypergraphs
* Canonical operations
* XML import and export
* DOT-Language output (for usage with Graphviz)
* Random graph generation

* Accessibility (transitive closure)
* Breadth-first search
* Critical path algorithm
* Cut-vertex and cut-edge identification
* Cycle detection
* Depth-first search
* Gomory-Hu cut-tree algorithm
* Heuristic search (A`*` algorithm)
* Identification of connected components
* Maximum-flow / Minimum-cut (Edmonds-Karp algorithm)
* Minimum spanning tree (Prim's algorithm)
* Mutual-accessibility (strongly connected components)
* Pagerank algorithm
* Shortest path search (Dijkstra's algorithm)
* Shortest path search (Bellman-Ford algorithm)
* Topological sorting
* Transitive edge identification

Download: http://code.google.com/p/python-graph/downloads/list

Installing:

If you have easy_install on your system, you can simply run: 
# easy_install python-graph-core

And, optionally, for Dot-Language support: 
# easy_install python-graph-dot
-- 
http://mail.python.org/mailman/listinfo/python-announce-list

Support the Python Software Foundation:
http://www.python.org/psf/donations/


Luminescence v. 0.3 released

2010-12-17 Thread Pedro Matiello
Luminescence
release 0.3
http://code.google.com/p/luminescence/


Luminescence is an application for generating HTML presentations from
Markdown sources. It allows one to create simple presentations quickly.

An small example of what it can do is here:
http://dl.dropbox.com/u/1823095/luminescence/tutorial.html

New in this release: support for UTF-8 files and fade-in/out effects.

Installing: easy_install luminescence


-- 
http://mail.python.org/mailman/listinfo/python-announce-list

Support the Python Software Foundation:
http://www.python.org/psf/donations/


Luminescence v. 0.2 released

2010-12-15 Thread Pedro Matiello
Luminescence
release 0.2
http://code.google.com/p/luminescence/


Luminescence is an application for generating HTML presentations from
Markdown sources. It allows one to create simple presentations quickly.

An small example of what it can do is here:
http://dl.dropbox.com/u/1823095/luminescence/tutorial.html

Installing: easy_install luminescence

-- 
http://mail.python.org/mailman/listinfo/python-announce-list

Support the Python Software Foundation:
http://www.python.org/psf/donations/


python-graph 1.8.0 released

2010-10-02 Thread Pedro Matiello
python-graph 
release 1.8.0
http://code.google.com/p/python-graph/ 
 

python-graph is a library for working with graphs in Python. 

This software provides a suitable data structure for representing 
graphs and a whole set of important algorithms. 

The code is appropriately documented and API reference is generated 
automatically by epydoc. 

Provided features and algorithms: 

 * Support for directed, undirected, weighted and non-weighted graphs
 * Support for hypergraphs
 * Canonical operations
 * XML import and export
 * DOT-Language output (for usage with Graphviz)
 * Random graph generation

 * Accessibility (transitive closure)
 * Breadth-first search
 * Critical path algorithm
 * Cut-vertex and cut-edge identification
 * Cycle detection
 * Depth-first search
 * Gomory-Hu cut-tree algorithm
 * Heuristic search (A`*` algorithm)
 * Identification of connected components
 * Maximum-flow / Minimum-cut (Edmonds-Karp algorithm)
 * Minimum spanning tree (Prim's algorithm)
 * Mutual-accessibility (strongly connected components)
 * Pagerank algorithm
 * Shortest path search (Dijkstra's algorithm)
 * Shortest path search (Bellman-Ford algorithm)
 * Topological sorting
 * Transitive edge identification

This release introduces the Pagerank algorithm and Gomory-Hu cut-tree
algorithm.

Download: http://code.google.com/p/python-graph/downloads/list
(tar.bz2, zip and sdist packages are available.)

Installing:

If you have easy_install on your system, you can simply run: 
# easy_install python-graph-core

And, optionally, for Dot-Language support: 
# easy_install python-graph-dot


-- 
http://mail.python.org/mailman/listinfo/python-announce-list

Support the Python Software Foundation:
http://www.python.org/psf/donations/


python-graph-1.7.0 released

2010-03-21 Thread Pedro Matiello
python-graph 
release 1.7.0
http://code.google.com/p/python-graph/ 
 

python-graph is a library for working with graphs in Python. 

This software provides a suitable data structure for representing 
graphs and a whole set of important algorithms. 

The code is appropriately documented and API reference is generated 
automatically by epydoc. 

Provided features and algorithms: 

 * Support for directed, undirected, weighted and non-weighted graphs
 * Support for hypergraphs
 * Canonical operations
 * XML import and export
 * DOT-Language import and export
 * Random graph generation

 * Accessibility (transitive closure)
 * Breadth-first search
 * Critical path algorithm
 * Cut-vertex and cut-edge identification
 * Cycle detection
 * Depth-first search
 * Heuristic search (A`*` algorithm)
 * Identification of connected components
 * Maximum-flow / Minimum-cut (Edmonds-Karp algorithm)
 * Minimum spanning tree (Prim's algorithm)
 * Mutual-accessibility (strongly connected components)
 * Shortest path search (Dijkstra's algorithm)
 * Shortest path search (Bellman-Ford algorithm)
 * Topological sorting
 * Transitive edge identification

This release introduces Bellman-Ford shortest path algorithm and
Edmonds-Karp maximum-flow/minimum-cut algorithm.

Download: http://code.google.com/p/python-graph/downloads/list
(tar.bz2, zip and sdist packages are available.)

Installing:

If you have easy_install on your system, you can simply run: 
# easy_install python-graph-core

And, optionally, for Dot-Language support: 
# easy_install python-graph-dot


-- 
http://mail.python.org/mailman/listinfo/python-announce-list

Support the Python Software Foundation:
http://www.python.org/psf/donations/


python-graph-1.6.3 released

2009-12-14 Thread Pedro Matiello
python-graph 
release 1.6.3
http://code.google.com/p/python-graph/ 
 

python-graph is a library for working with graphs in Python. 

This software provides a suitable data structure for representing 
graphs and a whole set of important algorithms. 

The code is appropriately documented and API reference is generated 
automatically by epydoc. 

Provided features and algorithms: 

 * Support for directed, undirected, weighted and non-weighted graphs
 * Support for hypergraphs
 * Canonical operations
 * XML import and export
 * DOT-Language output (for usage with Graphviz)
 * Random graph generation

 * Accessibility (transitive closure)
 * Breadth-first search
 * Critical path algorithm 
 * Cut-vertex and cut-edge identification 
 * Depth-first search
 * Heuristic search (A* algorithm)
 * Identification of connected components
 * Minimum spanning tree (Prim's algorithm)
 * Mutual-accessibility (strongly connected components)
 * Shortest path search (Dijkstra's algorithm)
 * Topological sorting
 * Transitive edge identification 

The 1.6.x series is our refactoring series. Along the next releases,
we'll change the API so we can better prepare the codebase to new
features. If you want a softer, directed transition, upgrade your code
to every release in the 1.6.x series. On the other hand, if you'd
rather fix everything at once, you can wait for 1.7.0.

This release adds Python 3.x compatibility.

Download: http://code.google.com/p/python-graph/downloads/list
(tar.bz2, zip and sdist packages are available.)

Installing:

If you have easy_install on your system, you can simply run: 
# easy_install python-graph-core

And, optionally, for Dot-Language support: 
# easy_install python-graph-dot


-- 
http://mail.python.org/mailman/listinfo/python-announce-list

Support the Python Software Foundation:
http://www.python.org/psf/donations/


python-graph-1.6.2 released

2009-10-01 Thread Pedro Matiello
python-graph 
release 1.6.2
http://code.google.com/p/python-graph/ 
 

python-graph is a library for working with graphs in Python. 

This software provides a suitable data structure for representing 
graphs and a whole set of important algorithms. 

The code is appropriately documented and API reference is generated 
automatically by epydoc. 

Provided features and algorithms: 

 * Support for directed, undirected, weighted and non-weighted graphs
 * Support for hypergraphs
 * Canonical operations
 * XML import and export
 * DOT-Language output (for usage with Graphviz)
 * Random graph generation

 * Accessibility (transitive closure)
 * Breadth-first search
 * Critical path algorithm 
 * Cut-vertex and cut-edge identification 
 * Depth-first search
 * Heuristic search (A* algorithm)
 * Identification of connected components
 * Minimum spanning tree (Prim's algorithm)
 * Mutual-accessibility (strongly connected components)
 * Shortest path search (Dijkstra's algorithm)
 * Topological sorting
 * Transitive edge identification 

The 1.6.x series is our refactoring series. Along the next releases,
we'll change the API so we can better prepare the codebase to new
features. If you want a softer, directed transition, upgrade your code
to every release in the 1.6.x series. On the other hand, if you'd
rather fix everything at once, you can wait for 1.7.0.

Download: http://code.google.com/p/python-graph/downloads/list
(tar.bz2, zip and egg packages are available.)

Installing:

If you have easy_install on your system, you can simply run: 
# easy_install python-graph-core

And, optionally, for Dot-Language support: 
# easy_install python-graph-dot

-- 
http://mail.python.org/mailman/listinfo/python-announce-list

Support the Python Software Foundation:
http://www.python.org/psf/donations/


python-graph-1.6.1 released

2009-07-05 Thread Pedro Matiello
python-graph 
release 1.6.1
http://code.google.com/p/python-graph/ 
 

python-graph is a library for working with graphs in Python. 

This software provides a suitable data structure for representing 
graphs and a whole set of important algorithms. 

The code is appropriately documented and API reference is generated 
automatically by epydoc. 

Provided features and algorithms: 

 * Support for directed, undirected, weighted and non-weighted graphs
 * Support for hypergraphs
 * Canonical operations
 * XML import and export
 * DOT-Language output (for usage with Graphviz)
 * Random graph generation

 * Accessibility (transitive closure)
 * Breadth-first search
 * Critical path algorithm 
 * Cut-vertex and cut-edge identification 
 * Depth-first search
 * Heuristic search (A* algorithm)
 * Identification of connected components
 * Minimum spanning tree (Prim's algorithm)
 * Mutual-accessibility (strongly connected components)
 * Shortest path search (Dijkstra's algorithm)
 * Topological sorting
 * Transitive edge identification 

The 1.6.x series is our refactoring series. Along the next releases,
we'll change the API so we can better prepare the codebase to new
features. If you want a softer, directed transition, upgrade your code
to every release in the 1.6.x series. On the other hand, if you'd
rather fix everything at once, you can wait for 1.7.0.

Download: http://code.google.com/p/python-graph/downloads/list
(tar.bz2, zip and egg packages are available.)

Installing:
If you have easy_install on your system, you can simply run: 
# easy_install python-graph


-- 
http://mail.python.org/mailman/listinfo/python-announce-list

Support the Python Software Foundation:
http://www.python.org/psf/donations/


python-graph-1.6.0 released

2009-06-07 Thread Pedro Matiello
python-graph 
release 1.6.0
http://code.google.com/p/python-graph/ 
 

python-graph is a library for working with graphs in Python. 

This software provides a suitable data structure for representing 
graphs and a whole set of important algorithms. 

The code is appropriately documented and API reference is generated 
automatically by epydoc. 

Provided features and algorithms: 

 * Support for directed, undirected, weighted and non-weighted graphs
 * Support for hypergraphs
 * Canonical operations
 * XML import and export
 * DOT-Language output (for usage with Graphviz)
 * Random graph generation

 * Accessibility (transitive closure)
 * Breadth-first search
 * Critical path algorithm 
 * Cut-vertex and cut-edge identification 
 * Depth-first search
 * Heuristic search (A* algorithm)
 * Identification of connected components
 * Minimum spanning tree (Prim's algorithm)
 * Mutual-accessibility (strongly connected components)
 * Shortest path search (Dijkstra's algorithm)
 * Topological sorting
 * Transitive edge identification 

The 1.6.x series is our refactoring series. Along the next releases,
we'll change the API so we can better prepare the codebase to new
features. If you want a softer, directed transition, upgrade your code
to every release in the 1.6.x series. On the other hand, if you'd
rather fix everything at once, you can wait for 1.7.0.

Download: http://code.google.com/p/python-graph/downloads/list
(tar.bz2, zip and egg packages are available.)

Installing:
If you have easy_install on your system, you can simply run: 
# easy_install python-graph


-- 
http://mail.python.org/mailman/listinfo/python-announce-list

Support the Python Software Foundation:
http://www.python.org/psf/donations.html


python-graph-1.5.0 released

2009-05-04 Thread Pedro Matiello
python-graph 
release 1.5.0
http://code.google.com/p/python-graph/ 
 

python-graph is a library for working with graphs in Python. 

This software provides a suitable data structure for representing 
graphs and a whole set of important algorithms. 

The code is appropriately documented and API reference is generated 
automatically by epydoc. 

Provided features and algorithms: 

 * Support for directed, undirected, weighted and non-weighted graphs
 * Support for hypergraphs
 * Canonical operations
 * XML import and export
 * DOT-Language output (for usage with Graphviz)
 * Random graph generation

 * Accessibility (transitive closure)
 * Breadth-first search
 * Critical path algorithm 
 * Cut-vertex and cut-edge identification 
 * Depth-first search
 * Heuristic search (A* algorithm)
 * Identification of connected components
 * Minimum spanning tree (Prim's algorithm)
 * Mutual-accessibility (strongly connected components)
 * Shortest path search (Dijkstra's algorithm)
 * Topological sorting
 * Transitive edge identification 

Changes in this release:
  * Added Critical Path Algorithm and Transitive Edge Identification;
  * A few bugs were fixed. 

Download: http://code.google.com/p/python-graph/downloads/list
(tar.bz2, zip and egg packages are available.)

Installing:
If you have easy_install on your system, you can simply run: 
# easy_install python-graph


--
http://mail.python.org/mailman/listinfo/python-announce-list

Support the Python Software Foundation:
http://www.python.org/psf/donations.html


python-graph-1.4.2 released

2009-02-23 Thread Pedro Matiello
python-graph 
release 1.4.2
http://code.google.com/p/python-graph/ 
 

python-graph is a library for working with graphs in Python. 

This software provides a suitable data structure for representing 
graphs and a whole set of important algorithms. 

The code is appropriately documented and API reference is generated 
automatically by epydoc. 

Provided features and algorithms: 

 * Support for directed, undirected, weighted and non-weighted graphs
 * Support for hypergraphs
 * Canonical operations
 * XML import and export
 * DOT-Language output (for usage with Graphviz)
 * Random graph generation

 * Accessibility (transitive closure)
 * Breadth-first search
 * Cut-vertex and cut-edge identification 
 * Depth-first search
 * Heuristic search (A* algorithm)
 * Identification of connected components
 * Minimum spanning tree (Prim's algorithm)
 * Mutual-accessibility (strongly connected components)
 * Shortest path search (Dijkstra's algorithm)
 * Topological sorting

Changes in this release:
  * Fixed an infinite recursion bug in the cycle detection algorithm.

Download: http://code.google.com/p/python-graph/downloads/list
(tar.bz2, zip and egg packages are available.)

Installing:
If you have easy_install on your system, you can simply run: 
# easy_install python-graph


--
http://mail.python.org/mailman/listinfo/python-announce-list

Support the Python Software Foundation:
http://www.python.org/psf/donations.html


python-graph-1.4.0 released

2009-02-07 Thread Pedro Matiello
python-graph 
release 1.4.0
http://code.google.com/p/python-graph/ 
 

python-graph is a library for working with graphs in Python. 

This software provides a suitable data structure for representing 
graphs and a whole set of important algorithms. 

The code is appropriately documented and API reference is generated 
automatically by epydoc. 

Provided features and algorithms: 

 * Support for directed, undirected, weighted and non-weighted graphs
 * Support for hypergraphs
 * Canonical operations
 * XML import and export
 * DOT-Language output (for usage with Graphviz)
 * Random graph generation

 * Accessibility (transitive closure)
 * Breadth-first search
 * Cut-vertex and cut-edge identification 
 * Depth-first search
 * Heuristic search (A* algorithm)
 * Identification of connected components
 * Minimum spanning tree (Prim's algorithm)
 * Mutual-accessibility (strongly connected components)
 * Shortest path search (Dijkstra's algorithm)
 * Topological sorting

Changes in this release:
  * Added A* algorithm;
  * Filtered DFS and BFS.

Download: http://code.google.com/p/python-graph/downloads/list
(tar.bz2 and zip packages are available.)

--
http://mail.python.org/mailman/listinfo/python-announce-list

Support the Python Software Foundation:
http://www.python.org/psf/donations.html


python-graph-1.3.0 released

2008-09-28 Thread Pedro Matiello
python-graph 
release 1.3.0 
http://code.google.com/p/python-graph/ 
 

python-graph is a library for working with graphs in Python. 

This software provides a suitable data structure for representing 
graphs and a whole set of important algorithms. 

The code is appropriately documented and API reference is generated 
automatically by epydoc. 

Provided features and algorithms: 

  * Support for directed, undirected, weighted and non-weighted graphs 
  * Support for hypergraphs 
  * Canonical operations 
  * XML import and export 
  * DOT-Language output (for usage with Graphviz) 
  * Random graph generation 
  * Accessibility (transitive closure) 
  * Breadth-first search 
  * Cut-vertex and cut-edge identification 
  * Depth-first search 
  * Identification of connected components 
  * Minimum spanning tree (Prim's algorithm) 
  * Mutual-accessibility (strongly connected components) 
  * Shortest path (Dijkstra's algorithm)

Changes in this release:
  * Traversals
  * Faster node insertion
  * Some API changes

Download: http://code.google.com/p/python-graph/downloads/list


signature.asc
Description: This is a digitally signed message part
--
http://mail.python.org/mailman/listinfo/python-announce-list

Support the Python Software Foundation:
http://www.python.org/psf/donations.html


python-graph-1.2.0 released

2008-09-10 Thread Pedro Matiello
python-graph
release 1.2.0
http://code.google.com/p/python-graph/


python-graph is a library for working with graphs in Python. 

This software provides a suitable data structure for representing
graphs and a whole set of important algorithms. 

The code is appropriately documented and API reference is generated
automatically by epydoc. 

Comments, bug reports or suggestions are welcome. 

Provided features and algorithms: 

  * Support for directed, undirected, weighted and non-weighted graphs 
  * Support for hypergraphs 
  * Canonical operations 
  * XML import and export 
  * DOT-Language output (for usage with Graphviz) 
  * Random graph generation 
  * Accessibility (transitive closure) 
  * Breadth-first search 
  * Cut-vertex and cut-edge identification 
  * Depth-first search 
  * Identification of connected components 
  * Minimum spanning tree (Prim's algorithm) 
  * Mutual-accessibility (strongly connected components) 
  * Shortest path (Dijkstra's algorithm) 
  * Topological sorting


signature.asc
Description: This is a digitally signed message part
--
http://mail.python.org/mailman/listinfo/python-announce-list

Support the Python Software Foundation:
http://www.python.org/psf/donations.html