bitgraph
v0.1.6
Search documentation of bitgraph
Settings
BitGraph
(bitgraph v0.1.6)
Documentation for
BitGraph
.
Summary
Functions
add_edge(graph, from, to, opts \\ [])
add_edges(graph, edges)
add_vertex(graph, vertex, opts \\ [])
add_vertices(graph, vertices)
copy(graph)
default_opts()
degree(graph, vertex)
delete_edge(graph, from, to)
delete_edges(graph, edges)
delete_vertex(graph, vertex)
edges(graph)
edges(graph, vertex, edge_fun \\ &default_edge_info/3)
get_edge(graph, from, to)
get_vertex(graph, vertex, opts \\ [])
in_degree(graph, vertex)
in_edges(graph, vertex, edge_fun \\ &default_edge_info/3)
in_neighbors(graph, vertex)
neighbors(graph, vertex)
new(opts \\ [])
num_edges(graph)
num_vertices(graph)
out_degree(graph, vertex)
out_edges(graph, vertex, edge_fun \\ &default_edge_info/3)
out_neighbors(graph, vertex)
subgraph(graph, subgraph_vertices)
Creates a subgraph on
subgraph_vertices
update_vertex(graph, vertex, opts \\ [])
vertex_indices(graph)
vertices(graph)
Functions
add_edge(graph, from, to, opts \\ [])
add_edges(graph, edges)
add_vertex(graph, vertex, opts \\ [])
add_vertices(graph, vertices)
copy(graph)
default_opts()
degree(graph, vertex)
delete_edge(graph, from, to)
delete_edges(graph, edges)
delete_vertex(graph, vertex)
edges(graph)
edges(graph, vertex, edge_fun \\ &default_edge_info/3)
get_edge(graph, from, to)
get_vertex(graph, vertex, opts \\ [])
in_degree(graph, vertex)
in_edges(graph, vertex, edge_fun \\ &default_edge_info/3)
in_neighbors(graph, vertex)
neighbors(graph, vertex)
new(opts \\ [])
num_edges(graph)
num_vertices(graph)
out_degree(graph, vertex)
out_edges(graph, vertex, edge_fun \\ &default_edge_info/3)
out_neighbors(graph, vertex)
subgraph(graph, subgraph_vertices)
Creates a subgraph on
subgraph_vertices
update_vertex(graph, vertex, opts \\ [])
vertex_indices(graph)
vertices(graph)