Difference between revisions of "Part 2 Test Files"
From CMSC 420
m |
|||
| Line 16: | Line 16: | ||
**[http://www.glue.umd.edu/~teqdruid/maxP3import.input.xml maxP3import.input.xml] | **[http://www.glue.umd.edu/~teqdruid/maxP3import.input.xml maxP3import.input.xml] | ||
**[http://www.glue.umd.edu/~teqdruid/maxP3import.output.xml maxP3import.output.xml] | **[http://www.glue.umd.edu/~teqdruid/maxP3import.output.xml maxP3import.output.xml] | ||
| + | |||
== Ryan's Nearest City Matlab Script Generator == | == Ryan's Nearest City Matlab Script Generator == | ||
*This script runs with Matlab, just input the number of cities you want to create and a filename to save the generated input file - nearestCity(numPoints, fileName). Basically, the script randomly picks two points in a 1024x1024 window, point A and B. Point A is used for reference, while point B is actually mapped. The distance between A and B represents the minimum distance all other points must have from the reference point A. As each new point is generated, a road is mapped from the new point to point B, this way roads shouldn't intersect. (Intersections will occur on a VERY, VERY rare basis.) Run the input file and check that the output finds the nearestCity "near". I didn't feel like creating the xml output, so I just look at the last line of the output for the nearest city. (As a note - I was passing all the tests on Part 1 for nearest city and failing them on Part 2 - now I pass them.) | *This script runs with Matlab, just input the number of cities you want to create and a filename to save the generated input file - nearestCity(numPoints, fileName). Basically, the script randomly picks two points in a 1024x1024 window, point A and B. Point A is used for reference, while point B is actually mapped. The distance between A and B represents the minimum distance all other points must have from the reference point A. As each new point is generated, a road is mapped from the new point to point B, this way roads shouldn't intersect. (Intersections will occur on a VERY, VERY rare basis.) Run the input file and check that the output finds the nearestCity "near". I didn't feel like creating the xml output, so I just look at the last line of the output for the nearest city. (As a note - I was passing all the tests on Part 1 for nearest city and failing them on Part 2 - now I pass them.) | ||
**[http://www.wam.umd.edu/~rjmurphy/cmsc420/nearestCity.m nearestCity.m] | **[http://www.wam.umd.edu/~rjmurphy/cmsc420/nearestCity.m nearestCity.m] | ||
Revision as of 03:21, 4 May 2007
Upload and post Part 2 test files here.
You will need to right-click these and do a Save As... just copying/pasting them from your browser will not work.
If you have downloaded and ran someone's test files, mark on the wiki that you verify if outputs correctly. If you have a problem with a test file, mark it on the wiki and discuss it on the forum or possibly on the talk page (although more people would probably see it on the CS forum).
John's B Tree Test Files[edit]
- Verified by: John, Maxim
- These are pretty general and rely on a generic BTree. Some of the tests are pretty much just sanity checks, but the core functionality should be very well tested with this.
John's Part 2 Test Files[edit]
- Verified by: John
- I took Max's part3 test files and ripped whatever I could out of it, then corrected it for start/end ordering and such. Anyway, this should get you most of the way there. A more gnarly shortestPath test would be nice.
Ryan's Nearest City Matlab Script Generator[edit]
- This script runs with Matlab, just input the number of cities you want to create and a filename to save the generated input file - nearestCity(numPoints, fileName). Basically, the script randomly picks two points in a 1024x1024 window, point A and B. Point A is used for reference, while point B is actually mapped. The distance between A and B represents the minimum distance all other points must have from the reference point A. As each new point is generated, a road is mapped from the new point to point B, this way roads shouldn't intersect. (Intersections will occur on a VERY, VERY rare basis.) Run the input file and check that the output finds the nearestCity "near". I didn't feel like creating the xml output, so I just look at the last line of the output for the nearest city. (As a note - I was passing all the tests on Part 1 for nearest city and failing them on Part 2 - now I pass them.)
