Did you know ...
Search Documentation:
Predicate reachable/3
HOME
DOWNLOAD
SWI-Prolog
Sources/building
Docker images
Add-ons
Browse GIT
DOCUMENTATION
Manual
Packages
FAQ
Command line
PlDoc
Bluffers
▶
Prolog syntax
PceEmacs
HTML generation
License
Publications
Rev 7 Extensions
TUTORIALS
Beginner
▶
Getting started
Learn Prolog Now!
Simply Logical
Debugger
Development tools
Advanced
▶
Modules
Grammars (DCGs)
clp(fd)
Printing messages
PlDoc
Web applications
▶
Web applications
Let's Encrypt!
Pengines
Semantic web
▶
ClioPatria
RDF namespaces
Graphics
▶
XPCE
GUI options
Machine learning
▶
Probabilistic Logic Programming
External collections
▶
Meta level tutorials
For packagers
▶
Linux packages
COMMUNITY
Forum & mailing list
Blog
News
Report a bug
Submit a patch
Submit an add-on
Roadmap (on GitHub)
External links
Contributing
Code of Conduct
Contributors
SWI-Prolog items
COMMERCIAL
WIKI
Login
View changes
Sandbox
Wiki help
All tags
Documentation
Reference manual
The SWI-Prolog library
library(ugraphs): Graph manipulation library
vertices/2
vertices_edges_to_ugraph/3
add_vertices/3
del_vertices/3
add_edges/3
ugraph_union/3
del_edges/3
edges/2
transitive_closure/2
transpose_ugraph/2
compose/3
ugraph_layers/2
top_sort/2
neighbors/3
neighbours/3
connect_ugraph/3
complement/2
reachable/3
Packages
Availability:
:- use_module(
library(ugraphs)
).
(can be autoloaded)
reachable
(
+Vertex, +UGraph, -Vertices
)
True when
Vertices
is an ordered set of vertices reachable in
UGraph
, including
Vertex
. Example:
?- reachable(1,[1-[3,5],2-[4],3-[],4-[5],5-[]],V). V = [1, 3, 5]