输入对齐:
https://blog.youkuaiyun.com/scutbenson/article/details/115163511
printf("%-5d", -1);//左对齐
printf("%5d", -1);//右对齐
排序:
排序用qsort(a, num, sizeof(a的类型),cmp):
_a,_b指针传入,再通过(Node*)切换格式,再通过*取值.
int cmp(void* _a, void* _b)
{
Node a = *(Node*) _a;
Node b = *(Node*) _b;
return a.weight - b.weight;
}
邻接表:
加边:
void addedge(int x, int y, int z, int num)
{
Edge[num].next = head[x];
Edge[num].to = y;
Edge[num].dis = z;
head[x] = num;
}
遍历:
for (j = head[i]; j ; j= Edge[j].next)