chore(deps): replace libgraph with multigraph

Author: jimsynz

lib/reactor.ex

@@ -138,7 +138,7 @@ defmodule Reactor do
           inputs: [Reactor.Input.t()],
           intermediate_results: %{any => any},
           middleware: [Reactor.Middleware.t()],
-          plan: nil | Graph.t(),
+          plan: nil | Multigraph.t(),
           undo: [{Step.t(), any}],
           return: any,
           state: state,

lib/reactor/executor.ex

@@ -277,7 +277,7 @@ defmodule Reactor.Executor do
   end
 
   defp all_done(reactor) do
-    with 0 <- Graph.num_vertices(reactor.plan),
+    with 0 <- Multigraph.num_vertices(reactor.plan),
          {:ok, value} <- Map.fetch(reactor.intermediate_results, reactor.return) do
       {:ok, value, %{reactor | state: :successful}}
     else
@@ -292,9 +292,9 @@ defmodule Reactor.Executor do
   defp find_ready_steps(reactor, state) when state.max_concurrency > 0 do
     steps =
       reactor.plan
-      |> Graph.vertices()
+      |> Multigraph.vertices()
       |> Stream.filter(fn
-        step when is_struct(step, Step) -> Graph.in_degree(reactor.plan, step) == 0
+        step when is_struct(step, Step) -> Multigraph.in_degree(reactor.plan, step) == 0
         _ -> false
       end)
       |> Enum.take(state.max_concurrency)
@@ -304,9 +304,9 @@ defmodule Reactor.Executor do
 
   defp find_ready_steps(reactor, _state) do
     reactor.plan
-    |> Graph.vertices()
+    |> Multigraph.vertices()
     |> Enum.find(fn
-      step when is_struct(step, Step) -> Graph.in_degree(reactor.plan, step) == 0
+      step when is_struct(step, Step) -> Multigraph.in_degree(reactor.plan, step) == 0
       _ -> false
     end)
     |> case do
@@ -319,14 +319,14 @@ defmodule Reactor.Executor do
     now = System.monotonic_time(:millisecond)
 
     reactor.plan
-    |> Graph.vertices()
+    |> Multigraph.vertices()
     |> Enum.filter(&(is_struct(&1, Backoff) && &1.expires_at <= now))
     |> case do
       [] ->
         {:continue, reactor, state}
 
       to_remove ->
-        {:recurse, %{reactor | plan: Graph.delete_vertices(reactor.plan, to_remove)}, state}
+        {:recurse, %{reactor | plan: Multigraph.delete_vertices(reactor.plan, to_remove)}, state}
     end
   end
 

lib/reactor/executor/async.ex

@@ -117,8 +117,8 @@ defmodule Reactor.Executor.Async do
 
     plan =
       reactor.plan
-      |> Graph.add_vertex(backoff)
-      |> Graph.add_edge(backoff, step, label: :backoff)
+      |> Multigraph.add_vertex(backoff)
+      |> Multigraph.add_edge(backoff, step, label: :backoff)
 
     reactor = %{reactor | plan: plan}
     handle_completed_step(reactor, state, {task, step, result})
@@ -245,7 +245,7 @@ defmodule Reactor.Executor.Async do
   end
 
   defp drop_from_plan(reactor, step) do
-    %{reactor | plan: Graph.delete_vertex(reactor.plan, step)}
+    %{reactor | plan: Multigraph.delete_vertex(reactor.plan, step)}
   end
 
   defp add_error(state, error) do
@@ -269,7 +269,7 @@ defmodule Reactor.Executor.Async do
   end
 
   defp maybe_store_intermediate_result(reactor, step, value) do
-    if Graph.out_degree(reactor.plan, step) > 0 do
+    if Multigraph.out_degree(reactor.plan, step) > 0 do
       store_intermediate_result(reactor, step, value)
     else
       reactor
@@ -305,7 +305,7 @@ defmodule Reactor.Executor.Async do
       completed_step_results
       |> Enum.filter(fn
         {step, {:ok, _, []}} ->
-          Graph.out_degree(reactor.plan, step) > 0 || reactor.return == step.name
+          Multigraph.out_degree(reactor.plan, step) > 0 || reactor.return == step.name
 
         {_step, {:ok, _, _}} ->
           true
@@ -386,7 +386,7 @@ defmodule Reactor.Executor.Async do
   defp add_task_edges(reactor, started_tasks) do
     plan =
       Enum.reduce(started_tasks, reactor.plan, fn {task, step}, plan ->
-        Graph.add_edge(plan, task, step, label: :executing)
+        Multigraph.add_edge(plan, task, step, label: :executing)
       end)
 
     %{reactor | plan: plan}
@@ -395,12 +395,12 @@ defmodule Reactor.Executor.Async do
   defp delete_vertices(reactor, []), do: reactor
 
   defp delete_vertices(reactor, completed_tasks),
-    do: %{reactor | plan: Graph.delete_vertices(reactor.plan, completed_tasks)}
+    do: %{reactor | plan: Multigraph.delete_vertices(reactor.plan, completed_tasks)}
 
   defp delete_all_task_vertices(reactor) do
     task_vertices =
       reactor.plan
-      |> Graph.vertices()
+      |> Multigraph.vertices()
       |> Enum.filter(&is_struct(&1, Task))
 
     delete_vertices(reactor, task_vertices)

lib/reactor/executor/hooks.ex

@@ -116,7 +116,7 @@ defmodule Reactor.Executor.Hooks do
   defp step_count(reactor) when is_nil(reactor.plan), do: length(reactor.steps)
 
   defp step_count(reactor) do
-    vertices = Graph.num_vertices(reactor.plan)
+    vertices = Multigraph.num_vertices(reactor.plan)
     length(reactor.steps) + vertices
   end
 end

lib/reactor/executor/step_runner.ex

@@ -500,7 +500,7 @@ defmodule Reactor.Executor.StepRunner do
 
       graph ->
         graph
-        |> Graph.in_edges(step)
+        |> Multigraph.in_edges(step)
         |> Enum.filter(fn
           {_, _, {:nested_dependency, _, _, :for, _}} -> true
           _ -> false

lib/reactor/executor/sync.ex

@@ -35,8 +35,8 @@ defmodule Reactor.Executor.Sync do
 
     plan =
       reactor.plan
-      |> Graph.add_vertex(backoff)
-      |> Graph.add_edge(backoff, step, label: :backoff)
+      |> Multigraph.add_vertex(backoff)
+      |> Multigraph.add_edge(backoff, step, label: :backoff)
 
     reactor = %{reactor | plan: plan}
     handle_completed_step(reactor, state, step, result)
@@ -110,7 +110,7 @@ defmodule Reactor.Executor.Sync do
   end
 
   defp drop_from_plan(reactor, step) do
-    %{reactor | plan: Graph.delete_vertex(reactor.plan, step)}
+    %{reactor | plan: Multigraph.delete_vertex(reactor.plan, step)}
   end
 
   defp maybe_store_undo(reactor, step, value, state) do
@@ -126,7 +126,7 @@ defmodule Reactor.Executor.Sync do
   end
 
   defp maybe_store_intermediate_result(reactor, step, value) do
-    if Graph.out_degree(reactor.plan, step) > 0 do
+    if Multigraph.out_degree(reactor.plan, step) > 0 do
       store_intermediate_result(reactor, step, value)
     else
       reactor

lib/reactor/mermaid/reactor.ex

@@ -84,7 +84,7 @@ defmodule Reactor.Mermaid.Reactor do
     options = Keyword.put(options, :reactor_id, reactor.id)
 
     reactor.plan
-    |> Graph.vertices()
+    |> Multigraph.vertices()
     |> map_while_ok(&Step.to_mermaid(&1, options))
   end
 end

lib/reactor/planner.ex

@@ -50,26 +50,26 @@ defmodule Reactor.Planner do
   @doc false
   def get_ref(%{ref: ref}), do: ref
 
-  defp empty_graph, do: Graph.new(type: :directed, vertex_identifier: &__MODULE__.get_ref/1)
+  defp empty_graph, do: Multigraph.new(type: :directed, vertex_identifier: &__MODULE__.get_ref/1)
 
   defp reduce_steps_into_graph(graph, steps, intermediate_results) do
     steps_by_name =
       graph
-      |> Graph.vertices()
+      |> Multigraph.vertices()
       |> Stream.filter(&is_struct(&1, Step))
       |> Stream.concat(steps)
       |> Map.new(&{&1.name, &1})
 
     steps
     |> reduce_while_ok(graph, fn
       step, graph when is_struct(step, Step) ->
-        if Graph.has_vertex?(graph, step) do
+        if Multigraph.has_vertex?(graph, step) do
           graph
-          |> Graph.replace_vertex(step, step)
+          |> Multigraph.replace_vertex(step, step)
           |> reduce_arguments_into_graph(step, steps_by_name, intermediate_results)
         else
           graph
-          |> Graph.add_vertex(step, step.name)
+          |> Multigraph.add_vertex(step, step.name)
           |> reduce_arguments_into_graph(step, steps_by_name, intermediate_results)
         end
 
@@ -107,7 +107,7 @@ defmodule Reactor.Planner do
 
           {:ok, dependency} ->
             {:ok,
-             Graph.add_edge(graph, dependency, current_step,
+             Multigraph.add_edge(graph, dependency, current_step,
                label: {:argument, argument.name, :for, current_step.name}
              )}
 
@@ -157,7 +157,7 @@ defmodule Reactor.Planner do
           {:ok, dependency} when dependency.name != containing_step.name ->
             # This is a cross-scope dependency - add it as a nested dependency edge
             {:ok,
-             Graph.add_edge(graph, dependency, containing_step,
+             Multigraph.add_edge(graph, dependency, containing_step,
                label:
                  {:nested_dependency, nested_step.name, argument.name, :for, containing_step.name}
              )}
@@ -178,7 +178,7 @@ defmodule Reactor.Planner do
             # This is a cross-scope element reference - track it as a nested dependency
             # We'll need to pass the element value through the context
             {:ok,
-             Graph.add_edge(graph, map_step, containing_step,
+             Multigraph.add_edge(graph, map_step, containing_step,
                label:
                  {:nested_element_dependency, nested_step.name, argument.name, element_name, :for,
                   containing_step.name}
@@ -195,7 +195,7 @@ defmodule Reactor.Planner do
   end
 
   defp assert_graph_not_cyclic(reactor, graph) do
-    if Graph.is_acyclic?(graph) do
+    if Multigraph.is_acyclic?(graph) do
       :ok
     else
       {:error,

mix.exs

@@ -129,12 +129,12 @@ defmodule Reactor.MixProject do
   # Run "mix help deps" to learn about dependencies.
   defp deps do
     [
-      {:spark, "~> 2.3 and >= 2.3.3"},
-      {:splode, "~> 0.2"},
-      {:libgraph, "~> 0.16"},
       {:igniter, "~> 0.4", optional: true},
       {:iterex, "~> 0.1"},
       {:jason, "~> 1.0"},
+      {:multigraph, "~> 0.16.1-mg.2"},
+      {:spark, "~> 2.3 and >= 2.3.3"},
+      {:splode, "~> 0.2"},
       {:telemetry, "~> 1.2"},
       {:yaml_elixir, "~> 2.11"},
       {:ymlr, "~> 5.0"},

mix.lock

@@ -18,14 +18,14 @@
   "igniter": {:hex, :igniter, "0.7.7", "08bae07b7b610100bc7c676e6b18130fe12bb90617982023cc798346879c2c5f", [:mix], [{:glob_ex, "~> 0.1.7", [hex: :glob_ex, repo: "hexpm", optional: false]}, {:jason, "~> 1.4", [hex: :jason, repo: "hexpm", optional: false]}, {:owl, "~> 0.11", [hex: :owl, repo: "hexpm", optional: false]}, {:phx_new, "~> 1.7", [hex: :phx_new, repo: "hexpm", optional: true]}, {:req, "~> 0.5", [hex: :req, repo: "hexpm", optional: false]}, {:rewrite, ">= 1.1.1 and < 2.0.0-0", [hex: :rewrite, repo: "hexpm", optional: false]}, {:sourceror, "~> 1.4", [hex: :sourceror, repo: "hexpm", optional: false]}, {:spitfire, ">= 0.1.3 and < 1.0.0-0", [hex: :spitfire, repo: "hexpm", optional: false]}], "hexpm", "caeb1227887362b22038ff8419a7e6ddd3888f3d7e6cffacb14c73abbce17600"},
   "iterex": {:hex, :iterex, "0.1.2", "58f9b9b9a22a55cbfc7b5234a9c9c63eaac26d276b3db80936c0e1c60355a5a6", [:mix], [], "hexpm", "2e103b8bcc81757a9af121f6dc0df312c9a17220f302b1193ef720460d03029d"},
   "jason": {:hex, :jason, "1.4.4", "b9226785a9aa77b6857ca22832cffa5d5011a667207eb2a0ad56adb5db443b8a", [:mix], [{:decimal, "~> 1.0 or ~> 2.0", [hex: :decimal, repo: "hexpm", optional: true]}], "hexpm", "c5eb0cab91f094599f94d55bc63409236a8ec69a21a67814529e8d5f6cc90b3b"},
-  "libgraph": {:hex, :libgraph, "0.16.0", "3936f3eca6ef826e08880230f806bfea13193e49bf153f93edcf0239d4fd1d07", [:mix], [], "hexpm", "41ca92240e8a4138c30a7e06466acc709b0cbb795c643e9e17174a178982d6bf"},
   "makeup": {:hex, :makeup, "1.2.1", "e90ac1c65589ef354378def3ba19d401e739ee7ee06fb47f94c687016e3713d1", [:mix], [{:nimble_parsec, "~> 1.4", [hex: :nimble_parsec, repo: "hexpm", optional: false]}], "hexpm", "d36484867b0bae0fea568d10131197a4c2e47056a6fbe84922bf6ba71c8d17ce"},
   "makeup_elixir": {:hex, :makeup_elixir, "1.0.1", "e928a4f984e795e41e3abd27bfc09f51db16ab8ba1aebdba2b3a575437efafc2", [:mix], [{:makeup, "~> 1.0", [hex: :makeup, repo: "hexpm", optional: false]}, {:nimble_parsec, "~> 1.2.3 or ~> 1.3", [hex: :nimble_parsec, repo: "hexpm", optional: false]}], "hexpm", "7284900d412a3e5cfd97fdaed4f5ed389b8f2b4cb49efc0eb3bd10e2febf9507"},
   "makeup_erlang": {:hex, :makeup_erlang, "1.0.3", "4252d5d4098da7415c390e847c814bad3764c94a814a0b4245176215615e1035", [:mix], [{:makeup, "~> 1.0", [hex: :makeup, repo: "hexpm", optional: false]}], "hexpm", "953297c02582a33411ac6208f2c6e55f0e870df7f80da724ed613f10e6706afd"},
   "mime": {:hex, :mime, "2.0.7", "b8d739037be7cd402aee1ba0306edfdef982687ee7e9859bee6198c1e7e2f128", [:mix], [], "hexpm", "6171188e399ee16023ffc5b76ce445eb6d9672e2e241d2df6050f3c771e80ccd"},
   "mimic": {:hex, :mimic, "2.3.0", "88b1d13c285e57df6ea57204317bb56e49e7329668006cdcb80a9aafc73a9616", [:mix], [{:ham, "~> 0.3", [hex: :ham, repo: "hexpm", optional: false]}], "hexpm", "52771f23689398c5d41c7d05e91c2c28e10df273b784f40ca8b02e35e46850d3"},
   "mint": {:hex, :mint, "1.7.1", "113fdb2b2f3b59e47c7955971854641c61f378549d73e829e1768de90fc1abf1", [:mix], [{:castore, "~> 0.1.0 or ~> 1.0", [hex: :castore, repo: "hexpm", optional: true]}, {:hpax, "~> 0.1.1 or ~> 0.2.0 or ~> 1.0", [hex: :hpax, repo: "hexpm", optional: false]}], "hexpm", "fceba0a4d0f24301ddee3024ae116df1c3f4bb7a563a731f45fdfeb9d39a231b"},
   "mix_audit": {:hex, :mix_audit, "2.1.5", "c0f77cee6b4ef9d97e37772359a187a166c7a1e0e08b50edf5bf6959dfe5a016", [:make, :mix], [{:jason, "~> 1.4", [hex: :jason, repo: "hexpm", optional: false]}, {:yaml_elixir, "~> 2.11", [hex: :yaml_elixir, repo: "hexpm", optional: false]}], "hexpm", "87f9298e21da32f697af535475860dc1d3617a010e0b418d2ec6142bc8b42d69"},
+  "multigraph": {:hex, :multigraph, "0.16.1-mg.3", "08051b7108ad870f24393e6f0c15ac8beb5c527942ed63800ece7fbb771f8c79", [:mix], [], "hexpm", "72897c5c175aa605cf7355b8f73972e8eadc40ebc6ffd43c3e790424a753d468"},
   "nimble_options": {:hex, :nimble_options, "1.1.1", "e3a492d54d85fc3fd7c5baf411d9d2852922f66e69476317787a7b2bb000a61b", [:mix], [], "hexpm", "821b2470ca9442c4b6984882fe9bb0389371b8ddec4d45a9504f00a66f650b44"},
   "nimble_parsec": {:hex, :nimble_parsec, "1.4.2", "8efba0122db06df95bfaa78f791344a89352ba04baedd3849593bfce4d0dc1c6", [:mix], [], "hexpm", "4b21398942dda052b403bbe1da991ccd03a053668d147d53fb8c4e0efe09c973"},
   "nimble_pool": {:hex, :nimble_pool, "1.1.0", "bf9c29fbdcba3564a8b800d1eeb5a3c58f36e1e11d7b7fb2e084a643f645f06b", [:mix], [], "hexpm", "af2e4e6b34197db81f7aad230c1118eac993acc0dae6bc83bac0126d4ae0813a"},