simple_graph v0.1.0

View Source SimpleGraph.Node (simple_graph v0.1.0)

A Node in the graph. A node has directed edges to others nodes. These nodes are either in the outgoing or in the incoming list. All adjancy nodes are in the adjacent list.

Link to this section Summary

Types

graph_id()
t()

Functions

add_node(list)
create_node(value)
remove_node(list)

Link to this section Types

Link to this type

graph_id()

View Source

Specs

graph_id() :: String.t()
Link to this type

t()

View Source

Specs

t() :: %SimpleGraph.Node{
  adjacent: [graph_id()],
  id: binary(),
  incoming: [graph_id()],
  outgoing: [graph_id()],
  parent: graph_id() | nil,
  subgraphs: [graph_id()],
  value: any()
}

Link to this section Functions

Link to this function

add_node(list)

View Source

Specs

add_node(self: t(), outgoing: t(), incoming: t(), subgraph: t()) ::
  [self: t(), outgoing: t()]
  | [self: t(), incoming: t()]
  | [self: t(), subgraph: t()]
Link to this function

create_node(value)

View Source

Specs

create_node(any()) :: t()
Link to this function

remove_node(list)

View Source

Specs

remove_node(self: t(), outgoing: t(), incoming: t(), subgraph: t()) ::
  [self: t(), outgoing: t()]
  | [self: t(), incoming: t()]
  | [self: t(), subgraph: t()]