vason的博客

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

题目： 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

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

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

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

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

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

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

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