Recent changes to interfaces

interfaces modified by Philipp Hülsdunk

Philipp Hülsdunk — Wed, 03 Apr 2013 17:39:22 -0000

--- v3
+++ v4
@@ -0,0 +1,4 @@
+Interfaces
+==========
+
+The simpliest graph interface is Graph<V, E> where V and E are extending the Vertice<V, E> and Edge<V, E> interfaces. All three interfaces take the vertice and edge interfaces as generic parameter. The clue behind this is that the [datastructures] will be therefore typesafe to their implementation of these interfaces: An edge implementation will always return the corresponding vertice implementation on its methods.

WikiPage interfaces modified by Philipp Hülsdunk

Philipp Hülsdunk — Thu, 21 Mar 2013 16:25:59 -0000

--- v2
+++ v3
@@ -1,17 +0,0 @@
-Interfaces provide a way to access a graph. Implementations of them are in [datastructures].
-All interfaces are parameterized in two generics - the vertice and the edge type.
-
-Graph
-=====
-
-This interface allows access to all vertices. Inherit from this class to provide a datastructure for a graph. This also includes inheriting a vertice and edge type.
-
-Edge
-====
-
-The simpliest edge interface allows access to its end vertices. Extended interface is WeightedInterface for providing a weight to the edge. Edges can have properties if the MetaHolder interface will be implemented.
-
-Vertice
-=======
-
-Allows only access to its predecessors. To provide access to the predecessors implement the BidirectionalVertice. BidirectionalVertice is extended to the UndirectedVertice to provide an undirected graph. GeometricVertice allows an implementation of an geometric graph. Also, if MetaHolder will be implemented a vertice can have properties.

WikiPage interfaces modified by Philipp Hülsdunk

Philipp Hülsdunk — Mon, 18 Mar 2013 10:14:36 -0000

--- v1
+++ v2
@@ -1 +1,17 @@
-The main advantage of spargel is that it provides general ways to describe a graph. Interfaces are written as a builder design pattern. Thus, they can create edges and vertices for themself. Also, inheritance from interfaces will provide the user the possibility to describe how to represent a graph in memory.
+Interfaces provide a way to access a graph. Implementations of them are in [datastructures].
+All interfaces are parameterized in two generics - the vertice and the edge type.
+
+Graph
+=====
+
+This interface allows access to all vertices. Inherit from this class to provide a datastructure for a graph. This also includes inheriting a vertice and edge type.
+
+Edge
+====
+
+The simpliest edge interface allows access to its end vertices. Extended interface is WeightedInterface for providing a weight to the edge. Edges can have properties if the MetaHolder interface will be implemented.
+
+Vertice
+=======
+
+Allows only access to its predecessors. To provide access to the predecessors implement the BidirectionalVertice. BidirectionalVertice is extended to the UndirectedVertice to provide an undirected graph. GeometricVertice allows an implementation of an geometric graph. Also, if MetaHolder will be implemented a vertice can have properties.

WikiPage interfaces modified by Philipp Hülsdunk

Philipp Hülsdunk — Mon, 18 Mar 2013 09:32:02 -0000

The main advantage of spargel is that it provides general ways to describe a graph. Interfaces are written as a builder design pattern. Thus, they can create edges and vertices for themself. Also, inheritance from interfaces will provide the user the possibility to describe how to represent a graph in memory.