- Documentation
- Reference manual
- Summary
- Library predicates
- library(aggregate)
- library(apply)
- library(assoc)
- library(broadcast)
- library(charsio)
- library(check)
- library(clpb)
- library(clpfd)
- library(clpqr)
- library(csv)
- library(debug)
- library(error)
- library(iostream)
- library(summaries.d/iostream/tex)
- library(lists)
- library(main)
- library(option)
- library(optparse)
- library(ordsets)
- library(persistency)
- library(predicate_options)
- library(prologpack)
- library(prologxref)
- library(pairs)
- library(pio)
- library(random)
- library(readutil)
- library(record)
- library(registry)
- library(simplex)
- library(ugraphs)
- library(url)
- library(www_browser)
- library(solution_sequences)
- library(thread_pool)
- library(varnumbers)
- library(yall)
- Library predicates
- Summary
- Packages
- Reference manual
F.2.31 library(ugraphs)
| vertices_edges_to_ugraph/3 | Create unweighted graph |
| vertices/2 | Find vertices in graph |
| edges/2 | Find edges in graph |
| add_vertices/3 | Add vertices to graph |
| del_vertices/3 | Delete vertices from graph |
| add_edges/3 | Add edges to graph |
| del_edges/3 | Delete edges from graph |
| transpose_ugraph/2 | Invert the direction of all edges |
| neighbors/3 | Find neighbors of vertice |
| neighbours/3 | Find neighbors of vertice |
| complement/2 | Inverse presense of edges |
| compose/3 | |
| top_sort/2 | Sort graph topologically |
| top_sort/3 | Sort graph topologically |
| transitive_closure/2 | Create transitive closure of graph |
| reachable/3 | Find all reachable vertices |
| ugraph_union/3 | Union of two graphs |