BitGraph.Algorithm behaviour (bitgraph v0.4.5)

Copy Markdown

Summary

Callbacks

postprocess(t, any)
preprocess(t, t)
run(t, t)

Functions

a_star(graph, start, goal, opts)
acyclic?(graph)
bipartite_matching(graph, opts \\ [])
components(graph)
dfs(graph, opts \\ [])
get_cycle(graph, vertex)
run(graph, impl, opts)
strong_components(graph, opts \\ [])
strongly_connected?(graph, opts \\ [])
topsort(graph)

Callbacks

postprocess(t, any)

@callback postprocess(BitGraph.t(), any()) :: any()

preprocess(t, t)

@callback preprocess(BitGraph.t(), Keyword.t()) :: Keyword.t()

run(t, t)

@callback run(BitGraph.t(), Keyword.t()) :: any()

Functions

a_star(graph, start, goal, opts)

acyclic?(graph)

bipartite_matching(graph, opts \\ [])

components(graph)

dfs(graph, opts \\ [])

get_cycle(graph, vertex)

run(graph, impl, opts)

strong_components(graph, opts \\ [])

strongly_connected?(graph, opts \\ [])

topsort(graph)