disconnectionDPS example input

disconnectionDPS provides a variety of tools for constructing disconnectivity graphs from a database created by PATHSAMPLE. The original program was written by Mark Miller.

disconnectionDPS is distributed free of charge under the GPL as part of the current git software image from the group.

Example input

The example input provided here has been tested with the version of disconnectionDPS specified in the README file within each archive. If it no longer works with a more recent version, please inform a member of the Wales group.

LJ₃₈ example with coloured branches based on fastest paths. The colouring uses keyword NEWTRVAL, using paths calculated using DIJKSTRA in PATHSAMPLE. In this example KDISTINCTPATHS is used in PATHSAMPLE to generate the fastest five paths according to all three criteria programmed by Daniel. The post-processing requires auxiliary program Epath.to.TRVAL.f90 and the KDISTINCTPATHS examples need script KDP.Epath.to.tree.sh, both of which are in softwarewales in the DISCONNECT source directory. The resulting disconnectivity graphs are tree.KDP.n.ps in subdirectories KDPmoden. The dinfo file controls the coloured line width and the gray level of the branches for minima that are not on the pathway. The number of extra minima is controlled by the LOWEST keyword in dinfo, and changes for the different modes for illustration.
ZIF example with coloured branches. The example has output for both NEWTRVAL and NEWTRMIN colouring for a ZIF database. It illustrates the SQUEEZELEVEL, COLOURONLYMIN, DEFAULTCOLOUR, and COLOURFRONT keywords. The colouring scheme itself is not meaningful.
Example input to make a rainbow cololured disconnectivity graph provided by Nicy.
Example for a model four funnel landscape.

[Source] [Documentation]