![](https://img-blog.csdnimg.cn/20201014180756724.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
基础图遍历
文章平均质量分 69
nianiajr
http://www.liangjiarui.com/
展开
-
uva572 - Oil Deposits
The GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of land at a time, and creates a grid that divides th原创 2013-07-31 13:48:35 · 587 阅读 · 0 评论 -
poj1860
bellman判环: #include #include #include #include using namespace std; struct edge{ int from; int to; double r; double c; }es[250]; int n,m,s,E; double v,a,b,rab,rba,cab,cba,d原创 2013-12-21 11:38:10 · 705 阅读 · 0 评论 -
poj3259
依旧是判环,不过需要注意的是边的设定 #include #include #include #include using namespace std; struct edge{ int from; int to; int v; }es[6000]; int n,m,w,f,s,e,t,E,d[505]; bool find_loop(){ memset(d,原创 2013-12-21 11:41:07 · 748 阅读 · 0 评论 -
poj1062
遍历+dijsktra,注意每次可以使用的更新点的筛选 #include #include #include #include #include #include using namespace std; const int INF=0x3f3f3f3f; int m,n,t,v; int p[105],l[105],x[105],vis[105],ans,d[105]; struct ed原创 2013-12-21 11:45:27 · 725 阅读 · 0 评论 -
poj2253
floyd变形,求最短路径最大值 #include #include #include #include using namespace std; struct point{ double x,y; }p[205]; double g[250][250]; const double INF=100000000.0; int n; double dis(point p1,point原创 2013-12-21 11:47:28 · 630 阅读 · 0 评论