Posts by Marcel Matsumoto • 11 points

• 1

  votes

  1

  answer

  21

  views

  Q: Get detailed path in PROLOG wide search

  Given the width search on graphs in Prolog, a graph where one node connects to the other via the connected fact(a,b). connected(b,c). connected(b,e). And so on, the algorithm would normally work by…

  prolog

  asked 3 years, 6 months ago Marcel Matsumoto 11