A.42 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)
top_sort
(
+Graph, -Sort0, -Sort
)
Generate the difference list Sort-Sort0 as a topological sorting of
Graph
, if one is possible.
top_sort(+Graph,
-Sort0, -Sort)top_sort(+Graph,
-Sort0, -Sort)