Metadata-Version: 1.0
Name: Dijkstar
Version: 1.0
Summary: Dijkstra/A* path finding functions
Home-page: http://wyattbaldwin.com/
Author: Wyatt L Baldwin, byCycle.org
Author-email: wyatt@byCycle.org
License: BSD/MIT
Description: 
        Dijkstar
        ++++++++
        
        Dijkstar is an implementation of Dijkstra's single-source shortest-paths
        algorithm. If a destination node is given, the algorithm halts when that node
        is reached; otherwise it continues until paths from the source node to all
        other nodes are found.
        
        Accepts an optional cost (or "weight") function that will be called on every
        iteration.
        
        Also accepts an optional heuristic function that is used to push the algorithm
        toward a destination instead of fanning out in every direction. Using such a
        heuristic function converts Dijkstra to A* (and this is where the name
        "Dijkstar" comes from).
        
        Performance is decent on a graph with 100,000+ nodes. Runs in around .5
        seconds on average .
        
        See the source for the required graph structure:
        
        https://guest:guest@svn.byCycle.org/spinoffs/Dijkstar
        
        Latest development version:
        
        https://guest:guest@svn.byCycle.org/spinoffs/Dijkstar#egg=Dijkstar-dev
        
        
Keywords: Dijkstra A* algorithms
Platform: UNKNOWN
Classifier: Development Status :: 3 - Alpha
Classifier: Intended Audience :: Developers
Classifier: License :: OSI Approved :: BSD License
Classifier: License :: OSI Approved :: MIT License
Classifier: Natural Language :: English
Classifier: Programming Language :: Python
