🚀 go-pugleaf

Occasionally I have written a predicate that yields duplicate solutions, and
I've wondered how to make each solution occur uniquely.  For example, I have
a multigraph:

	node(X).             % X is a node.
	edge(E, X, Y).       % E is a directed edge from node X to node Y.

I write a predicate:

	joined(X, Y).        % There exists an edge from node X to node Y.

Initially I write:

	joined(X, Y) :-
		edge(_, X, Y).

But this version has duplicate solutions when there are multiple edges from
X to Y.  The most straightforward way I have been able to avoid this is:

	joined(X, Y) :-
		bagof(E, edge(E,X,Y), _).

The use of bagof/3 seems wasteful.  I could use setof/3 instead and think of
the set of edges as a "hyperedge" from X to Y, but I don't really need to
compute the hyperedge -- just determine the existence of one.

Usually, the existence of duplicate solutions makes me change either my data
model or my algorithms to avoid them.  But in this example, my data model is
straightforward, joined/2 seems like a natural thing to have, and duplicate
solutions bother me (I'm not sure why, though).  What would you do to avoid
duplicate solutions, or would you even bother?


Patrick Chkoreff   719-590-5983
{hpfcla,hplabs}!hpldola!patch