elonezra
commented
4 years ago ToDo
-
[ ] public graph copy();
* Compute a deep copy of this graph. -
[ ] public boolean isConnected(); `* Returns true if and only if (iff) there is a valid path from EVREY node to each
- other node. NOTE: assume directional graph - a valid path (a-->b) does NOT imply a valid path (b-->a). `
-
[ ] public List
TSP(List targets); -
[x] public void init(graph g);
* Init this set of algorithms on the parameter - graph. -
[x] public double shortestPathDist(int src, int dest);
returns the length of the shortest path between src to dest -
[x] public List
shortestPath(int src, int dest); `returns the the shortest path between src to dest - as an ordered List of nodes: - src--> n1-->n2-->...dest
-
@param src - start node
-
@param dest - end (target) node`
-
[x] public void init(String file_name);
* Init a graph from file -
[x] public void save(String file_name);
Saves the graph to a file.
` * computes a relatively short path which visit each node in the targets List.\n
- Note: this is NOT the classical traveling salesman problem,
- as you can visit a node more than once, and there is no need to return to source node -
- just a simple path going over all nodes in the list.
- @param targets`
[ ] public boolean isConnected();
[ ] public List TSP(List targets);
[x] public graph copy();
It represents a collection of algorithms on directed and weighted graph.
operation on graph