Programming paradigms

Pathfinding in directed graphs – brief introduction to Prolog

Let’s imagine, that you have directed graph (like this I drawn and pasted below) and you have to write some part of code to find all paths between two nodes. Why not to do that using another paradigm than those to which we have got used to?


Continue reading