Don't like ads? PRO users don't see any ads ;-)
Guest

Untitled

By: a guest on May 10th, 2012  |  syntax: C  |  size: 0.50 KB  |  hits: 17  |  expires: Never
download  |  raw  |  embed  |  report abuse  |  print
This paste has a previous version, view the difference. Text below is selected. Please press Ctrl+C to copy to your clipboard. (⌘+C on Mac)
  1.         node* it = graph->nodes;
  2.         for (i = 0; i < numNodes; i++) {
  3.                 numEdges = 0;
  4.                 it->edges = malloc(numNodes * sizeof(struct Edge));
  5.                 for (j = 0; j < numNodes; j++) {
  6.                         fscanf(ifp, "%d", &weight);
  7.                         if (weight != 0) {
  8.                                 it->edges[numEdges].weight = weight;
  9.                                 it->edges[numEdges].source = &graph->nodes[i];
  10.                                 it->edges[numEdges].destination = &graph->nodes[j];
  11.                                 numEdges++;
  12.                         }
  13.                 }
  14.                 if (numEdges <= numNodes) {
  15.                         it->edges = realloc(it->edges, numEdges * sizeof(struct Edge));
  16.                 }
  17.                 it++;