摘要: 小C最近学了很多最小生成树的算法,Prim算法、Kurskal算法、消圈算法等等。正当小C洋洋得意之时,小P又来泼小C冷水了。小P说,让小C求出一个无向图的次小生成树,而且这个次小生成树还得是严格次小的,也就是说:如果最小生成树选择的边集是EM,严格次小生成树选择的边集是ES,那么需要满足:(val 阅读全文
posted @ 2018-07-19 16:24 Styx-ferryman 阅读(188) 评论(0) 推荐(0) 编辑
摘要: A histogram is a polygon composed of a sequence of rectangles aligned at a common base line. The rectangles have equal widths but may have different h 阅读全文
posted @ 2018-07-19 10:32 Styx-ferryman 阅读(481) 评论(0) 推荐(1) 编辑