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)的更多相关文章

  1. CSIS 1119B/C Introduction to Data Structures and Algorithms

    CSIS 1119B/C Introduction to Data Structures and Algorithms Programming Assignment TwoDue Date: 18 A ...

  2. 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 ...

  3. 剪短的python数据结构和算法的书《Data Structures and Algorithms Using Python》

    按书上练习完,就可以知道日常的用处啦 #!/usr/bin/env python # -*- coding: utf-8 -*- # learn <<Problem Solving wit ...

  4. [Data Structures and Algorithms - 1] Introduction &amp; Mathematics

    References: 1. Stanford University CS97SI by Jaehyun Park 2. Introduction to Algorithms 3. Kuangbin' ...

  5. 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 ...

  6. 学习笔记之Problem Solving with Algorithms and Data Structures using Python

    Problem Solving with Algorithms and Data Structures using Python — Problem Solving with Algorithms a ...

  7. Algorithms &amp; Data structures in C++&amp; GO ( Lock Free Queue)

    https://github.com/xtaci/algorithms //已实现 ( Implemented ): Array shuffle https://github.com/xtaci/al ...

  8. Persistent Data Structures

    原文链接:http://www.codeproject.com/Articles/9680/Persistent-Data-Structures Introduction When you hear ...

  9. Choose Concurrency-Friendly Data Structures

    What is a high-performance data structure? To answer that question, we're used to applying normal co ...

随机推荐

  1. RestTemplate发送请求并携带header信息

    1.使用restTemplate的postForObject方法 注:目前没有发现发送携带header信息的getForObject方法. HttpHeaders headers = new Http ...

  2. push notification获取device token

    第一步:申请证书: 第二步:申请app ids,应用名字必须一致.然后再进入进行编辑,使其enable,绿灯. 第三步:申请provisioning profile,生成.mobileprovisio ...

  3. Linux动态库的编译与使用 转载

    http://hi.baidu.com/linuxlife/blog/item/0d3e302ae2384d3a5343c1b1.html Linux下的动态库以.so为后缀,我也是初次在Linux下 ...

  4. Spring中加载ApplicationContext.xml文件的方式

    Spring中加载ApplicationContext.xml文件的方式 原文:http://blog.csdn.net/snowjlz/article/details/8158560 1.利用Cla ...

  5. 配置.NET程序使用代理进行HTTP请求

    方式一:代码方式 var defaultProxy = new WebProxy(); defaultProxy.Address = new Uri("http://proxy:8080&q ...

  6. iOS开发:详解Objective-C runTime

    Objective-C总Runtime的那点事儿(一)消息机制 最近在找工作,Objective-C中的Runtime是经常被问到的一个问题,几乎是面试大公司必问的一个问题.当然还有一些其他问题也几乎 ...

  7. C语言 内存管理(转)

     转自 https://blog.csdn.net/u011616739/article/details/61621815 C语言 内存管理 1.内存分区 C源代码进过预处理.编译.汇编和链接4步生成 ...

  8. ubuntu Fcitx 输入法 选择 黑框问题 解决方案

    在虚拟机装了个xubuntu,弄好fcitx 输入法后,打字时看不到选择框,被黑框折腾的不行,后来了一个方法,暂时解决了问题. 用 killall fcitx-qimpanel 结束 fcitx-qi ...

  9. F3D模式规则详解

    F3D有两个版本,长期版还有短期版 长期版规则 1.购买时候分配 第一队 20% to 奖金池, 56%分给所有人, 30% 持有p3d的人第二队 35% to 奖金池, 43%分给所有人, 8% 持 ...

  10. Java泛型知识点全方位总结

    前言 我一直认为泛型是编程语言设计中一个非常基本和重要的概念.Java中的泛型是什么?他们为什么在那里?他们是如何发展的?在学习基础知识时,对仿制药的透彻理解是非常重要的.因此,我阅读了<Jav ...