BitGraph.E (bitgraph v0.1.15)

Summary

Types

t()

@type t() :: %BitGraph.E{from: any(), opts: Keyword.t(), to: any()}

Functions

add_edge(graph, from, to)

default_neighbor_finder()

delete_edge(graph, from, to)

delete_edges(graph, vertex)

edge?(graph, from, to)

edges(graph)

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

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

init_edges(opts)

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

new(from, to, opts \\ [])

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

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