Hello,
I'd need one example (or more) of a Prolog program written:
- using lists
and
- not using lists
The program could be, for example, in the domain of graphs, trees, or similar. My goal is to measure the execution speed of the two versions (with lists / without lists) of the program.
Thank you in advance.
I'd need one example (or more) of a Prolog program written:
- using lists
and
- not using lists
The program could be, for example, in the domain of graphs, trees, or similar. My goal is to measure the execution speed of the two versions (with lists / without lists) of the program.
Thank you in advance.