[prev in list] [next in list] [prev in thread] [next in thread] 

List:       jakarta-commons-dev
Subject:    [Graph] Missing algorithms
From:       Oliver Kopp <koppdev () gmail ! com>
Date:       2013-05-31 15:34:53
Message-ID: CAA55TJon+ZjbJTDqEL73JHy58s7+fZB7xS_oS+tJMHCV-uaOvw () mail ! gmail ! com
[Download RAW message or body]

Dear Bruno,

> He's willing to contribute to commons-graph too. Do you know if there's any \
> algorithm that would be easier to implement and that no one is working on porting \
> to commons-graph ATM, please?

I'm not tracking a list of who is porting which algorithm to
commons-graph. I think, that should be tracked in JIRA at
https://issues.apache.org/jira/browse/SANDBOX-458, possibly as sub
tasks :)

What is not in the list, missing and IMHO easy to implement is "A
Simple, Fast Dominance Algorithm by Cooper, Keith  D.  and Harvey,
Timothy  J.  and Kennedy, Ken".

There is an GPL implementation based on JGraphT
(com.jopdesign.wcet.graphutils.Dominators<V, E>), but I'm currently
not finding the source itself. Since Apache does not want to be
infected by GPL code, it might be better to "just" implement the paper
> )

Cheers,

Oliver

---------------------------------------------------------------------
To unsubscribe, e-mail: dev-unsubscribe@commons.apache.org
For additional commands, e-mail: dev-help@commons.apache.org


[prev in list] [next in list] [prev in thread] [next in thread]