Data Structure and Algorithms 上課筆記(NTU Roger's class)
Introduction
Outline
Basics of DSA
Class 1
From C to Cpp
C++ code example
Shallow Copy
Class 2
2D-Array
Binary Search
Class 3
Analysis Tools
Associative Array
Trie
Class 4
Stack
Queue
Class 5
General Trees
Binary Tree
Class 6
Heaps
HomeWork 3
Class 7
Hash Table
Class 8
Class 9
Dynamic Programming
Long Common Subsequence
Matrix Chain Product
Class 10
Graphs
Depth-First Search
Breadth-First Search
Class 11
Shortest Path
Minimum Spanning Tree
Class 12
Sorting Algorithm
Merge Sort
Quick Sort
Bucket sort & Radix sort
Class 13
Binary Search Trees
AVL Tree
Hoffman Coding
Class 14
All-pairs Shortest Path
Pattern Matching
Powered by
GitBook
All-pairs Shortest Path
All-pairs Shortest Path
Floyd -Warshall Algorithm
1.可找出所有點間的最短距離
2.DP
3.可處理邊是負數權重（但若是負數cycle則不行）
實作
results matching "
"
No results matching "
"
