Prolog, nodal labeled connected graph -> binary tree
This post has NOT been accepted by the mailing list yet.
Do you not know how to solve the following problem in Prolog? On the input is entered nodal-labeled connected graph (2 lists). I want to write a program in Prolog, which will decide whether a graph is a binary tree.