ShortestPathProblems: grammars for TSP and SHP

[ bsd3, data, library ] [ Propose Tags ]

Grammars and default implementations for the shortest Hamiltonian path and Travelling Salesman problems.


[Skip to Readme]

Flags

Manual Flags

NameDescriptionDefault
debug

Enable bounds checking and various other debug operations at the cost of a significant performance penalty.

Disabled
debugoutput

Enable debug output, which spams the screen full of index information

Disabled

Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info

Downloads

Maintainer's Corner

For package maintainers and hackage trustees

Candidates

  • No Candidates
Versions [RSS] 0.0.0.1
Change log changelog.md
Dependencies ADPfusion (>=0.5.2 && <0.5.3), ADPfusionSet (>=0.0.0 && <0.0.1), base (>=4.7 && <5.0), FormalGrammars (>=0.3.1 && <0.3.2), log-domain (>=0.11), PrimitiveArray (>=0.8.0 && <0.8.1), text (>=1.0), vector (>=0.10) [details]
License BSD-3-Clause
Copyright Christian Hoener zu Siederdissen, 2016
Author Christian Hoener zu Siederdissen, 2016
Maintainer choener@bioinf.uni-leipzig.de
Category Data
Home page https://github.com/choener/ShortestPathProblems
Bug tracker https://github.com/choener/ShortestPathProblems/issues
Source repo head: git clone git://github.com/choener/ShortestPathProblems
Uploaded by ChristianHoener at 2017-03-06T20:03:12Z
Distributions NixOS:0.0.0.1
Downloads 1037 total (5 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2017-03-06 [all 1 reports]

Readme for ShortestPathProblems-0.0.0.1

[back to package description]

Build Status

ShortestPathProblems

Grammars for shortest Hamiltonian path and Travelling Salesman problems.

Contact

Christian Hoener zu Siederdissen
Leipzig University, Leipzig, Germany
choener@bioinf.uni-leipzig.de
http://www.bioinf.uni-leipzig.de/~choener/