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 或郵箱：[email protected]

微信：codinghelp

JAVA 圖作業算法實現、代寫Graphs 數據結構作業