Path: csiph.com!usenet.pasdenom.info!news.albasani.net!feeder.erje.net!newsfeed.xs4all.nl!newsfeed5.news.xs4all.nl!xs4all!post.news.xs4all.nl!not-for-mail Return-Path: X-Original-To: python-announce-list@python.org Delivered-To: python-announce-list@mail.python.org X-Spam-Status: OK 0.006 X-Spam-Evidence: '*H*': 0.99; '*S*': 0.00; 'python.': 0.02; 'algorithm': 0.03; 'output': 0.04; 'subject:released': 0.07; 'api': 0.09; 'subject:python': 0.11; 'library': 0.15; 'easy_install': 0.16; 'received:192.168.0.194': 0.16; 'received:209.85.161.174': 0.16; 'run:': 0.16; 'sorting': 0.16; 'documented': 0.17; 'import': 0.21; 'algorithms.': 0.22; 'to:2**1': 0.23; 'random': 0.24; 'connected': 0.24; 'components': 0.27; 'tree': 0.27; 'download:': 0.29; 'url:code': 0.29; 'code': 0.31; 'system,': 0.32; 'structure': 0.32; 'to:no real name:2**1': 0.32; 'operations': 0.33; 'received:google.com': 0.34; 'minimum': 0.34; 'path': 0.35; 'received:192.168.0': 0.35; 'received:209.85': 0.35; 'message-id:@gmail.com': 0.36; 'generation': 0.36; 'xml': 0.37; '(for': 0.37; 'received:209': 0.37; 'data': 0.37; 'to:addr:python.org': 0.39; 'release': 0.39; 'received:192': 0.39; 'received:192.168': 0.40; 'subject:-': 0.40; 'header:Received:5': 0.40; 'your': 0.60; 'header:Message-Id:1': 0.62; 'export': 0.62; 'url:p': 0.63; 'to:addr:python-announce-list': 0.65; 'canonical': 0.91; 'support:': 0.91 DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20120113; h=from:content-type:content-transfer-encoding:subject:date:message-id :to:mime-version:x-mailer; bh=HJLPgaGp1wqty/kSS2mGm2ZGB1mKPgngfEkC/xgV2B0=; b=r3QhXfkQm4BIphuBpCmqlkOt6fk+WHw425jCf587tMecJV4sm3wl0M5USBYLLpGLXt RHelsuxG5nJXT7dRouMondJ0ENIyJIQ4aEKCcnZZZXXR9nAk5ZQ1NyOPdw5RRmU8caa3 H1LCmM++bW/BWgXGY8cDkBhh2cOAiynDB1tOPMlOMy8iJyz8mJCWlNlPvANKSVWnReOE Z80FK+B9MzK7JolYWmtrdz+lBgR+y/w0G0bH5JfVhzwXA5zXGJC20GIvX55A61JlGW5k tffoVSsKXNltD+xHDhVGVp4nS/QNrsndgCdBhPPnowc6Y6yYEGgTbUSf/7a7cZ08tQKF Ww7w== From: Pedro Matiello Content-Type: text/plain; charset=utf-8 Content-Transfer-Encoding: quoted-printable Subject: python-graph 1.8.2 released Date: Sat, 14 Jul 2012 18:46:20 -0300 To: python-graph@googlegroups.com, python-announce-list@python.org Mime-Version: 1.0 (Apple Message framework v1278) X-Mailer: Apple Mail (2.1278) X-Mailman-Approved-At: Mon, 16 Jul 2012 01:23:40 +0200 X-BeenThere: python-announce-list@python.org X-Mailman-Version: 2.1.12 Precedence: list Reply-To: python-list@python.org List-Id: Announcement-only list for the Python programming language List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , Approved: python-announce-list@python.org Newsgroups: comp.lang.python.announce Message-ID: Lines: 51 NNTP-Posting-Host: 2001:888:2000:d::a6 X-Trace: 1342394622 news.xs4all.nl 6945 [2001:888:2000:d::a6]:58225 X-Complaints-To: abuse@xs4all.nl Xref: csiph.com comp.lang.python.announce:622 python-graph=20 release 1.8.2 http://code.google.com/p/python-graph/=20 ------------------------------------------------------------------------=20= python-graph is a library for working with graphs in Python.=20 This software provides =EF=BB=BFa suitable data structure for = representing=20 graphs and a whole set of important algorithms.=20 The code is appropriately documented and API reference is generated=20 automatically by epydoc.=20 Provided features and algorithms:=20 * 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:=20 # easy_install python-graph-core And, optionally, for Dot-Language support:=20 # easy_install python-graph-dot=