sunyujia19的专栏

http://www.cnblogs.com/huangxincheng/archive/2012/07/21/2602375.html

Wiki link http://en.wikipedia.org/wiki/Sorting_algorithm 1. Bubble Sort : O(n^2) for array 两层for循环，交换相邻元素。 2. Selection Sort : O(n^2) for array 两层for循环，每次找到最小值放在对应的位置，交换。 3. Insertion S

Queue: Doubly linked list: #include using namespace std; struct ListNode { int val; ListNode *next, *pre; ListNode(int x) :val(x), next(NULL), pre(NULL) {} }; class Queue { private: Lis

Correct 1 / 1 points 1.  Consider a directed graph with distinct and nonnegative edge lengths and a source svertex. Fix a destination vertex t, and assume that the graph contains

import heapq import sys fname = 'dijkstraData.txt' #fname = "tc.txt" fh = open(fname) lines = [line.rstrip('\n') for line in fh] # Generate graph as a list of dictionaries. # Index of list is the ver