Showing content from http://dhconnelly.github.io/paip-python/docs/paip/examples/prolog/graph.prolog below:
# construct the graph # a---b---e # \ / / # c---d <- linked(a, b) <- linked(b, c) <- linked(a, c) <- linked(c, d) <- linked(d, e) <- linked(b, e) # node ?y is reachable from node ?x if there exists a path from ?x to ?y <- reachable(?x, ?y) :- linked(?x, ?z), linked(?z, ?y) <- reachable(?x, ?y) :- linked(?x, ?y) <- reachable(?x, ?y) :- linked(?y, ?x) # undirected graph
RetroSearch is an open source project built by @garambo
| Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4