...
- Implement Greedy Switch Heuristic for Crossing Minimization
The order of nodes in a layer determines the number of crossings and is computed during the crossing minimization step. The results can usually be further improved by switching the order of nodes around, which we currently lack proper algorithms for.Jira server KIELER JIRA columns key,summary,type,created,updated,due,assignee,reporter,priority,status,resolution serverId 2851bd34-0bf1-3f02-ab12-7d77ccab0fae key KIPRA-891 - Layering Algorithms
Implement an alternative algorithm for the layer assignment problem used in the layer-based approach to graph layout. - Integrate KIML with JGraph
Provide automatic layout through KIML for the JGraph diagram library and develop a simple JGraph-based graph editor to test the integration with.Jira showSummary true server KIELER JIRA columns key,summary,type,created,updated,due,assignee,reporter,priority,status,resolution serverId 2851bd34-0bf1-3f02-ab12-7d77ccab0fae key KIPRA-1214 - Improved Edge Label Placement
Our layout algorithm already supports the placement of edge labels. However, there's still room for improvement... - Implement a KlayJS adapter for D3.js
The D3.js library is a well-known and widely-used Javascript library for SVG-based visualizations and already comes with force-based graph layout algorithms. Implement an adapter that allows to use D3 with KlayJS.
Modeling Pragmatics
- Control Flow Graph Exploration / Visualization
Use pragmatics concepts (automatic layout, focus & context) for exploring/visualizing control flow graphs and specific paths, eg. as computed by OTAWA WCET analysis tool, eg. using Klighd. - OMG DD Format
Explore the mapping of KGraph / KRendering to the Diagram Definition format of the OMG.
...