root/spinoffs/Dijkstar/setup.py

Revision 1007, 1.6 KB (checked in by wyatt, 4 years ago)

Added guest login to SVN URLs

Line 
1from setuptools import setup, find_packages
2
3setup(
4    name='Dijkstar',
5    version='1.0',
6    description='Dijkstra/A* path finding functions',
7    long_description="""
8Dijkstar
9++++++++
10
11Dijkstar is an implementation of Dijkstra's single-source shortest-paths
12algorithm. If a destination node is given, the algorithm halts when that node
13is reached; otherwise it continues until paths from the source node to all
14other nodes are found.
15
16Accepts an optional cost (or "weight") function that will be called on every
17iteration.
18
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
21heuristic function converts Dijkstra to A* (and this is where the name
22"Dijkstar" comes from).
23
24Performance is decent on a graph with 100,000+ nodes. Runs in around .5
25seconds on average .
26
27See the source for the required graph structure:
28
29https://guest:guest@svn.byCycle.org/spinoffs/Dijkstar
30
31Latest development version:
32
33https://guest:guest@svn.byCycle.org/spinoffs/Dijkstar#egg=Dijkstar-dev
34
35    """,
36    license='BSD/MIT',
37    author='Wyatt L Baldwin, byCycle.org',
38    author_email='wyatt@byCycle.org',
39    keywords='Dijkstra A* algorithms',
40    url='http://wyattbaldwin.com/',
41    classifiers=[
42        'Development Status :: 3 - Alpha',
43        'Intended Audience :: Developers',
44        'License :: OSI Approved :: BSD License',
45        'License :: OSI Approved :: MIT License',
46        'Natural Language :: English',
47        'Programming Language :: Python',
48        ],
49    packages=find_packages(),
50    zip_safe=False,
51    install_requires=(),
52    test_suite = 'nose.collector',
53)
Note: See TracBrowser for help on using the browser.