[prev in list] [next in list] [prev in thread] [next in thread] 

List:       kde-edu
Subject:    Rocs general graph layout implementation question.
From:       Dilson_Guimarães <dilsonguim () gmail ! com>
Date:       2020-06-01 12:23:07
Message-ID: CAHw8pqzmyWrTc_0oa3OibvkXCGqCxQSxr3kZZbbobbJehwz=mQ () mail ! gmail ! com
[Download RAW message or body]

Hello,

I am a GSoC student working on the graph layout (drawing) capabilities of
Rocs <https://kde.org/applications/education/org.kde.rocs>. I am going to
include graph layout algorithms to compute the positions for all the graph
vertices, satisfying some constraints such as keeping every vertex inside
the drawing area. I have two options here: use an existing library to do
that or implement the algorithms directly. Because I am new here, I thought
it would be a good idea to ask for your opinion. What option do you think
is more appropriate? Even if there is no clear answer, I would like get
your opinion about the pros and cons of each option. I am providing more
information about each option below.

The graph layout algorithms I would have to implement are optimization
algorithms, which I have some experience with because I do research on
optimization. A positive thing about implementing the algorithms myself is
that I would have more flexibility to make them better suited for Rocs.
Besides that, on future phases of this GSoC project, I will implement graph
layout algorithms for specific kinds of graph. For those, I did not find a
library ready for use.

On the other hand, going with the library can speed things up. I found one
library that seems to provide a good amount of functionality. Its name is
libcola <https://www.adaptagrams.org/documentation/libcola.html> and its
GitHub repository can be found here
<https://github.com/mjwybrow/adaptagrams>. Maybe there are some issues
about adding more dependencies.

Thank you,
Dilson Guimar=C3=A3es.

[Attachment #3 (text/html)]

<div dir="ltr"><div>Hello,</div><div><br></div><div>I am a <span class="" style="" \
id=":1eh.12" tabindex="-1">GSoC</span> student working on the graph layout (drawing) \
capabilities of <a href="https://kde.org/applications/education/org.kde.rocs"><span \
class="" style="" id=":1eh.13" tabindex="-1">Rocs</span></a>. I am going to include \
graph layout algorithms to compute the positions for all the graph <span class="" \
style="" id=":1eh.14" tabindex="-1">vertices</span>, satisfying some constraints such \
as keeping every vertex inside the drawing area. I have two options here: use an \
existing library to do that or implement the algorithms directly. Because I am new \
here, I thought it would be a good idea to ask for your opinion. What option do you \
think is more appropriate? Even if there is no clear answer, I would like get your \
opinion about the pros and cons of each option. I am providing more information about \
each option below.</div><div><br></div><div>The graph layout algorithms I would have \
to implement are optimization algorithms, which I have some experience with because I \
do research on optimization. A positive thing about implementing the algorithms \
myself is that I would have more flexibility to make them better suited for <span \
class="" style="" id=":1eh.15" tabindex="-1">Rocs</span>. Besides that, on future \
phases of this <span class="" style="" id=":1eh.16" tabindex="-1">GSoC</span> \
project, I will implement graph layout algorithms for specific kinds of graph. For \
those, I did not find a library ready for use.<br></div><div><br></div><div>On the \
other hand, going with the library can speed things up. I found one library that \
seems to provide a good amount of functionality. Its name is <a \
href="https://www.adaptagrams.org/documentation/libcola.html"><span class="" style="" \
id=":1eh.17" tabindex="-1">libcola</span></a> and its <span class="" style="" \
id=":1eh.18" tabindex="-1">GitHub</span> repository can be found <a \
href="https://github.com/mjwybrow/adaptagrams">here</a>. Maybe there are some issues \
about adding more dependencies.<br></div><div><br></div><div>Thank \
you,</div><div><span class="" style="" id=":1eh.19" tabindex="-1">Dilson</span> <span \
class="" style="" id=":1eh.20" \
tabindex="-1">Guimarães</span>.<br></div><div><br></div></div>



[prev in list] [next in list] [prev in thread] [next in thread]