Changeset 1007 for spinoffs/Dijkstar

Show
Ignore:
Timestamp:
08/28/08 23:26:21 (4 years ago)
Author:
wyatt
Message:

Added guest login to SVN URLs

Files:
1 modified

Legend:

Unmodified
Added
Removed

  • spinoffs/Dijkstar/setup.py

    r1005 r1007  
    1515 
    1616Accepts an optional cost (or "weight") function that will be called on every 
    17 iteration.  
     17iteration. 
    1818 
    19 Also accepts an optional heuristic function that is used to push the algorithm  
    20 toward a destination instead of fanning out in every direction. Using such a  
     19Also accepts an optional heuristic function that is used to push the algorithm 
     20toward a destination instead of fanning out in every direction. Using such a 
    2121heuristic function converts Dijkstra to A* (and this is where the name 
    2222"Dijkstar" comes from). 
    2323 
    24 Performance is decent on a graph with 100,000+ nodes. Runs in around .5  
     24Performance is decent on a graph with 100,000+ nodes. Runs in around .5 
    2525seconds on average . 
    2626 
    2727See the source for the required graph structure: 
    2828 
    29 https://svn.byCycle.org/spinoffs/Dijkstar 
     29https://guest:guest@svn.byCycle.org/spinoffs/Dijkstar 
    3030 
    3131Latest development version: 
    3232 
    33 https://svn.byCycle.org/spinoffs/Dijkstar#egg=Dijkstar-dev 
     33https://guest:guest@svn.byCycle.org/spinoffs/Dijkstar#egg=Dijkstar-dev 
    3434 
    3535    """,