graph-drawing

Right to left edges in dot (Graphviz)

淺唱寂寞╮ 提交于 2019-12-04 08:52:00
问题 I'm trying to display edges going from right to left (i.e. backwards) using dot: C <- A -> B The best I could do was: digraph { a -> b; c -> a [dir="back"]; {rank=same;c a b} } ..which is fine, except I don't like using c -> a when the edge is directed the other way. So I wanted to share this solution (which didn't seem to be mentioned on SO) and check if I'm missing something obvious. See: http://www.graphviz.org/doc/info/attrs.html#k:dirType 回答1: I have no alternative to your usage of dir,

Improving graphviz layout

老子叫甜甜 提交于 2019-12-03 09:57:05
I have perfection paralysis when it comes to producing something graphic. If symmetries of the visual have not been fully explored, I have a harder time comprehending what is going on. I am a very visual learner as well, and I LOVE to simplify things that I just learned and draw them on paper. Graphviz is a nice tool to draw thing automatically, but it could be better. Let's start with an example of a good graph )a state machine rather). Never mind the quality (it can be redrawn with a better tool) this one is almost perfect, except that I would turn it counter-clockwise 45 degrees to make the

What algorithms are good for interactive/realtime graph-drawing?

别来无恙 提交于 2019-12-03 03:58:24
What algorithms are good for interactive/realtime graph-drawing for live data and direct-manipulation? Failing that - what libraries do you use to draw graphs? Suggestions; Prefuse information-visualization toolkit any others? BTW- I mean graphs in the graph-theory sense - points and lines any language by live I mean the graph should be manipulatable once on screen. I would recommend any library that Jeff Heer has worked on: D3 Protovis Flare Prefuse I believe all three projects are open source. Jeff Heer is pretty good at referencing papers in his code at least in the Prefuse library. Looking

Right to left edges in dot (Graphviz)

喜你入骨 提交于 2019-12-03 01:05:53
I'm trying to display edges going from right to left (i.e. backwards) using dot: C <- A -> B The best I could do was: digraph { a -> b; c -> a [dir="back"]; {rank=same;c a b} } ..which is fine, except I don't like using c -> a when the edge is directed the other way. So I wanted to share this solution (which didn't seem to be mentioned on SO) and check if I'm missing something obvious. See: http://www.graphviz.org/doc/info/attrs.html#k:dirType I have no alternative to your usage of dir, but i can make it slightly shorter, if you want horizontal alignment, use the rankdir property of graph, to

Capture Google Maps Polyline On Click (Per Start/End)

眉间皱痕 提交于 2019-12-02 00:05:32
问题 Description I am currently working with Google Maps V3 for our client and they've asked us to implement a drawing tool that will allow them to create connected stream of lines and calculate the distance. However, it seems the Google Maps V3 Drawing Manager library is very limited in how it allows us to capture the click events for a polyline. Our Code google.maps.event.addListener(map, 'click', function(event){ //TODO: Store lat/long of click for distance calculation later }); google.maps

Capture Google Maps Polyline On Click (Per Start/End)

女生的网名这么多〃 提交于 2019-12-01 22:38:22
Description I am currently working with Google Maps V3 for our client and they've asked us to implement a drawing tool that will allow them to create connected stream of lines and calculate the distance. However, it seems the Google Maps V3 Drawing Manager library is very limited in how it allows us to capture the click events for a polyline. Our Code google.maps.event.addListener(map, 'click', function(event){ //TODO: Store lat/long of click for distance calculation later }); google.maps.event.addListener(drawingManager, 'overlaycomplete', function(e) { //TODO: Display the total distance of

JavaFX Transition animation waiting

主宰稳场 提交于 2019-12-01 01:44:06
so quicky, I am doing program which demonstrate methods used for computer graph drawing. I need to create timeline or history of actions like ( placeVertex(x,y), moveVertex(newX,newY) etc. ) and iterate through (forward and backwards, automatically or manual) I already achieved that by using command design pattern but few of these commands are using transitions. First idea was to use Condition interface's lock, await and signal in setOnFinished between each commands but it led to gui freezing. I tryed SequentialTransition but it's no use for my problem - can't change properties dynamically

Drawing Directed Acyclic Graphs: Minimizing edge crossing?

跟風遠走 提交于 2019-11-30 12:44:28
问题 Laying out the verticies in a DAG in a tree form (i.e. verticies with no in-edges on top, verticies dependent only on those on the next level, etc.) is rather simple without graph drawing algorithms such as Efficient Sugiyama. However, is there a simple algorithm to do this that minimizes edge crossing? (For some graphs, it may be impossible to completely eliminate edge crossing.) A picture says a thousand words, so is there an algorithm that would suggest something without crossing edges.

circuit/block-diagram drawing

不问归期 提交于 2019-11-30 08:55:00
I'm looking for either algorithms or visualization tool for (nice) circuit/block-diagram drawing. I am also interested in a general formulation of the problem. By "circuit drawing", I mean the capability of exploring place & route for block-diagrams (rectangles) with I/O ports and their connections (wires). These block-diagrams can be hierarchical i.e some blocks may have some nested internal sub-structure etc. This topic is strongly related to classical graph-drawing, with the supplemental constraint of the need to take ports location into account, and possibly the shape of the blocks

Drawing Directed Acyclic Graphs: Minimizing edge crossing?

泄露秘密 提交于 2019-11-30 03:36:21
Laying out the verticies in a DAG in a tree form (i.e. verticies with no in-edges on top, verticies dependent only on those on the next level, etc.) is rather simple without graph drawing algorithms such as Efficient Sugiyama. However, is there a simple algorithm to do this that minimizes edge crossing? (For some graphs, it may be impossible to completely eliminate edge crossing.) A picture says a thousand words, so is there an algorithm that would suggest something without crossing edges . ( compared to this ). EDIT: The result I've accepted Senthil's suggesting graphviz/dot -- a quick look