标签：web nts enc connect equals string eth hose method
JAVA 图作业算法实现、代写Graphs 数据结构作业
Lab Case – Algorithms and Data Structure, 2017-2018
Phase 3. Graphs
Currently, SharingCar only provides service in ten cities (Madrid, Barcelona,
Valencia, Sevilla, Bilbao, Granada, Toledo, Salamanca, Alicante, Cáceres). Note: you
can ignore the accents.
Every day, SharingCar creates a map with all its travels offered in order to know
the possible connections between cities.
Implement a graph, whose vertices are the cities (you must use an array of String
to store the vertices. In this way, each city is represented by a index from 0 to 9).
Please, take into account that, for example, the offer (Madrid, Barcelona) is not
equal to (Barcelona, Madrid). The class must contain the following methods:
? A constructor method that takes an array of cities and build the basic
structure to create the graph.
? A method, setTravels(LstRequest offers), that takes a list of offers to create
the edges of the graph with the offered travels. For example, if an offer
provides a travel between Madrid (0) and Barcelona (1), the method must
create an edge (with weight equals to 1) between these two vertices. If the
edge already exists, then the method only has to increase its associated
weight. In other words, an edge represents the number of offered travels
from a city to another. Please, explain its time complexity (Big-O function).
? A method, getListDestination(String city), that takes a city and returns all
possible destinations. Please, explain its time complexity (Big-O function).
? A method, getListOrigin(String city), that takes a city and returns all
possible origin to this city. Please, explain its time complexity (Big-O
function).
? A method, getAllCities(), returning all cities in the graph obtained through
a depth traversal.
? A method, nonConnectedCities() that returns a list of cities which are not
connected (there is no path between them). For example, Sevilla is
connected to Barcelona via Toledo and Madrid, but there is no travel from
Barcelona to Sevilla, so (Barcelona, Sevilla) must be part of the returned list.
? Please, explain the space complexity of your data structure.
http://www.6daixie.com/contents/18/1374.html
本团队核心人员组成主要包括硅谷工程师、BAT一线工程师，国内Top5硕士、博士生，精通德英语！我们主要业务范围是代做编程大作业、课程设计等等。
我们的方向领域：window编程 数值算法 AI人工智能 金融统计 计量分析 大数据 网络编程 WEB编程 通讯编程 游戏编程多媒体linux 外挂编程 程序API图像处理 嵌入式/单片机 数据库编程 控制台 进程与线程 网络安全 汇编语言 硬件编程 软件设计 工程标准规等。其中代写代做编程语言或工具包括但不限于以下范围:
C/C++/C#代写
Java代写
IT代写
Python代写
辅导编程作业
Matlab代写
Haskell代写
Processing代写
Linux环境搭建
Rust代写
Data Structure Assginment 数据结构代写
MIPS代写
Machine Learning 作业 代写
Oracle/SQL/PostgreSQL/Pig 数据库代写/代做/辅导
Web开发、网站开发、网站作业
ASP.NET网站开发
Finance Insurace Statistics统计、回归、迭代
Prolog代写
Computer Computational method代做
因为专业，所以值得信赖。如有需要，请加QQ：99515681 或邮箱：99515681@qq.com
微信：codinghelp
标签：web nts enc connect equals string eth hose method
原文地址：https://www.cnblogs.com/gotome/p/8994966.html
