News about gs-algo

[guilhelm savin <guilhelm.savin AT gmail.com>]

Hi all,

This is just to tell you about some new features added

in gs-algo. These features are available in the git

repository of gs-algo.

1. Implementation of Ford-Fulkerson flow algorithm added

----------------------------------------------------------

Ford-Fulkerson algorithm is an algorithm to compute a

maximum flow in a graph. You can find more explanations

about this algorithm on Wikipedia.

Reference: Ford, L. R.; Fulkerson, D. R. (1956).

           "Maximal flow through a network".

           Canadian Journal of Mathematics 8: 399–404

Complexity: O(Ef), where E is the number of edges in the

            graph and f is the maximum flow in the graph

2. Connectivity measures added

----------------------------------------------------------

Class algorithm.measure.ConnectivityMeasure provides some

methods to compute vertex and edge connectivity. These

methods are :

- get{Vertex,Edge}Connectivity(Graph) : get the maximum k

  such that the graph is k-{vertex|edge}-connected.

- isK{Vertex|Edge}Connected(Graph,int) : check if the

  graph is k-{vertex|edge}-connected.

- getKDisconnecting{Vertex|Edge}Tuple(Graph,int) : get

  a k-tuple of node/edge such that removal of these elements

  disconnect the graph.

3. It is now possible to plot data using the Chart*Measure

----------------------------------------------------------

Chart*Measure allow to plot and make some statistics with

data. Plotting is done using the JFreeChart library and

statistics with the commons-math library from Apache.

Some examples are given on the GraphStream website.

This is a development version but feedbacks are always

welcome.

4. New measures degree and element count

----------------------------------------------------------

Not really impresive but this extends ChartMeasure and

allows to see the evolution of these measures with new

plotting features.

  

Regards.

--
Guilhelm Savin
PhD Student of Computer Science

LITIS, University of Le Havre
\/\/\/\/\/\/

http://litis.univ-lehavre.fr/~savin

http://d3-project.org
http://iscn.univ-lehavre.fr
http://graphstream-project.org
/\/\/\/\/\/\