Databases
StackOverflow2013
Postsdbo
POCreating Adjacency List
 

Note that there are some explanatory texts on larger screens.

plurals
  1. POCreating Adjacency List
    primarykey
    data
    text
    <p>I am having problem to create adjacent list in correct order. I think there is some problem in CreateAdjList(void)method. I run out of ideas. Please give me some tips. Basically I have graph and creating Adjacency list on connected edges.</p> <pre><code>#include &lt;stdio.h&gt; #include &lt;stdlib.h&gt; #define maxV 100 typedef struct graphnode{ int vertex; struct graphnode *next; }Node; Node **node; Node **nodeT; FILE *fp; void initial(int nv); void AdjList(void); void PrintAdjList(int nv); int main() { int nv; fp= fopen("input.txt","r"); fscanf(fp,"%d",&amp;nv); initial(nv); CreateAdjList(); PrintAdjList(nv); return 0; } void initial(int nv) { int i; node = new Node *[maxV]; for(i=1;i&lt;=nv;i++){ node[i] = (Node *)malloc(sizeof(Node)); node[i]-&gt;next=NULL; } } //CREATE ADJACENCY LIST - void CreateAdjList(void) { int v1,v2; Node *ptr; while(fscanf(fp,"%d%d",&amp;v1,&amp;v2)!=EOF){ ptr = (Node *)malloc(sizeof(Node)); ptr-&gt;vertex = v2; ptr-&gt;next = node[v1]-&gt;next; //Problem could be here node[v1]-&gt;next = ptr; } fclose(fp); } //PRINT LIST void PrintAdjList(int nv) { int i; Node *ptr; for(i=1; i&lt;=nv; i++){ ptr = node[i]-&gt;next; printf(" node[%2d] ",i); while(ptr != NULL){ printf(" --&gt;%2d", ptr-&gt;vertex); ptr=ptr-&gt;next; } printf("\n"); } printf("\n"); } </code></pre> <blockquote> <p>ACTUAL PROGRAM OUTPUT - WRONG ORDER . I attached output list in printed in revere way.</p> </blockquote> <p>Input:</p> <pre><code>8 1 2 2 3 2 5 2 6 3 4 3 7 4 3 4 8 5 1 5 6 6 7 7 6 7 8 8 8 0 0 Expected Output: Adjacency list represenation: 1: 2 2: 3 5 6 3: 4 7 4: 3 8 5: 1 6 6: 7 7: 6 8 8: 8 </code></pre> <blockquote> <p>My actual output is displayed wrong order. If you look at node the correct order should be 2 ->3->6->5</p> </blockquote> <pre><code> node[ 1] --&gt; 2 node[ 2] --&gt; 6 --&gt; 5 --&gt; 3 node[ 3] --&gt; 7 --&gt; 4 node[ 4] --&gt; 8 --&gt; 3 node[ 5] --&gt; 6 --&gt; 1 node[ 6] --&gt; 7 node[ 7] --&gt; 8 --&gt; 6 node[ 8] --&gt; 8 </code></pre>
    singulars
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. PTQuestion
    1. USR. Martinho Fernandes
    1. USuser1029083
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. PO
      singulars
      1. PTAnswer
    1. VO
      singulars
      1. POCreating Adjacency List
      1. USCan Vural
      1. VTFavorite
    1. COWhy are you not using a Standard Library container with Smart pointer?
      singulars
      1. POCreating Adjacency List
      1. USAlok Save
    2. COYour program does not compile. Please edit it. If I change the declaration from `void AdjList(void)` to `void CreateAdjList(void)` it compiles, but I get a segfault (using GCC on Mac OS X). Probably, this is due to missing error handling - I don't have a file called `input.txt`.
      singulars
      1. POCreating Adjacency List
      1. USAndre
 

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