Shortest paths Single-source shortest paths nonnegative edge weights Dijkstra's algorithm: O(E+ vlg n General

安徽理工大学：《算法设计与分析 Algorithm Design and Analysis》课程教学资源（PPT课件讲稿）第7章 回溯法

第二章分治法(Divide and Conquer)——“分”而治之 2.1一般方法

• Introduction to Hamiltonian Monte Carlo • Riemann manifold Langevin and Hamiltonian Monte Carlo methods (Girolami & Calderhead, 2011) • Geodesic Monte Carlo on Embedded Manifolds (Byrne & Girolami, 2013)

RFID数据管理：算法、协议与性能评测（南京大学：谢磊、殷亚凤、陈曦、陆桑璐、陈道蓄）

西安电子科技大学：《算法设计技术 Algorithms Design Techniques》课程教学资源（PPT课件讲稿）Chapter 01 Basic Concepts in Algorithmic Analysis（主讲：刘静）

◼ Chapter 8 The Greedy Approach ◼ Chapter 9 Graph Traversal

⚫Algorithm overview ⚫Performance experiments ⚫Solution and future work ⚫Bibliography and resources

◼ Chapter 5 Induction ◼ Chapter 6 Divide and Conquer ◼ Chapter 7 Dynamic Programming

◼ Chapter 16 Network Flow ◼ Chapter 17 Matching