Page 4 of 8. Showing 73 results (0.02 seconds)
Layer Sweep Crossing Minimization
Crossing minimization is hard to get right and hard to understand once written. Case in point is our layer sweep crossing minimizer, that implements layer sweep crossing minimization in a monolithic bunch of some 1,200 lines of gloriously hard-to-understand code. (at the time of writing) A new structure is requiredDevelopment in branches
In the KIELER project we use Git. We like Git. We want to get the maximum out of Git. We want branches, many branches. Branches? Yes, branches! This shows the KIELER branching scheme. If you want to know whatever the different classes of branches do, check Source Code Management. branches.png Why and how to useDownloads
Overview Get news on new releases by subscribing to the KIELER mailing list https://lists.informatik.uni-kiel.de/mailman/listinfo/rt-kieler. splash.png All download packages available on this page are subject to the Eclipse Public License (EPL) http://www.eclipse.org/org/documents/epl-v10.html. FurtherProject Progress: A SyncChart-Editor based on Yakindu
Agenda Get familiar with Yakindu SCT Start: September 2012 wah: Reverse Engineering A comparison between KIELER SyncCharts and YAKINDU SCT (graphical representation) Start: October 2012 Generating a comparison table to show the difference between the KIELER SyncCharts and YAKINDU SCT graphical representationThe API of KWebS
. For example, if you use a KGraph model, you could do it like the following listing shows: // Retrieve the graph model somehow KNode graph = ... // Get the layout … = ... // Get the models XMI notation String source = modelToXmi(graph); // Create the options list List<GraphLayoutOption> options = new ArrayList<GraphLayoutOptionThe KRendering Notation Model
the visual representation of a KGraph structure. Therefor an individual KRendering gets attached to each KGraph element defining its appearance. A full … with creating diagrams, we have to install the necessary plugins into our Eclipse IDE. The easiest way getting the latest release is downloading it from the KIELER gitArchitecture
corresponding page. As mentioned before, Mr. Tree runs on that data structure. After execution of the tree algorithm, the TGraph gets reconverted to a KGraph in a graphSOAP-based Service
= ... // Call the "graphLayout" operation of the service. As result you get the // serial notation of the layouted graph in the same serial notationLEGO Mindstorms with leJOS and SCCharts
to be installed. On Ubuntu you can do this by using sudo apt-get install libusb-dev. Furthermore, to use USB connection, a java library has to be compiled via ant. To do this perform cd /path/to/leJOS/build and start ant. If the ant build tool is not installed on your system, you can do so via sudo apt-get install ant. WindowsProject Guidelines
into chaos and certain oblivion. If you're following the Getting Started guide, you've already encountered some of the guidelines, disguised as settings … a review process, designed to have other people look at your code and suggest improvements as well as learn from it. Take the opportunity to get some valuable