CPSolver.Utils.Digraph (Fixpoint v0.10.2)

Summary

Functions

add_edge(dg, v1, v2)
add_edge(dg, v1, v2, label)
add_edge(dg, e, v1, v2, label)
add_vertex(dg, v)
add_vertex(dg, v, label)
delete(dg)
delete_edge(dg, e)
delete_edges(dg, edges)
delete_path(dg, v1, v2)
delete_vertex(dg, v)
delete_vertices(dg, vertices)
edge(dg, e)
edges(dg)
edges(dg, v)
from_libgraph(graph)
get_cycle(dg, v)
get_path(dg, v1, v2)
get_short_cycle(dg, v)
get_short_path(dg, v1, v2)
in_degree(dg, v)
in_edges(dg, v)
in_neighbours(dg, v)
new(opts \\ [])
no_edges(dg)
no_vertices(dg)
out_degree(dg, v)
out_edges(dg, v)
out_neighbours(dg, v)
to_libgraph(digraph)
vertex(dg, v)
vertices(dg)

Functions

add_edge(dg, v1, v2)

add_edge(dg, v1, v2, label)

add_edge(dg, e, v1, v2, label)

add_vertex(dg, v)

add_vertex(dg, v, label)

delete(dg)

delete_edge(dg, e)

delete_edges(dg, edges)

delete_path(dg, v1, v2)

delete_vertex(dg, v)

delete_vertices(dg, vertices)

edge(dg, e)

edges(dg)

edges(dg, v)

from_libgraph(graph)

get_cycle(dg, v)

get_path(dg, v1, v2)

get_short_cycle(dg, v)

get_short_path(dg, v1, v2)

in_degree(dg, v)

in_edges(dg, v)

in_neighbours(dg, v)

new(opts \\ [])

no_edges(dg)

no_vertices(dg)

out_degree(dg, v)

out_edges(dg, v)

out_neighbours(dg, v)

to_libgraph(digraph)

vertex(dg, v)

vertices(dg)