拓扑排序

摘要: #include<iostream>using namespace std;struct huan{ int node; bool isfound; int start;};int min(int a,int b){ int temp; if(a>b){ temp=a; a=b; b=temp; / 阅读全文
posted @ 2017-04-10 22:42 ahdudhshshdhd 阅读(98) 评论(0) 推荐(0)