Android, Algorithms

Week1 (01/05)

讀書心得

Algorithms on Graphs - Week5

給出座標上n個點:

1. 找出最短路徑(the shortest path)
2. 分群(Clustering)

為Minimun Spanning Tree相關問題, 可以使用Kruskal’s MST Algorithm 及Disjoint-set 來解.

for all u ∈ V :
    MakeSet(v )
X ← empty set 	// a set with solution edges
sort the edges E by weight
for all {u, v } ∈ E in non-decreasing
    weight order:
    if Find(u) != Find(v):
	add {u, v } to X
	Union(u, v )
return X

Week2 (01/12)

網路文章

Android编译系统中的Android.bp、Blueprint与Soong

Week3 (01/19)

Vim tip: file encryption
Usage :help 'cm'
Set default encrypt method: :set cm=zip, :set cm=blowfish or :set cm=blowfish2

網路文章

Preventing burnout for programmers

Turning Design Mockups Into Code With Deep Learning

網路資源

jq is a lightweight and flexible command-line JSON processor.
JSON filter in command-line.

How can I handle command-line options and arguments in my script easily?
Parsing optional arguments in bash: ‘shift’ and ‘getopts’.

讀書心得

Deep Learning: A Critical Appraisal PFD

Week4 (01/26)

None