⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 timelog.txt

📁 game implemented java
💻 TXT
字号:
Hours worked on CitySim

11:00 Setting up initial form, getting basic tasks working
05:00 Experimenting with OpenGL graphics
12:00 Implementing GDI+ graphics, drawing city map (w/intersections) from CSV file.
05:15 (10/17/04) Expanding properties of MapSeg class, developing second form.
07:30 (10/19/04) Expanded properties of Intersection class, finalized forms for both
		MapSeg and Intersection editing.  Cleaned up mouse events.
03:00 (10/25/04) Began work on Car class, got coordinants working
05:30 (10/26/04) Cars now move on intersections, find best intersection to move to,
		There is currently no support for intersection state, or consideration of
		other cars.
01:00 (10/27/04) MapSegs now store arraylists of cars in them (seperate list for each 
		direction).  This will allow the Car.Drive() function to take traffic into 
		account.
06:00 (11/03/04) Implemented A* shortest path algorithm, cars get path before sim starts.
		There is still a bug where with too many cars (~100) ArrayLists aren't passed 
		correctly. 
02:00 (11/03/04) Debugged A*, now always works.  Added progress bar to demonstrate progress
		plotting shortest routes.  Will have to look at ways to speed progress, though, 
		because takes minutes for 1000 cars.
06:00 (11/10/04) Implemented drive function so that arrival is assured, still working on
		moving along a map segment.  Added ability to turn off graphics so simulation gets
		100% of runtime.  Tested aStar and started to work on improving the Intersection
		class.
06:45 (11/11/04) Updated Intersection object for more sophistication, began 
		tinkering with analyze() function to identify thru streets in intersections.
		Currently identifies about 1/3 of all intersections.  Added visual reporting 
		after simulation ends that shows where congestion occurred.		
03:00 (11/23/04) Sketeched out pseudocode for A* data structure.  Balanced Binary Tree
		based upon F(n) costs with an array to allow O(1) time deletion if not in tree 
		and O(lg n) time deletion if in tree.
02:00 (11/30/04) Fixed thru-street identifier to use distance ratios and street names.
		now finds all but ~150 intersections correctly.  Began work on form to allow
		user modifications (and entry for indecipherable intersections)
05:45 (12/01/04) Finalized ThruStreet design, redid intersection type changer, reworked
		form for initial entry.
03:15 (12/07/04) Began switch from array management of A* to Red-Black Tree in an attempt
		to achieve O(n lg n) runtime.
05:30 (12/08/04) Completed switch, although simulation setup time is basically unchanged.
		Made significant progress on the Car.Drive() function taking into consideration
		the restructured intersection model.
07:45 (12/13/04) Finished programming Car.Drive().  Debugged program and added some minor
		functionality that allows greater user input.  Failed to speed up simulation
		preperation.
09:00 (12/15/04) Wrote 10 page report, tested program to ensure there weren't any more
		hidden bugs likely to appear as the number of cars being simulated increased.
04:15 (12/16/04) Caught a few final nagging bugs, commented code, made and submitted
		webpage.
-----
111:30 TOTAL TIME SPENT

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -