原创 c 編寫Add Two Polynomials

題目:  Add Two Polynomials    Write a function to add two polynomials. Do not destroy the input. Use a linked list implem

原创 c編寫Strongly Connected Components

 Strongly Connected Components   (17分) Write a program to find the strongly connected components in

原创 c編寫 Shortest Path [3]

Shortest Path [3]   (10分) Write a program to not only find the weighted shortest distances, but als

原创 計算理論總結

計算理論複習 正則語言與有窮自動機 可數無窮 正則表達式(注意+不是正則,*是正則; L∅=∅L=∅ ) Σ⋃{(,),∅,⋃,∗} DFA M = (K , Σ , δ , s , F ) where K is a fini

原创 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

原创 c編寫 Shortest Path [4]

4-2 Shortest Path [4]   (10分) Write a program to find the weighted shortest distances from any vert

原创 c編寫 Insertion or Heap Sort

Insertion or Heap Sort   (9分) According to Wikipedia: Insertion sort iterates, consuming one input

原创 c編寫Iterative Mergesort

Iterative Mergesort   (9分) How would you implement mergesort without using recursion? The idea of

原创 c 編寫Public Bike Management

Public Bike Management   (20分) There is a public bike service in Hangzhou City which provides great

原创 c編寫List Components

 List Components   (10分) For a given undirected graph with N vertices and E edges, please list all