Places
Home
Graphs
Prefixes
Admin
Users
Settings
Plugins
Statistics
Repository
Load local file
Load from HTTP
Load from library
Remove triples
Clear repository
RDF quality heuristics
Query
YASGUI SPARQL Editor
Simple Form
SWISH Prolog shell
Help
Documentation
Tutorial
Roadmap
HTTP Services
Login
A.49 library(ugraphs): Unweighted Graphs
All
Application
Manual
Name
Summary
Help
Documentation
Reference manual
The SWI-Prolog library
library(ugraphs): Unweighted Graphs
vertices_edges_to_ugraph/3
vertices/2
edges/2
add_vertices/3
del_vertices/3
add_edges/3
del_edges/3
transpose_ugraph/2
neighbours/3
neighbors/3
complement/2
compose/3
ugraph_union/3
top_sort/2
top_sort/3
transitive_closure/2
reachable/3
Packages
Availability:
:- use_module(
library(ugraphs)
).
(can be autoloaded)
reachable
(
+Vertex, +Graph, -Vertices
)
Unify
Vertices
with the set of all vertices in
Graph
that are reachable from
Vertex
. Example:
?- reachable(1,[1-[3,5],2-[4],3-[],4-[5],5-[]],V). V = [1, 3, 5]
ClioPatria
(version
V3.1.1-40-g9d9e003
)