[qrouter] 02/03: Updated README to 1.3.1

[Ruben Undheim]

This is an automated email from the git hooks/post-receive script.

rubund-guest pushed a commit to branch master
in repository qrouter.

commit 40a67f08440269323790ff5606b1346ded49f7f2
Author: Ruben Undheim <ruben.undheim at gmail.com>
Date:   Sun Sep 21 12:27:45 2014 +0200

    Updated README to 1.3.1
---
 README | 110 ++++++++++++++++++++++++++++++++++++-----------------------------
 1 file changed, 61 insertions(+), 49 deletions(-)

diff --git a/README b/README
index a1d6533..15c6a78 100644
--- a/README
+++ b/README
@@ -1,7 +1,7 @@
 -------------------------------------------------
-Qrouter version 1.2
+Qrouter version 1.3
 Detail netlist router for ASICs
-(c) 2013 by Tim Edwards
+(c) 2014 by Tim Edwards
 Released under Gnu Public License
 ----------------------------------------------
 
@@ -9,35 +9,42 @@ Released under Gnu Public License
 Release notes:
 ----------------------------------------------
 
-Version 1.0 First release.  This is work in
-progess on a professional-grade multi-layer
-maze router.  First release implements the
-standard Lee algorithm.  However, a modified
-Lee algorithm is used that presents all nodes
-of the network (other than the source node)
-as targets.  As each target node is reached,
-in order of lowest cost, the target node and
-its route to the source are added to the source
-node, and the process repeated until there are
-no more target nodes.
+Version 1.3
+------------
+Branch created September 16, 2014 mainly for
+the purpose of making the existing version 1.2
+the stable branch, particularly as version 1.2
+is required for qflow.
+
+Version 1.2
+------------
+Branch of 1.1 that puts qrouter in a Tcl/Tk
+environment and includes routines to generate
+and draw into a graphics window.  Code
+reorganized into three main sections that are
+called from the Tcl command line as "stage1",
+"stage2", and "write_def".  The front-end
+process of reading in the LEF and DEF files
+and configuring the routing environment will
+be added to the command set, eventually.
 
-The implementation is geometry-aware, to the
-extent that all node and obstruction geometry
-is present in the LEF file used to define the
-standard cell macros.
-
-The implementation uses the open standard
-LEF and DEF formats.  Standard cell definitions
-and routing layer definitions are read in from
-the LEF file, and cell placement information
-and an unrouted network are read from the DEF
-file.  Output is a copy of the original input
-DEF file, annotated with the physical routes.
+Based on analysis from the visualization of
+the router, the code has been rewritten to
+speed up the routing during multi-tap (more
+than 2 connections) nets, so that previous
+search results remain in place after each
+route, avoiding redundant searching.  This
+speeds up qrouter by a factor of about 2x.
+A masking function that limits routes
+to a specific defined portion of the layout
+speeds up qrouter by a factor of about 30x.
 
-Version 1.1 Second major release.  Revised the
-"proute" structure so that its position infor-
-mation refers to the position of the structure
-itself and not of the predecessor.  This requires
+Version 1.1
+------------
+Second major release.  Revised the "proute"
+structure so that its position information
+refers to the position of the structure itself
+and not of the predecessor.  This requires
 setting up proute structures for every point on
 the source net, but makes it possible to specify
 one or more alternate predecessors for each
@@ -63,27 +70,32 @@ to nets, not to nodes.  Added the ability to read
 in existing route geometry and add it to the
 database.
 
-Version 1.2 is a branch of 1.1 that puts
-qrouter in a Tcl/Tk environment and includes
-routines to generate and draw into a graphics
-window.  Code reorganized into three main
-sections that are called from the Tcl command
-line as "stage1", "stage2", and "write_def".
-The front-end process of reading in the LEF
-and DEF files and configuring the routing
-environment will be added to the command set,
-eventually.
+Version 1.0
+------------
+First release.  This is work in progess on a
+professional-grade multi-layer maze router.
+First release implements the standard Lee
+algorithm.  However, a modified Lee algorithm
+is used that presents all nodes of the network
+(other than the source node) as targets.  As
+each target node is reached, in order of lowest
+cost, the target node and its route to the
+source are added to the source node, and the
+process repeated until there are no more target
+nodes.
 
-Based on analysis from the visualization of
-the router, the code has been rewritten to
-speed up the routing during multi-tap (more
-than 2 connections) nets, so that previous
-search results remain in place after each
-route, avoiding redundant searching.  This
-speeds up qrouter by a factor of about 2x.
-A masking function that limits routes
-to a specific defined portion of the layout
-speeds up qrouter by a factor of about 30x.
+The implementation is geometry-aware, to the
+extent that all node and obstruction geometry
+is present in the LEF file used to define the
+standard cell macros.
+
+The implementation uses the open standard
+LEF and DEF formats.  Standard cell definitions
+and routing layer definitions are read in from
+the LEF file, and cell placement information
+and an unrouted network are read from the DEF
+file.  Output is a copy of the original input
+DEF file, annotated with the physical routes.
 
 ----------------------------------------------
 Compilation & installation:

-- 
Alioth's /usr/local/bin/git-commit-notice on /srv/git.debian.org/git/debian-science/packages/qrouter.git