本月博客排行
年度博客排行
-
第1名
宏天软件 -
第2名
青否云后端云 -
第3名
龙儿筝 - gashero
- wallimn
- vipbooks
- benladeng5225
- wy_19921005
- fantaxy025025
- e_e
- zysnba
- ssydxa219
- sam123456gz
- javashop
- arpenker
- tanling8334
- kaizi1992
- xpenxpen
- wiseboyloves
- xiangjie88
- ranbuijj
- ganxueyun
- sichunli_030
- xyuma
- wangchen.ily
- jh108020
- lemonhandsome
- zxq_2017
- jbosscn
- Xeden
- luxurioust
- zhanjia
- forestqqqq
- lzyfn123
- ajinn
- nychen2000
- wjianwei666
- hanbaohong
- daizj
- 喧嚣求静
- mwhgJava
- silverend
- kingwell.leng
- lchb139128
- kristy_yy
- lich0079
- johnsmith9th
- jveqi
- java-007
- sunj
最新文章列表
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 ...