planar-graph

I'm learning about the Planar Graph and coloring in c++. But i don't know install the algorithm to do this work. Someone please help me? Here i have some information for you! This is my code! And it still has a function does not finish. If someone know what is a "Planar Graph", please fix the Planar_Graph function below! :D thanks so much! :x # define MAX 100 int kt[MAX]; int tk=0; int my_array[MAX][MAX]; // Graph FILE *f; int n,m; //m: Edge, n: Vertex int index[MAX]; int ke[MAX]; int Color[MAX] ; //Color Array int colors_max; char filename[MAX]; int input(char filename[MAX]) { int i,j; f =

I have a geometric undirected planar graph , that is a graph where each node has a location and no 2 edges cross, and I want to find all cycles that have no edges crossing them. Are there any good solutions known to this problem? What I'm planning on doing is a sort of A* like solution: insert every edge in a min heap as a path extend the shortest path with every option cull paths that loop back to other than there start (might not be needed) cull paths that would be the third to use ang given edge Does anyone see an issue with this? Will it even work? My first instinct is to use a method

What are some edge overlap minimization techniques when laying out a graph? (Preferably related to GraphViz) Also are there any existing software that can layout a graph in a planar fashion? Current Layout - http://www.evecakes.com/doodles/master.gif The pink section in the upper left hand corner looks fine while the light blue section has some avoidable edge overlaps. For general graphs, the problem of a determining a planar layout of a graph with least edges crossing (the Crossing Number ) is NP-hard. So some heuristic methods are used (like the Force based layout algorithms). The page below