![](https://img-blog.csdnimg.cn/20201014180756780.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
图
defense881
Noting is impossiable!Believe in yourself!
展开
-
图的存储结构 (转)
图的存储结构 2009-04-18 19:58:21| 分类: 编程 |举报 |字号 订阅 8.2 图的存储结构 图的存储结构除了要存储图中各个顶点的本身的信息外,同时还要存储顶点与顶点之间的所有关系(边的信息),因此,图的结构比较复杂,很难以数据元素在存储区中的物理位置来表示元素之间的关系,但也正是由于其任意的特性,故物理表示方法很多。常用转载 2014-08-05 15:30:43 · 922 阅读 · 0 评论 -
poj 1469 COURSES(判断是否是存在不匹配的点(对于右边的点集来说))
COURSES Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 17858 Accepted: 7038 Description Consider a group of N students and P courses. Each student v原创 2014-11-01 13:15:35 · 648 阅读 · 0 评论 -
HDU 2458Kindergarten(二分图 最大团点数)
Kindergarten Time Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 785 Accepted Submission(s): 443 Problem Description In a kindergart原创 2014-11-01 12:54:00 · 715 阅读 · 0 评论 -
poj 1422&&HDU 1151 Air Raid(最小路径覆盖)
Air Raid 点击打开题目链接 Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 6781 Accepted: 4045 Description Consider a town where all the streets are one-way an原创 2014-11-01 15:44:21 · 648 阅读 · 0 评论 -
HDU 2255 奔小康赚大钱(二分图的最大带权匹配 裸的KM算法)
奔小康赚大钱 点击打开题目链接 Time Limit: 1000/1000 MS (Java/Others) Memory Limit:原创 2014-11-01 12:59:31 · 814 阅读 · 0 评论 -
二分图大讲堂——彻底搞定最大匹配数(最小覆盖数)、最大独立数、最小路径覆盖、带权最优匹配(转)
二分图大讲堂——彻底搞定最大匹配数(最小覆盖数)、最大独立数、最小路径覆盖、带权最优匹配(转) 文本内容框架: §1图论点、边集和二分图的相关概念和性质 §2二分图最大匹配求解 匈牙利算法、Hopcroft-Karp算法 §3二分图最小覆盖集和最大独立集的构造 §4二分图最小路径覆盖求解 §5二分图带权最优匹配求解 Kuhn-Munkers算法转载 2014-10-30 17:59:46 · 1049 阅读 · 0 评论 -
poj 2240 Arbitrage(最短路径)
Arbitrage 点击打开题目链接 Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 15931 Accepted: 6706 Description Arbitrage is the use of discrepancies in currency exch原创 2014-09-11 15:02:53 · 800 阅读 · 0 评论 -
poj 2421 Constructing Roads(最小生成树 kruskal算法)
Constructing Roads Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 19457 Accepted: 8103 Description There are N villages, which are numbered from 1 to N,原创 2014-08-11 14:23:41 · 768 阅读 · 0 评论 -
poj 1258 Agri-Net(最小生成树 prime算法)
Agri-Net http://poj.org/problem?id=1258 Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 40013 Accepted: 16283 Description Farmer John has been elected may原创 2014-08-11 16:10:35 · 738 阅读 · 0 评论 -
poj 2942&&uva 3523 Knights of the Round Table(图的连通性)
Knights of the Round Table Time Limit: 7000MS Memory Limit: 65536K Total Submissions: 9663 Accepted: 3129 Description Being a knight is a very attractive career: search原创 2014-08-10 18:42:47 · 876 阅读 · 0 评论 -
HDU 3790 最短路径问题(单源最短路)
最短路径问题 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 14259 Accepted Submission(s): 4365 点击打开题目链接 Problem Description 给你n个点,m条无向边,每条原创 2014-12-09 13:46:31 · 605 阅读 · 0 评论