- 博客(11)
- 资源 (1)
- 收藏
- 关注
RSS订阅原创 计算理论总结
计算理论复习正则语言与有穷自动机可数无穷正则表达式（注意+不是正则，*是正则； L∅=∅L=∅L \emptyset = \emptyset L = \emptyset） Σ⋃{(,),∅,⋃,∗}\Sigma \bigcup \lbrace(,),\emptyset, \bigcup,* \rbraceDFA MM = (KK, Σ\Sigma, δ\delta, ss, FF
2018-01-22 16:55:35
7793
2
原创 c编写 Topological Sort
Topological Sort Write a program to find the topological order in a digraph.Format of functions:bool TopSort( LGraph Graph, Vertex TopOrder[] );where LGraph is defined as the follo
2017-02-25 12:19:00
397
原创 c编写 Shortest Path [3]
Shortest Path [3] (10分)Write a program to not only find the weighted shortest distances, but also count the number of different minimum paths from any vertex to a given source vertex in a di
2017-02-25 12:18:11
2655
原创 c编写 Shortest Path [4]
4-2 Shortest Path [4] (10分)Write a program to find the weighted shortest distances from any vertex to a given source vertex in a digraph. If there is more than one minimum path from v to w,
2017-02-25 12:17:35
771
原创 c 编写Public Bike Management
Public Bike Management (20分)There is a public bike service in Hangzhou City which provides great convenience to the tourists from all over the world. One may rent a bike at any station and r
2017-02-25 12:16:56
267
原创 c编写List Components
List Components (10分)For a given undirected graph with N vertices and E edges, please list all the connected components by both DFS (Depth First Search) and BFS (Breadth First Search). Assum
2017-02-25 12:16:11
419
原创 c编写Strongly Connected Components
Strongly Connected Components (17分)Write a program to find the strongly connected components in a digraph.Format of functions:void StronglyConnectedComponents( Graph G, void (*visit)(V
2017-02-25 12:15:21
1223
原创 c编写Iterative Mergesort
Iterative Mergesort (9分)How would you implement mergesort without using recursion?The idea of iterative mergesort is to start from N sorted sublists of length 1, and each time to merge a
2017-02-25 12:14:32
1213
原创 c编写 Insertion or Heap Sort
Insertion or Heap Sort (9分)According to Wikipedia:Insertion sort iterates, consuming one input element each repetition, and growing a sorted output list. Each iteration, insertion sort r
2017-02-25 12:13:47
296
原创 c 编写Add Two Polynomials
题目： Add Two Polynomials Write a function to add two polynomials. Do not destroy the input. Use a linked list implementation with a dummy head node. Note: The zero polynomial is represented by an
2017-02-25 12:12:43
1498
原创 c编写 Battle Over Cities - Hard Version
Battle Over Cities - Hard Version (20分)It is vitally important to have all the cities connected by highways in a war. If a city is conquered by the enemy, all the highways from/toward that c
2017-02-25 12:11:36
576
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人