年度博客排行
-
第1名
龙儿筝 -
第2名
宏天软件 -
第3名
青否云后端云 - wallimn
- vipbooks
- gashero
- wy_19921005
- benladeng5225
- fantaxy025025
- zysnba
- e_e
- javashop
- sam123456gz
- tanling8334
- arpenker
- kaizi1992
- xpenxpen
- lemonhandsome
- xiangjie88
- ganxueyun
- xyuma
- wangchen.ily
- jh108020
- Xeden
- johnsmith9th
- zxq_2017
- zhanjia
- jbosscn
- forestqqqq
- lzyfn123
- ajinn
- daizj
- wjianwei666
- ranbuijj
- 喧嚣求静
- sichunli_030
- kingwell.leng
- silverend
- lchb139128
- kristy_yy
- lich0079
- jveqi
- java-007
- sunj
- yeluowuhen
- lerf
- flashsing123
- xiaoxinye
- lxguy
- zhangjijun
最新文章列表
Minimum Spanning Tree
1. Definition: Given an undirected graph G with positive edge weights (connected). A spanning tree of G is a subgraph T that is connected and acyclic. A minimum spanning tree is a min weight spannin ...
Huffman Codes
1. Binary Codes:
-- Maps each character of an alphabet Sigma to a binary string.
-- Example: Sigma = a-z and various punctuation (size 32 overall, say)
Obvious enco ...
Prim's MST Algorithm
1. Informal Goal: Connect a bunch of points together as cheaply as possible.
Blazingly Fast Greedy Algorithms:
- Prim's Algorithm
- Kruskal's algorithm
O(m log n) m is the ...
a scheduling application
1. Problem Scenario :
- One shared resource (e.g., a processor).
- Many "jobs" to do (e.g., processes).
Assume: Each job has a:
- weight wj ("priority")
- ...
Introduction to Greedy Algorithm
1. Greedy Algorithms : Iteratively make "myopic" decisions, hope everything works out at the end.
Example: Dijkstra's shortest path algorithm (processed each destination once, irrevoca ...