- 博客(6)
- 收藏
- 关注
RSS订阅原创 Algorithm-part3-week1
Minimum spanning trees Informal goal: Connect a bunch of points together as cheaply as possible. Application: Clustering(more later), networking. Blazingly Fast Greedy Algorithms: −−−−-- Prim’s A...
2018-05-29 08:44:38
186
原创 Algorithms2-week4-hashtable
Hash Table: Supported Operations Purpose:maintain a (possibly evolving) set of stuff. (transactions, people+associated data, IP address, etc) Insert: add new record. Delete: delete existing reco...
2018-05-16 20:08:14
222
原创 Data structure notes
Data Structure Pooint: organize data so that it can be accessed quickly and usefully. Examples: lists,stacks,queues,heaps,search trees,hashtables, bloom filters, union-find, etc Rule of thumb: cho...
2018-05-12 19:41:07
144
原创 Algorithm(2)Graph search and connectivity-week1
1. Graph Primitives 1.1 Generic Graph Search Goal: 1) find everything findable from a given start vertex. 2) don’t explore anything twice.Goal : O(m+n) times. Generic Algorithm(given graph G, v...
2018-05-07 22:09:36
295
原创 图处理算法-Kosaraju's-算法
Kosaraju 算法实现1.用c++写了算法课的作业，计算了875714个顶点的有向图，计算了前5个最大连通分量的个数，用了两次DFS算法。 2.用c++开辟大数组容易出segment fault，后来改用堆开辟。图的邻接表用了链表表示。 VertexNode* adjList = new VertexNode[875714]; 3.Kosaraju算法流程不在此详述。深度优先...
2018-05-06 16:02:08
551
原创 Programming language--week1(sml)
Syntax: if e1 then e2 else e3 where if ,then, and else are keywords and e1, e2, and e3 are subexpressions Type-checking: first e1 must have type bool e1 and e3 can have any type(l...
2018-05-04 17:27:25
180
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人