The following video is a good demonstration.
Mar 23, 2015
Mar 22, 2015
Mar 15, 2015
[Python] Performance enhance by not using range() for comparison
When I was trying to enhance the performance of my Python code, the frist thing I tried is reducing the usage of functions. After I substituted the range() function, the performance had improved a lot, from 404ms to 106ms. The following is the difference between the two versions of the "ZigZag Conversion" code.
404ms
106ms Although the performance result depends on the test data, this substitution really improves the entire performance.
Mar 13, 2015
[Python] Find synonyms by using WordNet, NLTK
WordNet is a great reference when you want to find synonyms of a word. For more information, please see the website: http://wordnet.princeton.edu/
The following Python code is a simple example.
WordNet Interface: http://www.nltk.org/howto/wordnet.html
The following Python code is a simple example.
WordNet Interface: http://www.nltk.org/howto/wordnet.html
Mar 12, 2015
Apply BFS to special MST problems
Given a undirected and connected graph, and the edges have weights of either 1 or 2 (actually it is also applicable for weight larger than 2). How can we find a MST of the graph by using BFS?
Ans (I guess):
First, we can view an edge with weight of 2 as two edges with weight of 1 connected together. Then we can simply apply BFS to solve this problem. After finish the BFS algorithm, we check all the edges originally with weight of 2. If both parts of an edge are not both chosen as a path of the MST, then we delete this path. Finally, the result is a MST.
Ans (I guess):
First, we can view an edge with weight of 2 as two edges with weight of 1 connected together. Then we can simply apply BFS to solve this problem. After finish the BFS algorithm, we check all the edges originally with weight of 2. If both parts of an edge are not both chosen as a path of the MST, then we delete this path. Finally, the result is a MST.
Subscribe to:
Posts (Atom)