His and Hers Graph Algorithms

Due

Introduction

3
A
B
C
-1
A B
A C
B C
-1 -1

Assignment

1. number of vertices
2. number of edges
3. vertex with the most incident edges
4. the time taken to initialize the graph (pre reading)
5. the time taken to read the graph
6. the time taken to process the graph
7. the memory foot-print of your program right before termination.

What to hand in

1. (by 4/11) A one-page design.
2. (by 4/11) A black-box test plan.
3. (on 4/18) A two-up well-formatted listing of your code. You might use something like
   a2ps -T 4 -q -Avirtual -2 -o mycode.ps <file> and then preview the page breaks and general appearance using gv mycode.ps
4. (on 4/18) Your summary report.
5. (on 4/18) Email me a single tar file that includes
   • all your source files
   • your Makefile
   • any auxiliary files that you have accumulated. DO NOT include the generated random graphs! If you did not use a pipe, then delete them when you are done as some will be very large.
   • the output from executing your program on this test plan (number each test).
   • your 1-2 page summary

Notes

1. You need your time to be as precise as possible. Man ctime to find out more.
2. The following code will give you the memory footprint of a process

   #define SM_BUFF_SIZE_PI 100
   
   int getProcessSize() {
     char buffer[SM_BUFF_SIZE_PI];
     int memSize;
     FILE *fileStream;
     pid_t id = getpid();
   
     // Command to execute - uses ps to get the current size and finds the              
     // size for the particular process                                                 
     sprintf(buffer, "ps -eo vsz,vsize,pid | grep %d | ", id);
     strcat(buffer, " awk '{printf(\"%s\\n\", $1);}'");
   
     // Creates a process to get the information and write the result to a              
     // file stream                                                                     
     fileStream = popen(buffer, "r");
     fscanf(fileStream, "%d", &memSize);
     fclose(fileStream);
     return memSize;
   }