ECE220生存指南[05]MP10:动态生成数组空间

算法旅人

2021年12月10日

这次的MP依旧来者不善，他是我们的倒数第二个MP，是上次MP9的延续，这次需要我们去思考更大的地图，去动态分配我们的算法所需要的空间，这样才不会core dumped 

  Mieber: Walk Me There, Part II

Your task this week is to extend last week’s program to make use of dynamic allocation in several ways and to attempt to pair up requests from a list of many requests. For this purpose, you must also implement and use structures designed to help improve performance. In particular, you must write C subroutines that manage dynamic allocation of vertex sets and paths, subroutines that enable, calculate, and use “mini maps” based on a high level of a pyramid tree, and a subroutine that attempts to find a partner for a request among a linked list of unpaired requests. Successful pairings must then be moved into a list of paired requests. The objective for this week is for you to gain experience with dynamic allocation and singly-linked lists in C.