convert to driver/SPI for backing store in graphs.
implementing neo4j driver, and making adjustments for different traversal implementations, etc.
Adding logging, setup/teardown methods to tests, fixing Jung driver to filter terminal parents from traversals.
remove dbPath from driver, and rename evaluator to more sensible name.
rename neo4j driver to indicate that it's embedded, not REST-based.
moving more functionality (cycle handling, missing/variable ref handling, etc) to the driver, and fixing tests. Still need to figure out how to store / navigate cycles in the neo4j driver.
implement cycle storage in neo4j, add support for arbitrary string metadata on any project ref, and adjust graph/net/web to work better for transforms. Also, implement purely in-memory version of neo4j driver, based on the classes neo4j provides for unit testing (probably not a good idea to use in any real environment).
don't throw exception if graph doesn't exist, simply return a null.
fix NPE
fix another NPE
fix another NPE
Adding start for a driver TCK, adding a fixture for use in the neo4j tests, adding the notion of a globally backed driver as opposed to a one-off, and adding/modding methods to avoid traversing relationships in globally backed drivers when new graphs are created or graphs are connected to one another (which should be a VERY cheap operation in globally-backed drivers).
add transactions to cycle/metadata addition methods.
Adding interface for complex versions to provide common methods without having to check instanceof for each type, and refining the query methods for version types to figure out whether snapshots are allowed, a single version has been selected, etc.
loosen up the version parsing logic to allow 'snapshot' and the snapshot timestamp/buildnumber stuff up front...if it is up front, the new logic fragments it into either a string version part or a series of numeric version parts (doesn't consider it a snapshot, in other words).
Adding abstract typed filter and optimization code for neo4j drivers to (hopefully) reduce the number of throwaway edge observations we have to deal with.
debugging some problems with dep-tree printing traversal.
Optimizing traversal to minimize the time needed to traverse really large graphs with a lot of relationships we're not interested in. Restructuring the printing traversal to accumulate links and format them later, since paths may not be traversed in any kind of predictable order, depending on the graph driver.