程序代写

// Implementation of the Map ADT #include #include #include #include #include #include “Map.h” struct map { * Creates a new map with the given number of cities * Assumes that `numCities` is positive Map MapNew(int numCities) { return NULL; * Frees all memory allocated to the given map void MapFree(Map m) { * Returns the […]

// COMP2521 23T2 Assignment 1 #ifndef MSET_STRUCTS_H #define MSET_STRUCTS_H // DO NOT CHANGE THE NAME OF THIS STRUCT struct node { int item; // DO NOT CHANGE/REMOVE THIS FIELD int count; // DO NOT CHANGE/REMOVE THIS FIELD struct node *left; // DO NOT CHANGE/REMOVE THIS FIELD struct node *right; // DO NOT CHANGE/REMOVE THIS FIELD

// Implementation of the Multiset ADT using a balanced BST // COMP2521 23T2 Assignment 1 #include #include #include #include #include “Mset.h” #include “MsetStructs.h” //////////////////////////////////////////////////////////////////////// // Basic Operations * Creates a new empty mset Mset MsetNew(void) { return NULL; * Frees all memory allocated to the given mset void MsetFree(Mset s) { * Inserts one of

// Main program for testing the Map ADT #include #include #include #include #include “Map.h” void testSetName(void); void testInsertRoad(void); void testGetRoadsFrom(void); int main(int argc, char *argv[]) { testSetName(); testInsertRoad(); testGetRoadsFrom(); void testSetName(void) { Map m = MapNew(5); char name1[] = “sydney”; assert(strcmp(MapGetName(m, 0), “unnamed”) == 0); MapSetName(m, 0, name1); // Overwriting the name1 string with something

// Main program for testing the multiset ADT // COMP2521 23T2 Assignment 1 #include #include #include #include #include “Mset.h” // These functions are deliberately not static to make testing more // convenient. void testMsetInsert(void); void testMsetInsertMany(void); void testMsetSize(void); void testMsetTotalCount(void); void testMsetGetCount(void); void testMsetShow(void); void testMsetUnion(void); void testMsetIntersection(void); void testMsetSum(void); void testMsetDifference(void); void testMsetIncluded(void); void

======================================================================== Complexity Analysis ======================================================================== – Your time complexities should be in big-O notation. – For MsetUnion, MsetIntersection, MsetIncluded and MsetEquals, your time complexities should be in terms of n and m, where n and m are the number of distinct elements in each of the multisets respectively. – For MsetMostCommon, your time complexity should be

// Interface to the Agent ADT // !!! DO NOT MODIFY THIS FILE !!! #ifndef AGENT_H #define AGENT_H #include “Map.h” // Constants to represent search strategies used by the agents #define STATIONARY -1 // Useful for debugging #define RANDOM 0 #define CHEAPEST_LEAST_VISITED 1 #define DFS 2 typedef struct agent *Agent; struct move { int staminaCost;

// game.c – the client program. // This reads in data from a file to create a map of cities and roads, // then reads in data to create 5 agents: 4 detectives and a thief. // It then runs a simulation where the thief and detectives move // through the cities. // !!! DO