Strand.Protocol.Graph protocol (strand v0.6.0)
Link to this section Summary
Functions
calculates the edges of a graph
determines if a graph has an edge
determines if a graph has a node
calculates the nodes of a graph
counts the outbound edges of a node
calculates the outbound edges of a node
calculates a node's successors
Link to this section Types
Specs
t() :: term()
Link to this section Functions
Link to this function
edges(g)
calculates the edges of a graph
Link to this function
has_edge?(g, e)
determines if a graph has an edge
Link to this function
has_node?(g, n)
determines if a graph has a node
Link to this function
nodes(g)
calculates the nodes of a graph
Link to this function
out_degree(g, n)
counts the outbound edges of a node
Link to this function
out_edges(g, n)
calculates the outbound edges of a node
Link to this function
successors(g, n)
calculates a node's successors