Graph_Algo - shirabs/Ex_2 GitHub Wiki

In this class we solved a algorithmic problems as - What is the shortest path in the graph, does the graph is a connective graph, how to read graph from file and how save graph as file.

---

• public Graph_Algo()

Create new graph.

• public Graph_Algo(graph g)

Create copy of the graph.

• public void init(graph g)

This method get a graph from the user or from file and make him to the algo graph.

• public void save(String file_name)

This method get a optional name and save the graph to a file.

• public boolean isConnected()

This method check if exist a valid path from EVREY node to each.

• public boolean connect(graph g)

• public double shortestPathDist(int src, int dest)

This method get Src and Dest that represented by the key of the desired nodes and returns the length of the shortest path between src to dest.

• public List<node_data> shortestPath(int src, int dest)

This method get Src and Dest that represented by the key of the desired nodes and return the vertexes that should pass in the shortest path.

• public List<node_data> TSP(List targets)

This method get group of Vertexes and return the most optional Path to visit each node in the targets List.

• public graph copy()

Create deep copy of the graph.

• private void upnode_max_and_notvisit_and_info()

• private int smallest_node()

Get the Smallest node.

• private boolean visitall()

Check if we visit in all nodes.

• public String toString()

Return string of the graph.