p2.c 661 bytes
#include"tda_header.h"
tVertice vueloPromedioMasBarato(tGrafo *g){
    int v = nVertex(g);
    int sum[v], cant[v];
    for (int j = 0; j < v; j++)
        sum[j] = 0;
        cant[j] = 0;
    for (int i = 0; i < nVertex(g); i++)
        for (int k = first(g, i); k < nVecinos(g, i); next(g,i,k))
            sum[k] += weight(g, i, k);
            cant[k] += 1;
    int minProm = 99999, minNod = 0;
    for (int j = 0; j < v; j++)
        float prom = sum[j]/ cant[j];
        if (prom < minProm)
            minProm = prom;
            minNod = j;
    return minNod;