Prolog, nodal labeled connected graph -> binary tree

classic Classic list List threaded Threaded
1 message Options
Reply | Threaded
Open this post in threaded view
|  
Report Content as Inappropriate

Prolog, nodal labeled connected graph -> binary tree

bonds1
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.
Loading...