@w1024020103
2017-05-24T07:05:02.000000Z
字数 376
阅读 1028
Lecture 31: Dynamic Programming
CS61B
Shortest Paths in a DAG
DAG directed acyclic graph

SPTs on Directed Acyclic Graphs

Demo
Runtime Analysis

Dynamic Programming
Definition

Steps

Longest Increasing Subsequence (LIS)
LLIS

LLIS and DAG

DAG Longest Path Algorithm

Using a negative weight to find the longest path

Runtime

Summary

LIS Using Dynamic Programming
Examples of LLIS subproblems


Dynamic programming solution for LLIS problem

Summary
