Now not using ORDER BY in nodes and edges queries, was useless and slowing down queries
Now reading correctly empty graphs, just keeping it empty without throwing exception

Memory leak problem is gone with rewrite in jung! Now genDbGraph/genGraph work without needing an external shell script to do the loop. Thus removing runGenDbGraph.sh

Now Pdb constructors don't load data but rather intialise the pdbCode, loading occurs upon call of load(pdbChainCode,modelSerial)
New methods getChains() and getModels() in all Pdb classes
New Exception PdbLoadError
New tester for getChains and getModels: testGetChains
Changed all calls to Pdb construction accordingly (includes changing excpetions)

AAInfo
-isValidContactType, isValidSingleAtomContactType, isValidMultipleAtomContactType takes into account the directionality, the overlapping atoms and the "+"
-isOverlapping method has been added

AIGEdge
-copy method added

AIGNode
-equals and copy methods has been added

AIGraph
-getRIGraph now takes argument directed and directionality doesn't depend anymore on isCrossed
-distances are now set for RIGNodes in getRIGraph
-for undirected, crossed graphs we take care not to add parallel RIGedges in getRIGraph
-we set now the secondaryStructure object of RIGraph in getRIGraph
-addGraph has been added

Box
-we throw away wrong check in getDistancesWithinBox - read the comment

DbRIGraph
-constructors now take argument directed and directionality doesn't depend anymore on isCrossed
-distances are read also from db and set for RIGEdges

Pdb
-get_graph now takes as argument directed and directionality doesn't depend anymore on isCrossed
-there is check for forbidden cts in get_graph
-cts with + are taken into account in get_graph

RIGEdge
-setAtomWeight and setDistance methods have been added

RIGNode
-equals method has been added

RIGraph
-getObsLength has been deleted
-we take care now of the new cts (+,undirected crossed), of null secondary structure case and of distances in write_graph_to_db and write_graph_to_db_fast

genDbGraph
-argument for directionality is now added

an abstract getter

Reverted to unobserved RIGNodes not present in the RIGraph

Changed behaviour of observed/unobserved nodes in RIGraph: now unobserved RIGnodes are also in the RIGraph, tagged with observed=false.
Thus getObsLength() in ProtStructGraph (which by the way was not working for AIGraphs) is now only in RIGraph and adapted to the new way of tagging unobserved nodes.
New method hasSequence() in ProtStrucGraph and Pdb: it is important to know that from now only if hasSequence()==true we put the unobserved nodes in RIGraph, otherwise we don't put them (as before)

Added more comments

Fixed bug: was not working with crossed contacts (with "/") because the "/" was not allowed in file names. Now replacing / with :

Fixed tester after changes in getAllCommonNnhSizes

Fixed bug: was missing last sequence element when adding gap nodes

Fixed bug in PairwiseAlignmentGraphConverter: was not adding the nodes for gaps, also some other minor bugs fixed in copying of objects
Fixed bug in getAllCommonNbhSizes, 1) now returning a HashMap on 
Pair<Integer>, not Pair<RIGNode> 2) was filling cells when size=0
Added method getIncidentNodes to IntPairSet as a temporary fix

Now PairWiseAlignmentConverter and PairwiseAlignmentGraphConverter work in the new JUNG framework.
New class IntPairComparator
Now sorting output in RIGraph.write_graph_to_file

Added last i/o method from old Graph (write to file in Ioannis network format)
Using now the more correct degree, indegree, outdegree methods instead of count neighbor methods
Fixed the write_graph_to_file method name in executables in default package

New methods in RIGraph copy() and compare(other)
Basic testing of copy introduced on testJUNGframework

Now selection string stuff working: transfered methods from old NodeSet to Interval as static methods.

Now graph generation in Pdb also works when we pass a crossed contact type with overlapping atom sets, e.g. ALL/BB (changes were: added a couple of new conditions in Box and in Pdb's AIGraph getGraph(ct,cutoff))
Loads of better comments

First implementation of the new graph framework using JUNG2. Still a few classes to fix, but all basic functionality is there.
NOTE: at the moment ProtStructGraph is a SparseGraph which doesn't guarantee that the graph has no parallel or loop edges (I thought that would be solved by using the SimpleGraph interface but it doesn't, that's only a marker interface)

Re-branching for JUNG2 development

Deleted the branch, we are going to branch from a newer revision

Branching for development of new graph framework using JUNG2

Initial import of tools