Open cdunn2001 opened 8 years ago
clear()
add_node(v)
has_node(v)
remove_node(v)
g.node[v][key] = value
add_edge(u, v)
add_edge2(u, v)
has_edge(u, v)
remove_edge(u, v)
remove_edge2(u, v)
add_path(edges)
add_path2(edges)
all_nodes()
all_edges()
nodes()
edges()
edges2()
add_edge(u, v, weight/key)
remove_edge(u, v, key=value)
reverse()
clone()
deepCopy()
add_path(path)
seq[Node]
predecessors_iter(node)
in_degree(node)
out_degree(node)
in_edges(node)
out_edges(node)
algorithms.dag.is_directed_acyclic_graph()
shortest_path(g, u, v)
shortest_path(g, u, v, weight)
shortest_path_length(g, u, v, weight)
ego_graph(g, start, radius=1, center=True, undirected=False, distance=None)
falcon_kit/mains/ovlp_to_graph.py
falcon_unzip/phased_ovlp_to_graph.py
undirected=False
radius=10
nx.ego_graph( ug2, n, radius = 10, undirected=False )
weakly_connected_component_subgraphs(g)
falcon_unzip/graphs_to_h_tigs.py
init_reduce_dict()
Ideas from RPG:
clear()
add_node(v)
has_node(v)
remove_node(v)
g.node[v][key] = value
add_edge(u, v)
add_edge2(u, v)
has_edge(u, v)
remove_edge(u, v)
remove_edge2(u, v)
add_path(edges)
add_path2(edges)
all_nodes()
all_edges()
nodes()
edges()
edges2()
add_edge(u, v, weight/key)
API?remove_edge(u, v, key=value)
reverse()
(user can clone first, if needed)clone()
(probably justdeepCopy()
)add_path(path)
(seq[Node]
?)predecessors_iter(node)
in_degree(node)
out_degree(node)
in_edges(node)
out_edges(node)
(with and without keys)algorithms.dag.is_directed_acyclic_graph()
(pypeflow)shortest_path(g, u, v)
unweightedshortest_path(g, u, v, weight)
shortest_path_length(g, u, v, weight)
ego_graph(g, start, radius=1, center=True, undirected=False, distance=None)
(aka neighbour graph)falcon_kit/mains/ovlp_to_graph.py
andfalcon_unzip/phased_ovlp_to_graph.py
undirected=False
radius=10
nx.ego_graph( ug2, n, radius = 10, undirected=False )
weakly_connected_component_subgraphs(g)
falcon_unzip/graphs_to_h_tigs.py
(unzip only)init_reduce_dict()
?