- 博客(4)
- 收藏
- 关注
RSS订阅原创 BFS时间复杂度问题
BFS(s): Set Discovered[s] = true and Discovered[v] = false for all other v Initialize L[0] to consist of the single element s Set the layer counter i = 0 Set the current BFS tree T =∅ While L[i]
2014-10-18 05:30:25
1736
原创 Python Assignment1 知识总结
1. Handling exceptions: try: x = int(raw_input("Please enter a number: ")) break except ValueError: print "Oops! That was no valid number. Try
2014-10-08 04:08:37
1272
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人