BitGraph (bitgraph v0.4.5)

Copy Markdown

Documentation for BitGraph.

Summary

Types

t()

Functions

a_star(graph, start, goal, opts \\ [])
add_edge(graph, arg2)
add_edge(graph, from, to, opts \\ [])
add_edges(graph, edges)
add_vertex(graph, vertex, opts \\ [])
add_vertices(graph, vertices)
bipartite_matching(graph, opts \\ [])
copy(graph)
default_opts()
degree(graph, vertex, opts \\ [])
delete_edge(graph, edge)
delete_edge(graph, from, to)
delete_edges(graph, edges)
delete_vertex(graph, vertex)
edges(graph)
edges(graph, vertex, edge_fun \\ &default_edge_info/3, opts \\ [])
get_edge(graph, from, to)
get_neighbor_finder(graph)
get_opt(graph, option)
get_opts(graph)
get_subgraph(graph)
get_vertex(graph, vertex, opts \\ [])
in_degree(graph, vertex, opts \\ [])
in_edges(graph, vertex, edge_fun \\ &default_edge_info/3, opts \\ [])
in_neighbors(graph, vertex, opts \\ [])
isolated_vertex?(graph, vertex)
leaf_vertex?(graph, vertex)
max_index(graph)
neighbors(graph, vertex, opts \\ [])
new(opts \\ [])
num_edges(graph)
num_vertices(graph)
out_degree(graph, vertex, opts \\ [])
out_edges(graph, vertex, edge_fun \\ &default_edge_info/3, opts \\ [])
out_neighbors(graph, vertex, opts \\ [])
set_neighbor_finder(graph, neighbor_finder)
set_opt(graph, option, value)
show_graph(graph, context \\ nil)
strong_components(graph, opts \\ [])
strongly_connected?(graph, opts \\ [])
subgraph(graph, subgraph_vertices, mode \\ :detached)

An induced subgraph on subgraph_vertices

transform_neighbors(graph, vertex, neighbors, transform_fun)
update_opts(graph, opts)
update_vertex(graph, vertex, opts \\ [])
vertex_indices(graph)
vertices(graph, mapper \\ & &1.vertex)

Types

t()

@type t() :: map()

Functions

a_star(graph, start, goal, opts \\ [])

add_edge(graph, arg2)

add_edge(graph, from, to, opts \\ [])

add_edges(graph, edges)

add_vertex(graph, vertex, opts \\ [])

add_vertices(graph, vertices)

bipartite_matching(graph, opts \\ [])

copy(graph)

default_opts()

degree(graph, vertex, opts \\ [])

delete_edge(graph, edge)

delete_edge(graph, from, to)

delete_edges(graph, edges)

delete_vertex(graph, vertex)

edges(graph)

edges(graph, vertex, edge_fun \\ &default_edge_info/3, opts \\ [])

get_edge(graph, from, to)

get_neighbor_finder(graph)

get_opt(graph, option)

get_opts(graph)

get_subgraph(graph)

get_vertex(graph, vertex, opts \\ [])

in_degree(graph, vertex, opts \\ [])

in_edges(graph, vertex, edge_fun \\ &default_edge_info/3, opts \\ [])

in_neighbors(graph, vertex, opts \\ [])

isolated_vertex?(graph, vertex)

leaf_vertex?(graph, vertex)

max_index(graph)

neighbors(graph, vertex, opts \\ [])

new(opts \\ [])

num_edges(graph)

num_vertices(graph)

out_degree(graph, vertex, opts \\ [])

out_edges(graph, vertex, edge_fun \\ &default_edge_info/3, opts \\ [])

out_neighbors(graph, vertex, opts \\ [])

set_neighbor_finder(graph, neighbor_finder)

set_opt(graph, option, value)

show_graph(graph, context \\ nil)

strong_components(graph, opts \\ [])

strongly_connected?(graph, opts \\ [])

subgraph(graph, subgraph_vertices, mode \\ :detached)

An induced subgraph on subgraph_vertices

transform_neighbors(graph, vertex, neighbors, transform_fun)

update_opts(graph, opts)

update_vertex(graph, vertex, opts \\ [])

vertex_indices(graph)

vertices(graph, mapper \\ & &1.vertex)