Packages

reach

2.1.0
2.8.1 2.8.0 2.7.5 2.7.4 2.7.3 2.7.2 2.7.1 2.7.0 2.6.1 2.6.0 2.5.0 2.4.0 2.3.5 2.3.4 2.3.3 2.3.2 2.3.1 2.3.0 2.2.0 2.1.0 2.0.1 2.0.0 1.8.0 1.7.0 1.6.0 1.5.1 1.5.0 1.4.1 1.4.0 1.3.0 1.2.0 1.1.3 1.1.2 1.1.1 1.1.0 1.0.0

Program dependence graph for Elixir, Erlang, Gleam, JavaScript, and TypeScript

HexDocs

Current section

Files

Jump to
Readme
36 Versions
9 Dependencies
Dependants
Files
Activity
reach lib reach graph_algorithms.ex
Raw

lib/reach/graph_algorithms.ex 

defmodule Reach.GraphAlgorithms do

  @moduledoc "Graph traversal algorithms (BFS, DFS, reachability, SCC)."



  def cycle_components(graph, canonical_fun \\ &default_canonical/1) do

    graph

    |> Graph.strong_components()

    |> Enum.filter(&match?([_, _ | _], &1))

    |> Enum.map(canonical_fun)

    |> Enum.sort_by(&{length(&1), &1})

  end



  defp default_canonical(component), do: Enum.sort(component)

end