Databases
StackOverflow2013
Postsdbo
POHow to check if a Graph is a Planar Graph or not?
 

Note that there are some explanatory texts on larger screens.

plurals
  1. POHow to check if a Graph is a Planar Graph or not?
    primarykey
    data
    text
    <p>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?</p> <p>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</p> <pre><code># 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 = fopen(filename,"r"); if (f== NULL) { printf("\n Error \n"); return 1; } else { printf("File mane: %s \n",filename); printf("Content :\n"); fscanf(f,"%d",&amp;n); fscanf(f,"%d",&amp;m); for(i=0;i&lt;n;i++) { for(j=0;j&lt;n;j++) { fscanf(f,"%d",&amp;my_array[i][j]); printf("%d ",my_array[i][j]); } printf("\n"); } return 0; } } void Default() { for(int i=0;i&lt;colors_max;i++) Color[i]= i; } void Init() { filename[0]=NULL; n = 0; } int Planar_Graph(int my_array[MAX][MAX],int n, int m) // This is my problem { /* for(int i=0;i&lt;n;i++) if(n&gt;=2 &amp;&amp; (int)(n+1)*(n-2)/(n-1)&gt;=m) return 1; } else { return 0; } */ } int max() { int max; int count=0; for(int i=0;i&lt;n;i++) { count = 0; for(int j=0;j&lt;n;j++) if (my_array[i][j] &gt; 0) count++ ; if (max &lt; count) max = count; } return max+1; } void Check(int x,int y) // Check around { int i; Default(); for(i=0;i&lt;n;i++) { if (my_array[x][i] != -1) // if edge [x,ke[i]] is color t Color[my_array[x][i]] = -1; // then Color[t] = 0 } for(i=0;i&lt;n;i++) { if (my_array[y][i] != -1) Color[my_array[y][i]] = -1; } } void Coloring() { int t; for(int i=0;i&lt;n;i++) for(int j=0;j&lt;n;j++) if (my_array[i][j] &gt; 0) { Check(i,j) ; for(t=0;t &lt; colors_max;t++) if (Color[t] == t) { my_array[i][j] = t; my_array[j][i] = t; break; } } } void main() { if(input("input.txt")!=1) { Default(); colors_max = max() ; Coloring(); printf("\n Result:\n\n"); Planar_Graph(my_array,n,m); for(int i=0;i&lt;n;i++) { for(int j=0;j&lt;n;j++) if (my_array[i][j]&gt;0) { printf(" %c,%c] coloring %d \n",i + 'A',j + 'A',my_array[i][j]) ; my_array[i][j] = -1; my_array[j][i] = -1; } printf("\n") ; } } } </code></pre> <p>The input file example:</p> <pre><code>10 18 0 1 0 1 1 1 0 0 0 0 1 0 1 0 0 0 0 0 0 0 0 1 0 0 1 0 0 0 0 0 1 0 0 0 1 0 1 1 0 0 1 0 1 1 0 1 1 0 1 0 1 0 0 0 1 0 1 0 1 0 0 0 0 1 1 1 0 1 0 0 0 0 0 1 0 0 1 0 1 1 0 0 0 0 1 1 0 1 0 1 0 0 0 0 0 0 0 1 1 0 </code></pre>
    singulars
    1. PO
      singulars
      1. PTAnswer
    1. This table or related slice is empty.
    1. PTQuestion
    1. USTMS
    1. USChelsea_cole
    plurals
    1. This table or related slice is empty.
    1. PL
      singulars
      1. LTLinked
    1. This table or related slice is empty.
    1. PO
      singulars
      1. PTAnswer
    2. PO
      singulars
      1. PTAnswer
    3. PO
      singulars
      1. PTAnswer
    1. VO
      singulars
      1. POHow to check if a Graph is a Planar Graph or not?
      1. This table or related slice is empty.
      1. VTUpMod
    2. VO
      singulars
      1. POHow to check if a Graph is a Planar Graph or not?
      1. This table or related slice is empty.
      1. VTUpMod
    3. VO
      singulars
      1. POHow to check if a Graph is a Planar Graph or not?
      1. This table or related slice is empty.
      1. VTUpMod
    1. COI think we need more information. What do you mean install the algorithm? Is this a third-party library? What platform are you on?
      singulars
      1. POHow to check if a Graph is a Planar Graph or not?
      1. USR. Martinho Fernandes
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload