Oi.Topology.Graph (oi v0.1.0)

The pure mathematical representation of the DAG.

Summary

Types

t()

t(container_type)

Functions

add_edge(graph, edge)

add_node(graph, node)

get_in_edges(graph, node_id)

Get all input edges pointing to a given node

get_out_edges(graph, node_id)

Get all output edges emanating from a given node.

new()

remove_edge(graph, edge)

remove_node(graph, node_id)

same?(graph1, graph2)

topological_sort(graph)

update_node(graph, node_id, new_node)

Types

t()

@type t() :: t(term())

t(container_type)

@type t(container_type) :: %Oi.Topology.Graph{
  edges: MapSet.t(Oi.Topology.Graph.Edge.t()),
  in_edges: %{
    required(Oi.Topology.Graph.Node.id()) => [Oi.Topology.Graph.Edge.t()]
  },
  nodes: %{
    required(Oi.Topology.Graph.Node.id()) =>
      Oi.Topology.Graph.Node.t(container_type)
  },
  out_edges: %{
    required(Oi.Topology.Graph.Node.id()) => [Oi.Topology.Graph.Edge.t()]
  }
}

Functions

add_edge(graph, edge)

add_node(graph, node)

get_in_edges(graph, node_id)

@spec get_in_edges(t(), Oi.Topology.Graph.Node.id()) :: [Oi.Topology.Graph.Edge.t()]

Get all input edges pointing to a given node

get_out_edges(graph, node_id)

@spec get_out_edges(t(), Oi.Topology.Graph.Node.id()) :: [Oi.Topology.Graph.Edge.t()]

Get all output edges emanating from a given node.

new()

remove_edge(graph, edge)

remove_node(graph, node_id)

same?(graph1, graph2)

topological_sort(graph)

@spec topological_sort(t()) ::
  {:ok, [Oi.Topology.Graph.Node.id()]} | {:error, :cycle_detected}

update_node(graph, node_id, new_node)