package containers
A modular, clean and powerful extension of the OCaml standard library
Install
Dune Dependency
Authors
Maintainers
Sources
v2.8.tar.gz
md5=03b80e963186e91ddac62ef645bf7fb2
sha512=c8f434808be540c16926bf03d89f394d33fc2d092f963a7b6d412481229e0a96290f1ad7c7d522415115d35426b7aa0b3fda4b991ddc321dad279d402c9a0c0b
doc/containers.data/CCGraph/Traverse/index.html
Module CCGraph.Traverse
Source
Traversal of the given graph, starting from a sequence of vertices, using the given bag to choose the next vertex to explore. Each vertex is visited at most once.
Source
val generic_tag :
tags:'v tag_set ->
bag:'v bag ->
graph:('v, 'e) t ->
'v iter ->
'v iter_once
One-shot traversal of the graph using a tag set and the given bag.
Source
val dijkstra :
tbl:'v set ->
?dist:('e -> int) ->
graph:('v, 'e) t ->
'v iter ->
('v * int * ('v, 'e) path) iter_once
Dijkstra algorithm, traverses a graph in increasing distance order. Yields each vertex paired with its distance to the set of initial vertices (the smallest distance needed to reach the node from the initial vertices).
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>