年度博客排行
-
第1名
龙儿筝 -
第2名
宏天软件 -
第3名
青否云后端云 - wallimn
- vipbooks
- gashero
- wy_19921005
- benladeng5225
- fantaxy025025
- e_e
- javashop
- sam123456gz
- zysnba
- tanling8334
- arpenker
- kaizi1992
- xpenxpen
- lemonhandsome
- xiangjie88
- ganxueyun
- xyuma
- wangchen.ily
- Xeden
- jh108020
- zhanjia
- johnsmith9th
- zxq_2017
- jbosscn
- forestqqqq
- ajinn
- daizj
- wjianwei666
- ranbuijj
- 喧嚣求静
- silverend
- sichunli_030
- kingwell.leng
- lchb139128
- kristy_yy
- lich0079
- jveqi
- lzyfn123
- java-007
- sunj
- yeluowuhen
- lerf
- xiaoxinye
- flashsing123
- lxguy
- zhangjijun
最新文章列表
Course Schedule II
There are a total of n courses you have to take, labeled from 0 to n - 1.
Some courses may have prerequisites, for example to take course 0 you have to first take course 1, which is expressed as a pai ...
Course Schedule
There are a total of n courses you have to take, labeled from 0 to n - 1.
Some courses may have prerequisites, for example to take course 0 you have to first take course 1, which is expressed as a pai ...
ZOJ 2193 Window Pains AOV网络
题目链接:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=1193
结题报告:本次代码写的比较乱,但是感觉收获还是不小的
第一次完全靠自己手写邻接表,虽然调了两天,但是最终还是搞出来了
首先4*4方格中每个方格可能出现的数字
1
1,2
2,3
3
1,4
1,2,4,5
2,3,5,6
3 ...
java 图论二 有向图 拓扑排序
有向图的拓扑排序,能够获得访问到某一节点的提前条件。
拓扑排序时不可以实现环和图的拓扑排序。
写一下拓扑排序的实现:
是在联通矩阵上实现的,拓扑排序的算法是:
1.查看连通矩阵是否还有剩余节点,如果有继续2,3操作,如果没有结束拓扑排序
2.找到没有后继的节点
3.如果找到了,从联通矩阵中删除;如果没找到,则此联通矩阵不是DAG,不能进行拓扑排序
package com.C ...