prolog::vertices_edges_to_ugraph/3¶

vertices_edges_to_ugraph(+ Vertices, + Edges, - Graph)*

Given a graph with a set of vertices Vertices and a set of edges Edges, Graph must unify with the corresponding s-representation. Note that the vertices without edges will appear in Vertices but not in Edges. Moreover, it is sufficient for a vertex to appear in Edges.

 ?- vertices_edges_to_ugraph([],[1-3,2-4,4-5,1-5],L).

 L = [1-[3,5],2-[4],3-[],4-[5],5-[]] ?

In this case all edges are defined implicitly. The next example shows three unconnected edges:

 ?- vertices_edges_to_ugraph([6,7,8],[1-3,2-4,4-5,1-5],L).

 L = [1-[3,5],2-[4],3-[],4-[5],5-[],6-[],7-[],8-[]] ?

Private-func:¶

1. prolog::vertices_edges_to_ugraph_3::vertices_edges_to_ugraph/3(int ARG1, int ARG2, int ARG3)():