Recent changes to Home

Home modified by Philipp Hülsdunk

Philipp Hülsdunk — Tue, 23 Apr 2013 10:11:37 -0000

--- v13
+++ v14
@@ -11,6 +11,6 @@

 Spargel includes [algorithms] to perform on a given graph. These are written using the general [interfaces] of spargel and accept mostly as parameters the graph, vertices or edges and the vertice or edge maps.

-The [util] package provides helpers like traversal or vertice joining. In this package are also [wrappers] for graphs, vertice and edge maps included. Those will then allow creating sub-graph views or modified view of maps (also for vertice and edge maps) or other collections.
+The [util] package provides helpers like traversal or vertice joining. In this package are also wrappers for graphs, vertice and edge maps included. Those will then allow creating sub-graph views or modified view of maps (also for vertice and edge maps) or other collections.

 For a quick introduction see the [Using] and/or [FAQ] section.

Home modified by Philipp Hülsdunk

Philipp Hülsdunk — Tue, 23 Apr 2013 10:03:41 -0000

--- v12
+++ v13
@@ -11,8 +11,6 @@

 Spargel includes [algorithms] to perform on a given graph. These are written using the general [interfaces] of spargel and accept mostly as parameters the graph, vertices or edges and the vertice or edge maps.

-The [util] package provides small helpers like traversal or vertice joining.
-
-We will soon provide [wrappers] for graphs, vertice and edge maps. Those will then allow tasks such as creating sub-graph views or even an edge mapping that calculates the length between two vertices given the coordinate mapping of the vertices.
+The [util] package provides helpers like traversal or vertice joining. In this package are also [wrappers] for graphs, vertice and edge maps included. Those will then allow creating sub-graph views or modified view of maps (also for vertice and edge maps) or other collections.

 For a quick introduction see the [Using] and/or [FAQ] section.

Home modified by Philipp Hülsdunk

Philipp Hülsdunk — Wed, 03 Apr 2013 17:55:58 -0000

--- v11
+++ v12
@@ -11,6 +11,8 @@

 Spargel includes [algorithms] to perform on a given graph. These are written using the general [interfaces] of spargel and accept mostly as parameters the graph, vertices or edges and the vertice or edge maps.

+The [util] package provides small helpers like traversal or vertice joining.
+
 We will soon provide [wrappers] for graphs, vertice and edge maps. Those will then allow tasks such as creating sub-graph views or even an edge mapping that calculates the length between two vertices given the coordinate mapping of the vertices.

 For a quick introduction see the [Using] and/or [FAQ] section.

Home modified by Philipp Hülsdunk

Philipp Hülsdunk — Wed, 03 Apr 2013 16:30:10 -0000

--- v10
+++ v11
@@ -1,12 +1,16 @@
 SPARGEL
 ========

-Welcome to the Sparse Graph Extension Library (SPARGEL) wiki!
+Spargel is a Java graph library providing mainpulation and operating on mathematical graphs. The main aim of this library is to provide a very small, type-safe yet powerful interface to various graphs. For this reason, there are not many implementations or various graph types, but vertice and edge properties of a graph are managed by a normal implementation of the Java Map interface. Hence, any given type can be assigned as an property of an edge or vertice, e.g. creating a mapping from an edge to a number creates a weighted graph.

-SPARGEL currently is a tiny collection of Java Graph interfaces for the MolBI group. It may grow into a small graph library in the future, we'll see. If you are looking for a full graph library, you should maybe have a look at JGraphT instead.
+The implementations of these vertice and egde maps are bounded to the graph class being used, which saves memory and cpu time compared to using for example a normal HashMap. At the moment spargel provides following graph classes included in the [datastructures] package:

-Atm, spargel allows us to share code like algorithms which compute graph properties (e.g., number of connected components, cluster coefficient, vertex degree distribution, ...) between different projects.
+* **AdjListGraph** implementing one adjecency list.
+* **BiAdjListGraph** implementing two adjecency lists, one for successors and another for predecessors.
+* **UAdjListGraph** implementing one adjecency list for an undirected graph

-This wiki will be used to provide the SPARGEL online documentation. Atm, there only is a tiny [FAQ].
+Spargel includes [algorithms] to perform on a given graph. These are written using the general [interfaces] of spargel and accept mostly as parameters the graph, vertices or edges and the vertice or edge maps.

-You should NOT use SPARGEL yet unless you are a SPARGEL developer. If you are, see the [Using] page for information on how to use SPARGEL.
+We will soon provide [wrappers] for graphs, vertice and edge maps. Those will then allow tasks such as creating sub-graph views or even an edge mapping that calculates the length between two vertices given the coordinate mapping of the vertices.
+
+For a quick introduction see the [Using] and/or [FAQ] section.

WikiPage Home modified by Philipp Hülsdunk

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

--- v9
+++ v10
@@ -9,12 +9,4 @@

 This wiki will be used to provide the SPARGEL online documentation. Atm, there only is a tiny [FAQ].

-You should NOT use SPARGEL yet unless you are a SPARGEL developer. If you are, see the [Using] page for information on how to setup SPARGEL.
-
-Spargel consists of five main packages: interfaces, datastructures, algorithms, readers and writers.
-The [interfaces] provides a general way to describe graphs as generics in both vertice and edge types. Also, the vertice and edges are recursive generics to each other. This allows a more type safe usage of graphs.
-In [datastructures] are generic classes provided to describe a way of presenting graphs in memory. Inheriting from these classes providing the generic classes for edges and vertices allows an easy extension to any graph type.
-The [algorithms] package is written also in a generic way: Any algorithm can be run on any implementation of a graph providing any underlying datastructure.
-The last two packages [readers] and [writers] are written as directors in a builder design pattern. The interfaces represent themself as builders, thus, any reader and writer can operate on any graph.
-
-
+You should NOT use SPARGEL yet unless you are a SPARGEL developer. If you are, see the [Using] page for information on how to use SPARGEL.

WikiPage Home modified by Philipp Hülsdunk

Philipp Hülsdunk — Mon, 18 Mar 2013 08:49:39 -0000

--- v8
+++ v9
@@ -11,5 +11,10 @@

 You should NOT use SPARGEL yet unless you are a SPARGEL developer. If you are, see the [Using] page for information on how to setup SPARGEL.

+Spargel consists of five main packages: interfaces, datastructures, algorithms, readers and writers.
+The [interfaces] provides a general way to describe graphs as generics in both vertice and edge types. Also, the vertice and edges are recursive generics to each other. This allows a more type safe usage of graphs.
+In [datastructures] are generic classes provided to describe a way of presenting graphs in memory. Inheriting from these classes providing the generic classes for edges and vertices allows an easy extension to any graph type.
+The [algorithms] package is written also in a generic way: Any algorithm can be run on any implementation of a graph providing any underlying datastructure.
+The last two packages [readers] and [writers] are written as directors in a builder design pattern. The interfaces represent themself as builders, thus, any reader and writer can operate on any graph.

WikiPage Home modified by Tim Schäfer

Tim Schäfer — Mon, 11 Mar 2013 11:43:33 -0000

--- v7
+++ v8
@@ -3,7 +3,7 @@

 Welcome to the Sparse Graph Extension Library (SPARGEL) wiki!

-SPARGEL currently is a tiny collection of Java Graph interfaces for the MolBI group. It may grow into a small graph library in the future, we'll see.
+SPARGEL currently is a tiny collection of Java Graph interfaces for the MolBI group. It may grow into a small graph library in the future, we'll see. If you are looking for a full graph library, you should maybe have a look at JGraphT instead.

 Atm, spargel allows us to share code like algorithms which compute graph properties (e.g., number of connected components, cluster coefficient, vertex degree distribution, ...) between different projects.

WikiPage Home modified by Tim Schäfer

Tim Schäfer — Fri, 08 Mar 2013 20:39:52 -0000

--- v6
+++ v7
@@ -7,7 +7,7 @@

 Atm, spargel allows us to share code like algorithms which compute graph properties (e.g., number of connected components, cluster coefficient, vertex degree distribution, ...) between different projects.

-This wiki will be used to provide the SPARGEL online documentation.
+This wiki will be used to provide the SPARGEL online documentation. Atm, there only is a tiny [FAQ].

 You should NOT use SPARGEL yet unless you are a SPARGEL developer. If you are, see the [Using] page for information on how to setup SPARGEL.

WikiPage Home modified by Tim Schäfer

Tim Schäfer — Thu, 07 Mar 2013 15:10:12 -0000

--- v5
+++ v6
@@ -12,5 +12,4 @@
 You should NOT use SPARGEL yet unless you are a SPARGEL developer. If you are, see the [Using] page for information on how to setup SPARGEL.

-[[project_admins]]

WikiPage Home modified by Tim Schäfer

Tim Schäfer — Tue, 26 Feb 2013 15:34:32 -0000

--- v4
+++ v5
@@ -9,7 +9,7 @@

 This wiki will be used to provide the SPARGEL online documentation.

-You should NOT use SPARGEL yet unless you are a SPARGEL developer. If you are, see the [[Using]] page.
+You should NOT use SPARGEL yet unless you are a SPARGEL developer. If you are, see the [Using] page for information on how to setup SPARGEL.

 [[project_admins]]