GSoC/2020/StatusReports/DilsonGuimaraes: Difference between revisions
Dilsonguim (talk | contribs) No edit summary |
Dilsonguim (talk | contribs) No edit summary |
||
| Line 5: | Line 5: | ||
The goal of this project is to enable Rocs (https://kde.org/applications/education/rocs) to layout graphs automatically. The project consists of three parts. The first one deals with a layout algorithm that can be applied to any graph. The second part and the third part deal with layout algorithms for trees and directed acyclic graphs, respectively. | The goal of this project is to enable Rocs (https://kde.org/applications/education/rocs) to layout graphs automatically. The project consists of three parts. The first one deals with a layout algorithm that can be applied to any graph. The second part and the third part deal with layout algorithms for trees and directed acyclic graphs, respectively. | ||
The original proposal can be found | The original proposal can be found [https://docs.google.com/document/d/e/2PACX-1vSwr9MB5rLbrUmzXdRBjPMNPoe-hc_eY85f0KKME8oz7wR0tTAaFMzRSkGVWMiyV7XxlRmQjsKUf8nI/pub here]. | ||
== Work Report == | == Work Report == | ||
Revision as of 23:14, 26 July 2020
Project Overview
Project name: Better Graph Layout for the Graph Theory IDE
The goal of this project is to enable Rocs (https://kde.org/applications/education/rocs) to layout graphs automatically. The project consists of three parts. The first one deals with a layout algorithm that can be applied to any graph. The second part and the third part deal with layout algorithms for trees and directed acyclic graphs, respectively.
The original proposal can be found here.
Work Report
Added features
I created a tool to apply layout algorithms to graphs in Rocs. This tool allows the user to select an algorithm and apply it to a graph. Algorithm specific parameters can also be selected. My GSoC proposal included three kinds of layout algorithms, one for each part of the coding phase. The current state of their implementations is shown next.
Implemented layout algorithms
The layout algorithms in this section are already implemented, tested and documented.
- Force based layout: A graph layout algorithm based on the simulation of forces acting on nodes.
- Radial tree layout: A graph layout algorithm specifically designed for trees.
Layout algorithms to be implemented in the future
The layout algorithms in this section will be implemented during the remaining time of the project.
- A layout algorithm for Directed Acyclic Graphs.
Merge requests
All my commits can the found in the following merge request.
First version of the graph-layout-plugin (Work in progress)
Blog
My blog can be found here.. The links to posts related to this project are given below: