tailieunhanh - Lecture Algorithm design - Chapter 4: Greedy Algorithms II

Lecture Algorithm design - Chapter 4: Greedy Algorithms II include all of the following: Dijkstra's algorithm; minimum spanning trees; Prim, Kruskal, Boruvka; single-link clustering; min-cost arborescences. | 4. Greedy Algorithms II Dijkstra s algorithm minimum spanning trees Prim Kruskal Boruvka single-link clustering min-cost arborescences Lecture slides by Kevin Wayne Copyright 2005 Pearson-Addison Wesley Copyright 2013 Kevin Wayne http wayne kleinberg-tardos Last updated on Sep 8 2013 6 30 AM Section 4. Greedy Algorithms II Dijkstra s algorithm Shortest-paths problem Problem. Given a digraph G V E edge lengths le 0 source 5 G V and destination t G V find the shortest directed path from 5 to t.

TÀI LIỆU LIÊN QUAN
TỪ KHÓA LIÊN QUAN