F.2 Library predicates
AllApplicationManualNameSummaryHelp

  • Documentation
    • Reference manual
      • Summary
        • Library predicates
          • library(aggregate)
          • library(ansi_term)
          • library(apply)
          • library(assoc)
          • library(broadcast)
          • library(charsio)
          • library(check)
          • library(clpb)
          • library(clpfd)
          • library(clpqr)
          • library(csv)
          • library(dcgbasics)
          • library(dcghighorder)
          • library(debug)
          • library(dicts)
          • library(error)
          • library(explain)
          • library(help)
          • library(iostream)
          • library(summaries.d/iostream/tex)
          • library(lists)
          • library(main)
          • library(occurs)
          • 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(settings)
          • library(simplex)
          • library(ugraphs)
          • library(url)
          • library(www_browser)
          • library(solution_sequences)
          • library(thread_pool)
          • library(varnumbers)
          • library(yall)
    • Packages

F.2.39 library(ugraphs)

vertices_edges_to_ugraph/3Create unweighted graph
vertices/2Find vertices in graph
edges/2Find edges in graph
add_vertices/3Add vertices to graph
del_vertices/3Delete vertices from graph
add_edges/3Add edges to graph
del_edges/3Delete edges from graph
transpose_ugraph/2Invert the direction of all edges
neighbors/3Find neighbors of vertice
neighbours/3Find neighbors of vertice
complement/2Inverse presense of edges
compose/3
top_sort/2Sort graph topologically
top_sort/3Sort graph topologically
transitive_closure/2Create transitive closure of graph
reachable/3Find all reachable vertices
ugraph_union/3Union of two graphs