digraph
Functions
new() -> term()
new(Type) -> term()
delete(G) -> term()
info(G) -> term()
add_vertex(G) -> term()
add_vertex(G, V) -> term()
add_vertex(G, V, D) -> term()
del_vertex(G, V) -> term()
del_vertices(G, Vs) -> term()
vertex(G, V) -> term()
no_vertices(G) -> term()
vertices(G) -> term()
source_vertices(G) -> term()
sink_vertices(G) -> term()
in_degree(G, V) -> term()
in_neighbours(G, V) -> term()
in_edges(G, V) -> term()
out_degree(G, V) -> term()
out_neighbours(G, V) -> term()
out_edges(G, V) -> term()
add_edge(G, V1, V2) -> term()
add_edge(G, V1, V2, D) -> term()
add_edge(G, E, V1, V2, D) -> term()
del_edge(G, E) -> term()
del_edges(G, Es) -> term()
no_edges(G) -> term()
edges(G) -> term()
edges(G, V) -> term()
edge(G, E) -> term()
del_path(G, V1, V2) -> term()
get_cycle(G, V) -> term()
get_path(G, V1, V2) -> term()
get_short_cycle(G, V) -> term()
get_short_path(G, V1, V2) -> term()
View Functions
- new/0
- new/1
- delete/1
- info/1
- add_vertex/1
- add_vertex/2
- add_vertex/3
- del_vertex/2
- del_vertices/2
- vertex/2
- no_vertices/1
- vertices/1
- source_vertices/1
- sink_vertices/1
- in_degree/2
- in_neighbours/2
- in_edges/2
- out_degree/2
- out_neighbours/2
- out_edges/2
- add_edge/3
- add_edge/4
- add_edge/5
- del_edge/2
- del_edges/2
- no_edges/1
- edges/1
- edges/2
- edge/2
- del_path/3
- get_cycle/2
- get_path/3
- get_short_cycle/2
- get_short_path/3