strand v0.2.0 Strand.Protocols.Graph protocol

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

Types

t()
t() :: term

Functions

edges(g)

calculates the edges of a graph

has_edge?(g, e)

determines if a graph has an edge

has_node?(g, n)

determines if a graph has a node

nodes(g)

calculates the nodes of a graph

out_degree(g, n)

counts the outbound edges of a node

out_edges(g, n)

calculates the outbound edges of a node

successors(g, n)

calculates a node’s successors