Suvi: Project Status

Known problems

There are no significant bugs known at the moment.

Please let us know of any undocumented problems you discover.

Ideas for future development

• Optimize the network-simplex implementation.
• Introduce an attribute interface for setting node ports.
• Support edge labels.
• Make the core functionality of the testing application directly callable from Java programs, so that multiple regression tests can be performed without restarting the Java virtual machine each time.
• Extend the rendering abilities of the testing application to make it into a useful graph visualization utility.
• New policies:
  • Component layout
    • Non-linear component layout policies.
  • Node ranking
    • Decorators that make the graph acyclic before passing it to the underlying ranking policy.
  • Node ordering
    • For ordered trees such as binary search trees.
    • Improve the heuristic policy.
    • The O(2^n) branch-and-cut algorithm.
  • Node positioning
    • For trees.
    • Improve the heuristic policy.
    • Optimize the optimal policy based on network-simplex.
    • Allow the node positioning policy to ask how much space the edge routing policy needs for routing edges.
  • Edge routing
    • Taking the available space into account.
    • Using splines.
    • Using right-angled lines.

Contributions

such as

• new layout policies,
• improvements to existing policies,
• constructive feedback, and
• success stories,

will be appreciated and acknowledged! CVS write access is generally granted to developers who are willing to integrate and maintain major contributions to Suvi.

We generally recommend that you contact us before starting to develop major contributions.