![](https://img-blog.csdnimg.cn/20201014180756925.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
ds
文章平均质量分 76
vasonv
擅长写bug
展开
-
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 · 567 阅读 · 0 评论 -
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 · 1479 阅读 · 0 评论 -
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 · 283 阅读 · 0 评论 -
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 · 1199 阅读 · 0 评论 -
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 · 1190 阅读 · 0 评论 -
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 · 410 阅读 · 0 评论 -
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 · 254 阅读 · 0 评论 -
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 · 2644 阅读 · 0 评论 -
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 · 365 阅读 · 0 评论