Major refactoring. Moved the individual implementations of graphs mostly into...

Major refactoring. Moved the individual implementations of graphs mostly into the base Abstract graph class as read only and seperated out implementations as restricing writing for immutable version or implementing methods to manipulate topology. Several classes and interfaces were renamed. Refactored graphicalmodel package classes to use generics.

src/com/syncleus/core/dann/examples/hyperassociativemap/visualization/SimpleGraph.java

@@ -21,7 +21,7 @@ package com.syncleus.core.dann.examples.hyperassociativemap.visualization;
 import com.syncleus.dann.graph.*;
 import java.util.*;
 
-public class SimpleGraph extends AbstractBidirectedGraph<SimpleNode, BidirectedEdge<SimpleNode>>
+public class SimpleGraph extends AbstractBidirectedAdjacencyGraph<SimpleNode, BidirectedEdge<SimpleNode>>
 {
 	final private SimpleNode[][] nodes;
 	final private Set<SimpleNode> nodeSet = new HashSet<SimpleNode>();

src/com/syncleus/core/dann/examples/pathfind/WeightedGrid.java

@@ -25,7 +25,7 @@ import java.util.*;
  * A 2D mesh with individual weights for nodes and edges.  Each node is linked to its four neighbors by weighted undirected edges.
  * @author seh
  */
-public class WeightedGrid extends AbstractBidirectedGraph<GridNode, SimpleWeightedUndirectedEdge<GridNode>>
+public class WeightedGrid extends AbstractBidirectedAdjacencyGraph<GridNode, SimpleWeightedUndirectedEdge<GridNode>>
 {
 
     private final GridNode[][] nodes;