[jgrapht-users] proposal for algorithm interface

[Michael B. <beh...@us...>]

Hi,
after a long time of inactivity I finally got around to add some of my
graph algorithms together with a proposal for a general algorithm
interface to my jgrapht branch
https://github.com/behrisch/jgrapht/tree/approxalg/jgrapht-core/src/main/java/org/jgrapht/experimental/alg
Before submitting a pull request I would very much like to hear
comments on the code. The algorithm interface gives mainly a
distinction between exact and approximation algorithms and an easy way
to retrieve results / bounds. Furthermore I added an
IntArrayGraphAlgorithm which comes handy when trying to port "naive"
implementations of algorithms using int[][] representations of graphs
to jgrapht and maybe useful to others as well.

Not all algorithms are finally tested yet, I propose you look at
coloring and clique finding first.

Best regards,
Michael