Graph_Algo - shahar-furer/Ex2 GitHub Wiki
class Graph_Algo includes:
- public void init(graph g)-Init this set of algorithms on the parameter - graph.
- public graph copy()-Compute a deep copy of this graph.
- public void init(String file_name)-Init a graph from file.
- public void save-Saves the graph to a file.
- public boolean isConnected-returns true if and only if (iff) there is a valid path from EVREY node to each
other node.
- public double shortestPathDist-returns the length of the shortest path between src to dest.
- public List<node_data> shortestPath-returns the the shortest path between src to dest - as an ordered List of nodes.
- public List<node_data> TSP-computes a relatively short path which visit each node in the targets List.
- private boolean isVisited-return true if all the nodes in the graph were visited,else false.
- private int findMin-return the key of the next minimum vertic in the graph.
- private void resteNodes-the method sets the tag of all of the nodes in the graph to be 0.
- private Collection<node_data> neighboorsList-return a list of the current vertic's neighboors which were not visited yet.
- private int reachableNodes-return number of vertices the node can reach to.
⚠️ **GitHub.com Fallback** ⚠️