The ShortestPathProblems package

[Tags:bsd3, library, test]

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


[Skip to Readme]

Properties

Versions 0.0.0.1
Change log changelog.md
Dependencies ADPfusion (==0.5.2.*), ADPfusionSet (==0.0.0.*), base (>=4.7 && <5.0), FormalGrammars (==0.3.1.*), log-domain (>=0.11), PrimitiveArray (==0.8.0.*), text (>=1.0), vector (>=0.10) [details]
License BSD3
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 repository head: git clone git://github.com/choener/ShortestPathProblems
Uploaded Mon Mar 6 20:03:12 UTC 2017 by ChristianHoener
Distributions NixOS:0.0.0.1
Downloads 44 total (10 in the last 30 days)
Votes
0 []
Status Docs available [build log]
Last success reported on 2017-03-06 [all 1 reports]
Hackage Matrix CI

Modules

[Index]

Flags

NameDescriptionDefaultType
debugEnable bounds checking and various other debug operations at the cost of a significant performance penalty.DisabledManual
debugoutputEnable debug output, which spams the screen full of index informationDisabledManual

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

Readme for ShortestPathProblems

Readme for ShortestPathProblems-0.0.0.1

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/