A simple graph class
A simple graph class
Methods
add_edge(n, m[, ws, wp]) | |
add_node(n[, attr]) | |
all_paths(graph, start[, end, path]) | |
children(n) | |
del_node(n) | |
del_node_and_edges(n) | |
down(n) | |
down_short(n) | |
parents(n) | |
shortest_path(graph, start[, end, path]) | |
up(n) | |
up_short(n) |