静态邻接表
摘要:
#include <stdio.h>#include <string.h>#include <stdlib.h>struct node{ int y, v, next;}T[1000];int size;int adj[1000];void add_edge(int i, int j, int v){ T[size].v = v; T[size].y = j; T[size].next = adj[i]; adj[i] = size++;} int main( ){ int N, M, i, j, a, b, c; while (scanf("%d 阅读全文
posted @ 2011-08-05 17:18 more think, more gains 阅读(190) 评论(0) 推荐(0) 编辑