CSC 172 (Data Structures and Algorithms)
Project #3 (STREET MAPPING)
CSC 172 (Data Structures and Algorithms), Spring 2019,
University of Rochester
Due Date: WED 05/01 11:59 PM
You can work alone or in a team (max.size of 2).
Introduction
This project will require you to create a rudimentary mapping program in Java. Given a data set representing the
roads and intersections in a specific geographic region, your program should be able to plot a map of the data and
provide shortest path directions between any two arbitrary intersections.
Input Data
The geographical data necessary to run your application is provided in the format of a tab-delimited text files.Each
line will consist of 4 pieces of data, as defined below:
Intersections start with “i”, followed by a unique string ID, and decimal representations of latitude and longitude.
i IntersectionID Latitude Longitude
Roads start with “r”, followed by a unique string ID, and the IDs of the two intersections it connects.
r RoadID Intersection1ID Intersection2ID
You may safely assume that all input files will declare intersections before their IDs are used in roads. Three different
data sets are provided for your testing purposes with this project. The first data set, ur.txt represents a subset
of the pedestrian sidewalks on our campus. Building entrances have meaningful intersection IDs such as “CSB” or
“SUEB” for your convenience. The second and third data set test your program’s ability to scale well, with the latest
census data on roads in Monroe County and NYS. The three datasets are attached to the announcement in a zip file.
Project #3 (STREET MAPPING) Page 1 / 3
Deliverable
Your program will be evaluated on how well it accomplishes the following two tasks and command line specification:
Basic Mapping
Implement your own Graph, Node and Edge classes. For this you may use code available online or other
sources, but you must cite the source.
Construct a Graph object using the information read in from the specified input file
Draw the map using Java Graphics (no third party graphing libraries allowed. Talk to your lab TAs for further
clarification if required). The map should scale with the size of the window.
Directions Between Intersections
Implement Dijkstra’s algorithm to find the shortest path between any two arbitrary intersections, as provided
by the command line arguments.
代写CSC 172作业、代写Data Structures作业、java实验作业代做、java程序语言作业调试
When the shortest path has been discovered, the intersections followed to reach the destination should be
printed out to the console in order. Additionally, your program should print out the total distance traveled in
miles.
Finally, if the program is displaying the map, it should highlight (in a different color, stroke width, etc.) the
solution path found.
Command Line Arguments
Your program should accept the following set of command line arguments:
java StreetMap map . txt [ -- show ] [-- directions startIntersection
endIntersection ]
Your program should only display a map if--showis present. Below, you can find how a few of the sample runs
may look like:
java StreetMap ur . txt -- show -- directions HOYT MOREY// Showing both map
and the directions
java StreetMap ur . txt -- show // Just showing the map
java StreetMap ur . txt -- directions HOYT MOREY// Showing the map is
optional .
Getting Started
It is highly recommended that you get your program to work with the UR campus map before moving onto Monroe
County or NYS map data. The size and complexity of those maps introduce new issues that are best handled after
you’ve mastered the basic project requirements.
Hand In
Each student must submit individually irrespective of whether s/he is working in a team or not.
Hand in the source code from this project at the appropriate location on Blackboard. You should hand in a single
compressed/archived (i.e. “zipped”) file named proj3.zip which contains the following
Project #3 (STREET MAPPING) Page 2 / 3
1. A plain text file named README that includes your (and your team member’s) contact information, a detailed
synopsis of how your code works and any notable obstacles you overcame, and a list of all files included in
the submission. If you worked in a team, you must state how you have distributed the workload.
If you went above and beyond in your implementation and feel that you deserve extra credit for a feature in
your program, be sure to explicitly state what that feature is and why it deserves extra credit.
The README for this project should clearly explain any design or implementation choices you made, the
expected runtime of plotting the map and finding the shortest path between two intersections.
2. Source code files representing the work accomplished in this project. All source code files should contain
author identification in the comments at the top of the file.
Grading Rubric
30% Basic mapping
15% Implementation
15% Correctness
50% Directions between intersections
25% Implementation
25% Correctness
20% README with team-information, detailed description of how you structured your project, approached the
challenges the larger maps presented, and the runtime analysis of your code.
Detailed description of your project should include: A brief summary of how your program works, classes used,
their private and public members and methods. You should state the input and output parameters of each method.
See ‘Hand In’ section for further details.
Extra Credit is available for projects that have interactive and/or exceptionally beautiful maps. The Lab TAs will
decide if you deserve any extra-credit.
For calculating the distance between two intersections, you must use This uses the ‘haversine’ formula.
Checkhttps://en.wikipedia.org/wiki/Haversine_formula . It’s ok to use implementation of this
method found online as it is as long as you cite the source.
There might be two intersections which are not connected.
‘show’ and ‘direction’ may appear in any order.
For a large map, we advice you not to add all intersections to the priority queue at the beginning.
If you use a java.util.PriorityQueue, for changing priority of any entry, you must remove it and add it
again. You are welcome to write your own heap implementation (if you want) to avoid removing the
entry.
Project #3 (STREET MAPPING) Page 3 / 3
因为专业,所以值得信赖。如有需要,请加QQ:99515681 或邮箱:99515681@qq.com
微信:codinghelp
CSC 172 (Data Structures and Algorithms)的更多相关文章
- CSIS 1119B/C Introduction to Data Structures and Algorithms
CSIS 1119B/C Introduction to Data Structures and Algorithms Programming Assignment TwoDue Date: 18 A ...
- Basic Data Structures and Algorithms in the Linux Kernel--reference
http://luisbg.blogalia.com/historias/74062 Thanks to Vijay D'Silva's brilliant answer in cstheory.st ...
- 剪短的python数据结构和算法的书《Data Structures and Algorithms Using Python》
按书上练习完,就可以知道日常的用处啦 #!/usr/bin/env python # -*- coding: utf-8 -*- # learn <<Problem Solving wit ...
- [Data Structures and Algorithms - 1] Introduction & Mathematics
References: 1. Stanford University CS97SI by Jaehyun Park 2. Introduction to Algorithms 3. Kuangbin' ...
- 6-1 Deque(25 分)Data Structures and Algorithms (English)
A "deque" is a data structure consisting of a list of items, on which the following operat ...
- 学习笔记之Problem Solving with Algorithms and Data Structures using Python
Problem Solving with Algorithms and Data Structures using Python — Problem Solving with Algorithms a ...
- Algorithms & Data structures in C++& GO ( Lock Free Queue)
https://github.com/xtaci/algorithms //已实现 ( Implemented ): Array shuffle https://github.com/xtaci/al ...
- Persistent Data Structures
原文链接:http://www.codeproject.com/Articles/9680/Persistent-Data-Structures Introduction When you hear ...
- Choose Concurrency-Friendly Data Structures
What is a high-performance data structure? To answer that question, we're used to applying normal co ...
随机推荐
- esyui datagrid 水平方向下方出来滚动条的原因是因为使用了同一列名
esyui datagrid 水平方向下方出来滚动条的原因是因为使用了同一列名
- Lucene.net 的性能探究--Lucene.net 的并发处理能力到底有多强?
这篇博客并不是证明Lucene.net的性能有多强悍,实际上Lucene.net的并发能力并不让人很满意,这得看你怎么用它. 因为Lucene 本身就是一个搜索引擎的基础框架,相当于一辆车子的发动机, ...
- pta编程总结
币值转换 (20 分) 输入一个整数(位数不超过9位)代表一个人民币值(单位为元),请转换成财务要求的大写中文格式.如23108元,转换后变成“贰万叁仟壹百零捌”元.为了简化输出,用小写英文字母a-j ...
- Building gRPC Client iOS Swift Note Taking App
gRPC is an universal remote procedure call framework developed by Google that has been gaining inter ...
- COSC2309/2347 Semester 1, 2019
Mobile Application DevelopmentCOSC2309/2347 Semester 1, 2019Movie Night PlannerAssignment 1 (20 mark ...
- 2018-2019-2 网络对抗技术 20165317 Exp4 恶意代码分析
2018-2019-2 网络对抗技术 20165317 Exp4 恶意代码分析 实验要求 1.系统运行监控 使用如计划任务,每隔一分钟记录自己的电脑有哪些程序在联网,连接的外部IP是哪里.运行一段时间 ...
- oracle树形结构全路径查询
很实用的语法,父子节点通过id与patientId来关联,知道子节点的id,想查出所有的父节点: START WITH ...CONNECT BY ... SELECT T2.ORG_FULLNAME ...
- opencart3图片Google Merchant Center验证通过不了的解决方法
最近在做一个opencart项目,有对接Google Merchant Center,但是一直提示产品图片验证无法通过,ytkah看了一下图片路径,/image/cache/catalog/demo/ ...
- 3种检测页面是否符合amp标准的方法
AMP的关键优势不仅仅在于它能让你的页面更快,还在于它的快可以被验证.有几种方法可以验证AMP文档,它们都会产生完全相同的结果,选择最适合您的开发风格的方法.除了AMP的有效性,您可能还想确认您的AM ...
- [vue]vue基础复习项案例stepbystep
看本篇第二次复习内容即可. 还有一些 文档了这个如 https://www.cnblogs.com/iiiiiher/p/9508733.html https://www.cnblogs.com/ii ...