JGraphT currently lacks proper support for trees (i.e. simple, undirected, connected, acyclic graphs). Sure, all algorithms that work on undirected graphs will work on trees but in some cases, there may be a much more efficient option. Also, there are some classic tree-algorithms that are currently missing from the library. I plan to work on the following:

  • tree traversals
  • algorithms for computing lowest common ancestors in trees and DAGs
  • tree decompositions
  • AHU algorithm for deciding tree isomorphism
  • Prüfer encoding

Organization

Student

Alexandru Valeanu

Mentors

  • Joris Kinable
  • Dimitrios Michail
close

2018