Debugged ZigzagPersistence (having added heavier consistency checking) * Added DEBUG_CONTAINERS option (uses std::__debug::* containers for chains and in ZigzagPersistence) * Added SizeStorage specialization for std::deque<T> * ZigzagPersistence got a lot more consistency checking (in debug mode only, which now crawls); as a result it's been debugged (running on non-trivial examples) * examples/rips/rips-zigzag takes command-line options * added ChainWrapper::clear() * added Simplex::VertexDimensionComparison * added PairwiseDistances class (for computing distances between points in a container according to a distance functor)

From: Dmitriy Morozov <morozov@cs.duke.edu>
Date: Thu, 21 Feb 2008 04:23:29 -0500
State: fixed
Subject: More elabroate domain in avida-landscape
Message-Id: <91986229a564f7e0-0-artemis@metatron>

Try minimum spanning tree (i.e., take only negative edges from avida-distance).
Try a combination: all edges up to a certain (realtively small) length + MST.