pass properties through add_edge of struct

Author: zblanco

lib/graph.ex

@@ -1139,8 +1139,14 @@ defmodule Graph do
       [%Graph.Edge{v1: :a, v2: :b}]
   """
   @spec add_edge(t, Edge.t()) :: t
-  def add_edge(%__MODULE__{} = g, %Edge{v1: v1, v2: v2, label: label, weight: weight}) do
-    add_edge(g, v1, v2, label: label, weight: weight)
+  def add_edge(%__MODULE__{} = g, %Edge{
+        v1: v1,
+        v2: v2,
+        label: label,
+        weight: weight,
+        properties: properties
+      }) do
+    add_edge(g, v1, v2, label: label, weight: weight, properties: properties)
   end
 
   @doc """

test/graph_test.exs

@@ -156,8 +156,30 @@ defmodule GraphTest do
       assert Map.has_key?(g.edge_index[:baz], g.vertex_identifier.(:a))
     end
 
-    test "traversal using indexed keys" do
-    end
+    # test "BFS traversal using multigraph partitions" do
+    #   graph =
+    #     Graph.new(multigraph: true)
+    #     |> Graph.add_edges([
+    #       {:a, :b, label: :foo},
+    #       {:a, :b, label: :bar},
+    #       {:b, :c, weight: 3},
+    #       {:b, :a, label: {:complex, :label}}
+    #     ])
+
+    #   assert Graph.bfs(graph, :a) == [:a, :b, :c]
+    # end
+
+    # test "DFS traversal using multigraph partitions" do
+    # end
+
+    # test "Dijkstra traversal using multigraph partitions" do
+    # end
+
+    # test "A* traversal using multigraph partitions" do
+    # end
+
+    # test "Bellman-Ford traversal using multigraph partitions" do
+    # end
   end
 
   describe "edge properties" do
@@ -190,6 +212,19 @@ defmodule GraphTest do
                %Edge{v1: :a, v2: :b, label: :foo, properties: %{potato: :ham}}
              ] = Graph.out_edges(g, :a)
     end
+
+    test "adding edge struct with properties" do
+      g =
+        Graph.new()
+
+      edge = Edge.new(:a, :b, properties: %{foo: :bar})
+
+      g = Graph.add_edge(g, edge)
+
+      assert [
+               %Edge{v1: :a, v2: :b, properties: %{foo: :bar}}
+             ] = Graph.out_edges(g, :a)
+    end
   end
 
   test "delete vertex" do