Packages

bitgraph

0.1.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
2 Dependencies
Dependants
Files
Activity
bitgraph lib utils common.ex
Raw

lib/utils/common.ex 

defmodule BitGraph.Common do

  alias BitGraph.{V, E}



  def vertex_indices_to_ids(graph, indices) do

    Enum.map(indices, fn idx -> V.get_vertex(graph, idx) end)

  end



  def cycle?(graph, vertices) do

    circuit = [List.last(vertices) | vertices]

    Enum.all?(0..length(circuit) - 2, fn idx ->

      E.edge?(graph, Enum.at(circuit, idx), Enum.at(circuit, idx + 1))

    end)

  end

end