Strand.Protocol.Digraph protocol (strand v0.6.0)

Link to this section Summary

Functions

counts the inbound edges of a node

calculates the inbound edges of a node

calculates the nodes that precede a node

reverses a directed graph

Link to this section Types

Specs

t() :: term()

Link to this section Functions

Link to this function

in_degree(dg, n)

counts the inbound edges of a node

Link to this function

in_edges(dg, n)

calculates the inbound edges of a node

Link to this function

predecessors(dg, n)

calculates the nodes that precede a node

reverses a directed graph