Provable planarity of flowcharts

Posted by Nikolaos Kavvadias on Stack Overflow See other posts from Stack Overflow or by Nikolaos Kavvadias
Published on 2010-03-15T05:37:02Z Indexed on 2010/03/15 5:39 UTC
Read the original article Hit count: 343

Filed under:

graphs

|

graph-theory

|

algorithms

Hi all

I have a question: is there any reference (e.g. paper) with a proof of the planarity of flowchart layouts? Can anyone suggest an algorithm for generating flowchart (planar) layouts?

I know that there are some code-to-flowchart tools out there, but i'm unaware of their internals.

Thanks in advance

-kavi

© Stack Overflow or respective owner

Related posts about graphs

C# Generate MRTG/RRD like Graphs Performance graphs?

as seen on Stack Overflow - Search for 'Stack Overflow'
I have a database with Performance counter data and i would like to show this on a ASP.net page but the thing is i don't want to use Flash based charting solution or a Javascript based solution i would like to just generate images and use those I want the images to be like those of RRD or MRTG. I'm… >>> More
Create Custom Web-based Graphs with the Google Chart API and PHP

as seen on Internet.com - Search for 'Internet.com'
Presenting data visually can quickly reveal crucial trends. Learn how to use the Google Chart API in conjunction with PHP to create a variety of useful charts. >>> More
Working with Graphs and Gauges in JDeveloper 11

as seen on Oracle Technology Network - Search for 'Oracle Technology Network'
New how-to's on the data visualization components >>> More
What scientific plotting software is available?

as seen on Ask Ubuntu - Search for 'Ask Ubuntu'
I am currently doing some experimental work and I have a lot of data to trawl though. I use Gnumeric, and it's very good, but often I feel there has to be something better. Ideally I would like the maximum number of features with a minimal learning curve, but really I'd just like to know if there… >>> More
How to apply numerical integration on a graph layout

as seen on Game Development - Search for 'Game Development'
I've done some basic 1 D integration, but i can't wrap my head around things and apply it to my graph layout. So, consider the picture below: if i drag the red node to the right, i'm forcing his position to my mouse position the other nodes will "follow" him, but how ? For Verlet, to compute the… >>> More

Related posts about graph-theory

Graph theory in python

as seen on Stack Overflow - Search for 'Stack Overflow'
I was wondering how people deal with graph theory in python? How is a graph stored? Are there libraries for this? For example how would I input a graph and then find its Chromatic polynomial? Or its girth? Or the number of unique spanning trees? How about problems that involve edge weight like salesman… >>> More
What is the relaxation condition in graph theory

as seen on Stack Overflow - Search for 'Stack Overflow'
Hi, I'm trying to understand the main concepts of graph theory and the algorithms within it. Most algorithms seem to contain a "Relaxation Condition" I'm unsure about what this is. Could some one explain it to me please. An example of this is dijkstras algorithm, here is the pseudo-code. 1 … >>> More
Translation of clustering problem to graph theory language

as seen on Stack Overflow - Search for 'Stack Overflow'
I have a rectangular planar grid, with each cell assigned some integer weight. I am looking for an algorithm to identify clusters of 3 to 6 adjacent cells with higher-than-average weight. These blobs should have approximately circular shape. For my case the average weight of the cells not containing… >>> More
box stacking in graph theory

as seen on Stack Overflow - Search for 'Stack Overflow'
Please help me find a good solution for this problem. We have n boxes with 3 dimensions. We can orient them and we want to put them on top of another to have a maximun height. We can put a box on top of an other box, if 2 dimensions (width and lenght) are lower than the dimensions of the box below… >>> More
Is finding graph minors without single node pinch points possible?

as seen on Game Development - Search for 'Game Development'
Is it possible to robustly find all the graph minors within an arbitrary node graph where the pinch points are generally not single nodes? I have read some other posts on here about how to break up your graph into a Hamiltonian cycle and then from that find the graph minors but it seems to be such… >>> More