Did you know ... Search Documentation:
Pack flux -- prolog/indigolog/lib/libgraph.pl
PublicShow source

Re-exported predicates

The following predicates are re-exported from other modules

 add_edges(+Graph, +Edges, -NewGraph)
Unify NewGraph with a new graph obtained by adding the list of Edges to Graph. Example:
?- add_edges([1-[3,5],2-[4],3-[],4-[5],
              5-[],6-[],7-[],8-[]],
             [1-6,2-3,3-2,5-7,3-2,4-5],
             NL).
NL = [1-[3,5,6], 2-[3,4], 3-[2], 4-[5],
      5-[7], 6-[], 7-[], 8-[]]

Undocumented predicates

The following predicates are exported, but not or incorrectly documented.

 getNode(Arg1, Arg2)
 getNEdge(Arg1, Arg2, Arg3, Arg4)
 getEdge(Arg1, Arg2, Arg3, Arg4)
 add_node(Arg1, Arg2, Arg3)
 add_edge(Arg1, Arg2, Arg3)
 add_nedges(Arg1, Arg2, Arg3)
 remove_node(Arg1, Arg2, Arg3)
 remove_edges(Arg1, Arg2, Arg3)
 remove_nedges(Arg1, Arg2, Arg3)
 combine_nodes(Arg1, Arg2, Arg3, Arg4)
 path_graph_short(Arg1, Arg2, Arg3, Arg4, Arg5)
 path_graph(Arg1, Arg2, Arg3, Arg4, Arg5)
 sub_graph(Arg1, Arg2, Arg3)