bend-visgraph

Releases (3)

• 2.0.0.0 indexed
• 1.0.1.0 unindexed
• 1.0.0.0 unindexed

Definitions (237)

visgraph.bend

• def first_halfHow many of the first `count` of `len` points do half the sweeps' work.
• def splitThe sweeps of the first `count` points of `pts`, as two halves of equal work in parallel, `depth` times over.
• def penetrable.built
• def penetrableThe limited penetrable graph of the `n` values `ys` at `xs`, crossing at most `limit` points.
• def optionsts2vg's defaults for the visibility `v`: undirected, unweighted, every weight kept, no point crossed.
• def length
• def fill
• def column
• def counted
• def seriesThe series of the values `ys`, each at its index.
• def counted_at
• def series_atThe series of the values `ys` at `xs`, which must hold as many values, increasing.
• def chosen
• def buildThe graph of `s` with the options `o`, with the edges ts2vg's `build` makes.
• def fold.edges`f(acc, src, dst, w)` over every edge of `g`, in the order the rope holds them, from `acc`.
• def fold
• def degreesThe degree of each node of `g`, as ts2vg's `degrees`: the edges at the node, in either direction.
• def is_undirected
• def bumped
• type Counts
• def count_half
• def count_halves
• def startsThe counts of `n` nodes, in place, as where each node's run starts; slot `n` gets the total.
• type HalvesThe half edges, by target: source, target and weight at each position.
• def put_half
• def place_half
• def by_target
• type Rows
• def put_row
• def by_sourceThe half edges from position `p` on, in target order, into their sources' rows.
• def slots_for
• def rows_done
• def rows_from
• def with_starts
• def with_total
• def tallied
• def adjacencyThe rows of the nodes of `g`.