数据结构
willpower1li
技术宅
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
poj_1204Word Puzzles
DescriptionWord puzzles are usually simple and very entertaining for all ages. They are so entertaining that Pizza-Hut company started using table covers with word puzzles printed on them, possibly原创 2014-12-16 17:23:46 · 475 阅读 · 0 评论 -
poj_1258--Agri-Net
DescriptionFarmer John has been elected mayor of his town! One of his campaign promises was to bring internet connectivity to all farms in the area. He needs your help, of course.Farmer John ord原创 2014-12-17 01:06:04 · 370 阅读 · 0 评论 -
关于前向星的数据结构
数据结构可以选择用前向星的方式存储一个图。前向星的原理是:把图拆分为几个部分:1.用一个堆栈去存储节点的最后一个边;2用另一个堆栈存储节点的最后一个相关联的边;3用一个堆栈来存储2中的边指向的节点,例如 1a2 传参a 返回节点2. 下边是代码:struct graph{ typedef vector VI; VI info,next,to;原创 2014-12-08 19:41:49 · 506 阅读 · 0 评论
分享