add a function n_edges to count the number of edges in a graph
add arguments to the class
add a function to get the list of vertices in a graph
add a function to return the smallest edge
get_nearest and clean_graph functions added.
get_nearest:
return two vertices. One of the subgraph with the shortest distance
from the other one of the graph but not present in the subgraph
clean_graph:
remove long range edges in a graph
In getLongestPath add an argument: localmin
If localmin is set to True the path goes through local minima.
Work in progress...
TODO: compute shortest path between local minima along the path
testset updated with graph
work in progress for graph simplification algorithm
add a function to get all distances in a graph: get_distances(self, graph=None)
change the output of get_distances to return only unique distances in a graph
add a function to select edge with length below a threshold: select_edges(self, threshold, graph=None)
work in progress for clean_graph function
work in progress for clean_graph function
work in progress for clean_graph function
split_graph removed
testset updated for SOMgraph improvments