prolog::dgraph_del_edge/4¶

dgraph_del_edge(+ Graph, + N1, + N2, - NewGraph)*

Succeeds if NewGraph unifies with a new graph obtained by removing the edge N1- N2 from the graph Graph. Notice that no vertices are deleted.

Private-func:¶

1. prolog::dgraph_del_edge_4::dgraph_del_edge/4(int ARG1, int ARG2, int ARG3, int ARG4)():