(English) The wireless issue of thinkpad T60 with Ubuntu
I was troubled by the wireless card driver for a long time since the first time I install Ubuntu in my Thinkpad T60. Finally, I solved this problem today, the Chinese New Year. My wireless card is not the Intel one, but the thinkpad 802.11 abg card. The chip set is from Atheros. Actually, the [...]
LJ's Matlab tips (1)
As I promised to Starfish, I will write something about how to read and write files in matlab. Since I just picked up this part recently, there maybe some mistakes. Frankly speaking, I write this half for some one who may need it, half for myself, because I may forget them in the future, haha. [...]
(English) some usefule site for Fleury's Algorithm
http://www2.austin.cc.tx.us/powens/+Topics/HTML/05-6/05-6.html http://planetmath.org/encyclopedia/FleurysAlgorithm.html http://www.ctl.ua.edu/math103/euler/ifagraph.htm I prefer the first one because there is an example. Fleury’s Algorithm is used to find the Eulerian Cycle (if there is one) or the Eulerian Path (if there is no Eulerian Cycle). The computation complexity is O(n^4). There is another O(n+e) algorithm which uses the cycles.
Recent Comments