Packages

bitgraph

0.3.1
0.4.8 0.4.7 0.4.6 0.4.5 0.4.4 0.4.3 0.4.2 0.4.1 0.3.4 0.3.3 0.3.2 0.3.1 0.2.9 0.2.8 0.2.7 0.2.6 0.2.5 0.2.4 0.2.3 0.2.2 0.2.1 0.1.23 0.1.22 0.1.21 0.1.20 0.1.19 0.1.18 0.1.17 0.1.16 0.1.15 0.1.14 0.1.13 0.1.12 0.1.11 0.1.10 0.1.9 0.1.8 0.1.7 0.1.6 0.1.5 0.1.4 0.1.3 0.1.2 0.1.1 0.1.0

Mutable directed graph

HexDocs

Current section

Files

Jump to
Readme
45 Versions
3 Dependencies
Dependants
Files
Activity
bitgraph lib neighbor.ex
Raw

lib/neighbor.ex 

defmodule BitGraph.Neighbor do

  alias BitGraph.Adjacency

  import BitGraph.Common



  def default_neighbor_finder(finder_type \\ :set)



  def default_neighbor_finder(:set) do

    fn

      graph, vertex, :in ->

        Adjacency.column(graph[:adjacency], vertex)



      graph, vertex, :out ->

        Adjacency.row(graph[:adjacency], vertex)

    end

  end



  def default_neighbor_finder(:iterable) do

    fn

      graph, vertex, :in ->

        Adjacency.column_iterator(graph[:adjacency], vertex)



      graph, vertex, :out ->

        Adjacency.row_iterator(graph[:adjacency], vertex)

    end

  end



  def default_neighbor_iterator() do

    default_neighbor_finder(:iterable)

  end



  def get_neighbor_finder(graph, opts \\ [], default \\ default_neighbor_finder()) do

    Keyword.get(opts, :neighbor_finder) ||

      BitGraph.get_opts(graph)[:neighbor_finder] ||

      default

  end



  def iterate_neighbors(graph, vertex_index, start_value, fun \\ fn neighbor, _acc -> neighbor end, direction \\ :both) when is_integer(vertex_index) do

    iterator = cond do

      direction == :both -> BitGraph.V.neighbors(graph, vertex_index)

      direction == :in -> BitGraph.V.in_neighbors(graph, vertex_index)

      direction == :out -> BitGraph.V.neighbors(graph, vertex_index)

    end



    iterate(iterator, start_value, fun)

  end





end