Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #include <stdlib.h>
- #define MAXN 100010
- int inserir(int atual, int arestas, FILE* arq);
- typedef struct node {
- int num;
- int peso;
- node* next;
- node* head;
- }node;
- int N;
- node grafo[MAXN];
- int main(){
- FILE* arq;
- int n;
- arq=fopen("input1.txt", "r");
- if(arq==NULL){
- return 0;
- }
- fscanf(arq, "%d", &N);
- for(int i=1;i<=N;i++){
- grafo[i].next=NULL;
- fscanf(arq, "%d",&n );
- inserir(i, n, arq);
- }
- fclose(arq);
- return 0;
- }
- int inserir(int atual, int arestas, FILE* arq){
- int v, w;
- node* aux;
- node* last;
- for(int i=0;i<arestas;i++){
- fscanf(arq, "%d %d", &v, &w);
- last = grafo+atual;
- while(last->next!=NULL){
- last= last->next;
- }
- aux = (node*) malloc((int)sizeof(node));
- aux->num = v;
- aux->next = NULL;
- aux->peso = w;
- if(grafo[atual].next==NULL){
- grafo[atual].next=aux;
- }
- else{
- last=grafo[atual].next;
- while(last->next!=NULL){
- last= last->next;
- }
- last->next = aux;
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement