provides a minimalistic graph implementation suitable for analysis of chemical problems,
even if some care was taken to make the graph work with nonsimple graphs, there are cases where it won't!
Methods
|
|
__str__
add_edge
get_connected_components
get_diameter
get_random_longest_path_numbered
|
|
__str__
|
__str__ ( self )
|
|
add_edge
|
add_edge (
self,
v1,
v2,
e=None,
)
adds an edge to a graph connecting vertices v1 and v2, if e argument is not given creates a new one.
returns None if operation fails or the edge instance if successful
|
|
get_connected_components
|
get_connected_components ( self )
returns the connected components of graph in a form o list of lists of vertices
|
|
get_diameter
|
get_diameter ( self )
|
|
get_random_longest_path_numbered
|
get_random_longest_path_numbered (
self,
start,
end,
)
vertices have to be freshly marked with distance
|
|