DWGraph_Algo - AviaTzadok/ex2 GitHub Wiki

In this class several algorithmic functions are implemented: Copy function Graph in shallow copy (creates pointer). A function that replicates the graph, copies all the values ​​of the graph to a new graph I created. A function that checks if the graph is bound by moving from a random vertex and then through its nicknames to try to reach all the vertices in the graph, if we were able to reach all the vertices in the graph, the graph is bound. A function that searches for the shortest path between two vertices in the graph The function uses a priority column defined using the weight of the nomads and the tag One of the features of Good Priority is updating the column with each addition so when a small figure is added from all the data in the given column the number will be added to the first place in the column . And a function that returns a list of vertices of the shortest path from end to beginning, when we used an auxiliary class that turns the list of vertices.