Timeline for Is there a suitable algorithm to draw a mixed constituency/dependency graph in a coordinate system?
Current License: CC BY-SA 3.0
18 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 16, 2017 at 15:45 | history | edited | CommunityBot |
replaced http://meta.cstheory.stackexchange.com/ with https://cstheory.meta.stackexchange.com/
|
|
| Sep 19, 2012 at 22:52 | history | edited | Kaveh |
edited tags; edited tags
|
|
| Aug 17, 2012 at 16:37 | comment | added | vzn | ??? all the tools cited are not proprietary afaik | |
| Jul 18, 2012 at 15:06 | answer | added | vzn | timeline score: 1 | |
| Jul 18, 2012 at 14:37 | comment | added | s.d | @vzn: Thanks. I'd had a look at the reference you mention before, and it points towards proprietary software, which I cannot use. I've edited my question following your suggestion. | |
| Jul 18, 2012 at 14:34 | history | edited | s.d | CC BY-SA 3.0 |
Added explanation about using GEF and why Graphviz is not an option.
|
| Jul 7, 2012 at 17:35 | comment | added | vzn | Q has no mention of editing & but in comment you turn down graphviz & seem to indicate you want to edit it with GEF. GEF is a general visual editing framework/API on which other "plugins" can build on. you seem to want a default graph layout by an algorithm which you can then revise. suggest you edit your question to reflect that. by the way believe graphviz can be used to generate coordinates which can then feed into a graph editor. re GEF graph editing see eg professional graph layout for GEF | |
| Jun 29, 2012 at 7:35 | history | tweeted | twitter.com/#!/StackCSTheory/status/218608509355425792 | ||
| Jun 29, 2012 at 7:01 | comment | added | Marzio De Biasi | @s.d: although your description is detailed, perhaps a picture of a real representative graph can help to answer your question. P.S. did you try a survey on the subject? | |
| S Jun 29, 2012 at 6:12 | history | suggested | Joshua Herman |
Added ref request tag
|
|
| Jun 29, 2012 at 5:19 | review | Suggested edits | |||
| S Jun 29, 2012 at 6:12 | |||||
| Jun 28, 2012 at 16:55 | comment | added | s.d | @SureshVenkat They can go between (nodes, tokens), (tokens, tokens) and (nodes, nodes). | |
| Jun 28, 2012 at 16:23 | comment | added | Suresh Venkat | Do non-hierarchical edges go between (nodes, tokens), or are they limited to tokens only ? | |
| Jun 28, 2012 at 16:19 | comment | added | s.d | @SureshVenkat: Yes, thanks for clarifying. | |
| Jun 28, 2012 at 16:15 | comment | added | Suresh Venkat | It sounds like the OP is looking for an algorithm (or a problem formulation that captures the specification) | |
| Jun 28, 2012 at 10:22 | comment | added | s.d | @DaveClarke: Thanks. I'm aware of Graphviz being able to do this. Unfortunately it doesn't seem that there's currently no possibility out there to use Graphviz with an editor based on the [Eclipse Graphical Editing Framework](www.eclipse.org/gef). Hence I'm looking for an actual algorithm. Unless somebody knows how to plug/port Graphviz to GEF of course :). | |
| Jun 28, 2012 at 10:14 | comment | added | Dave Clarke | Do you need an algorithm or an existing tool? Graphviz (graphviz.org) can do this. You specify the graph, possibly some formatting options (for different kinds of nodes and edges) and the tool will output a reasonably rendered graph. | |
| Jun 28, 2012 at 10:06 | history | asked | s.d | CC BY-SA 3.0 |