# Graph layout algorithm

I have an undirected graph on matris by vertex adjacency relations like that;

/*    a  b  c  d
* a -1  0  1  1
* b  0 -1  1  1
* c  1  1 -1  1
* d  1  1  1 -1
*
*/


I want to draw this graph on cordinate system. What's the algorithm that gives each vertex position (x,y) by any method(force-directed, spring vs) with no intersection between edges or minimum intersection? Thanks.

• you are looking for a graph drawing algorithm. There are numerous papers on this, and a textbook, and a wikipedia page: en.wikipedia.org/wiki/Graph_drawing. Please refer to those, rather than posting a question that isn't research-level. – Suresh Venkat Mar 22 '12 at 17:00
• I didn't find any article about intersection between edges on graph drawing content. This is not research-level? Finding shortest way btw vertices is research content but non-intersection edges not? – moses Mar 22 '12 at 17:33
• graph drawing is all about drawing graphs with few or no intersections. – Suresh Venkat Mar 22 '12 at 19:05