本月博客排行
-
第1名
Xeden -
第2名
fantaxy025025 -
第3名
bosschen - paulwong
- johnsmith9th
年度博客排行
-
第1名
青否云后端云 -
第2名
宏天软件 -
第3名
gashero - gengyun12
- wy_19921005
- vipbooks
- e_e
- benladeng5225
- wallimn
- ranbuijj
- javashop
- jickcai
- fantaxy025025
- zw7534313
- qepwqnp
- robotmen
- 解宜然
- ssydxa219
- sam123456gz
- zysnba
- sichunli_030
- tanling8334
- arpenker
- gaojingsong
- xpenxpen
- kaizi1992
- wiseboyloves
- jh108020
- xyuma
- ganxueyun
- wangchen.ily
- xiangjie88
- Jameslyy
- luxurioust
- mengjichen
- lemonhandsome
- jbosscn
- nychen2000
- zxq_2017
- lzyfn123
- wjianwei666
- forestqqqq
- ajinn
- siemens800
- hanbaohong
- 狂盗一枝梅
- java-007
- zhanjia
- 喧嚣求静
- Xeden
最新文章列表
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 ...