[Erlang Systems]

digraph

MODULE

MODULE SUMMARY

DESCRIPTION

EXPORTS

new(Type) -> graph() | {error, Reason}

new() -> graph()

delete(G) -> true

info(G) -> InfoList

add_vertex(G, V, Label) -> vertex()
add_vertex(G, V) -> vertex()
add_vertex(G) -> vertex()

vertex(G, V) -> {V, Label} | false

no_vertices(G) -> integer() >= 0

vertices(G) -> Vertices

del_vertex(G, V) -> true

del_vertices(G, Vertices) -> true

add_edge(G, E, V1, V2, Label) -> edge() | {error, Reason}
add_edge(G, V1, V2, Label) -> edge() | {error, Reason}
add_edge(G, V1, V2) -> edge() | {error, Reason}

edge(G, E) -> {E, V1, V2, Label} | false

edges(G, V) -> Edges

no_edges(G) -> integer() >= 0

edges(G) -> Edges

del_edge(G, E) -> true

del_edges(G, Edges) -> true

out_neighbours(G, V) -> Vertices

in_neighbours(G, V) -> Vertices

out_edges(G, V) -> Edges

in_edges(G, V) -> Edges

out_degree(G, V) -> integer()

in_degree(G, V) -> integer()

del_path(G, V1, V2) -> true

get_path(G, V1, V2) -> Vertices | false

get_short_path(G, V1, V2) -> Vertices | false

get_cycle(G, V) -> Vertices | false

get_short_cycle(G, V) -> Vertices | false

See Also

AUTHORS


stdlib 1.9.1
Copyright © 1991-2000 Ericsson Utvecklings AB