rgraphum 0.0.1.alpha

data/test/lib/rgraphum/math/degree_distribution_test.rb

@@ -0,0 +1,40 @@
+# -*- coding: utf-8 -*-
+
+require 'rgraphum'
+require 'test_helper'
+
+class  DegreeDistributionTest < MiniTest::Test
+
+
+  def setup
+    #  a - b
+    #   \ /
+    #    c
+    #   / \
+    #  d - e
+    @graph = Rgraphum::Graph.new
+
+    @a = @graph.vertices.build(label: "a")
+    @b = @graph.vertices.build(label: "b")
+    @c = @graph.vertices.build(label: "c")
+    @d = @graph.vertices.build(label: "d")
+    @e = @graph.vertices.build(label: "e")
+
+    @a_b_e = @graph.edges.build(source: @a, target: @b)
+    @a_c_e = @graph.edges.build(source: @a, target: @c)
+    @b_c_e = @graph.edges.build(source: @b, target: @c)
+    @c_b_e = @graph.edges.build(source: @c, target: @d)
+    @c_e_e = @graph.edges.build(source: @c, target: @e)
+    @d_e_e = @graph.edges.build(source: @d, target: @e)
+    
+  end
+
+  def test_degree_distribution
+    assert_equal ( {2=>0.8, 4=>0.2} ) , @graph.degree_distribution
+  end
+
+  def test_degree_distribution_exponent
+    assert_equal -2.0, @graph.degree_distribution_exponent
+  end
+
+end

data/test/lib/rgraphum/math/dijkstra_test.rb

@@ -0,0 +1,146 @@
+# -*- coding: utf-8 -*-
+
+require 'rgraphum'
+require 'test_helper'
+
+class RgraphumMathDijkstraTest < MiniTest::Test
+  def setup
+    @graph = Rgraphum::Graph.new
+    # @graph.vertices = [
+    #   { label: "A" },
+    #   { label: "B" },
+    #   { label: "C" },
+    #   { label: "D" },
+    #   { label: "G" },
+    # ]
+    @a = @graph.vertices.build(label: "A")
+    @b = @graph.vertices.build(label: "B")
+    @c = @graph.vertices.build(label: "C")
+    @d = @graph.vertices.build(label: "D")
+    @g = @graph.vertices.build(label: "G")
+  end
+
+  # A --(5)-- B --(1)-- G
+  # | ＼      |       ／
+  #(1)  (4)  (2)  (4)
+  # |      ＼ | ／
+  # C --(5)-- D
+  #
+  def test_adjacency_matrix_1
+    @graph.edges.build(source: @a, target: @b, weight: 5) # A->B
+    @graph.edges.build(source: @a, target: @c, weight: 1) # A->C
+    @graph.edges.build(source: @a, target: @d, weight: 4) # A->D
+    @graph.edges.build(source: @b, target: @d, weight: 2) # B->D
+    @graph.edges.build(source: @c, target: @d, weight: 5) # C->D
+    @graph.edges.build(source: @b, target: @g, weight: 1) # B->G
+    @graph.edges.build(source: @d, target: @g, weight: 4) # D->G
+
+    a_matrix = @graph.adjacency_matrix
+
+    expected = [
+      #  A    B    C    D    G
+      [nil,   5,   1,   4, nil], # A
+      [  5, nil, nil,   2,   1], # B
+      [  1, nil, nil,   5, nil], # C
+      [  4,   2,   5, nil,   4], # D
+      [nil,   1, nil,   4, nil], # G
+    ]
+
+    assert_equal expected, a_matrix
+  end
+
+  # A --(1)-- B --(4)-- G
+  # | ＼      |       ／
+  #(2)  (4)  (2)  (1)
+  # |      ＼ | ／
+  # C --(3)-- D
+  #
+  # A -> G : A -> B -> D -> G
+  def test_dijkstra_1
+    @graph.edges.build(source: @a, target: @b, weight: 1) # A->B
+    @graph.edges.build(source: @a, target: @c, weight: 2) # A->C
+    @graph.edges.build(source: @a, target: @d, weight: 4) # A->D
+    @graph.edges.build(source: @b, target: @d, weight: 2) # B->D
+    @graph.edges.build(source: @c, target: @d, weight: 3) # C->D
+    @graph.edges.build(source: @b, target: @g, weight: 4) # B->G
+    @graph.edges.build(source: @d, target: @g, weight: 1) # D->G
+
+    vertices = @graph.dijkstra(@a, @g)
+    # p vertices.map(&:label)
+
+    assert_equal 4, vertices.size
+    assert_equal vertices[0], @a
+    assert_equal vertices[1], @b
+    assert_equal vertices[2], @d
+    assert_equal vertices[3], @g
+  end
+
+  # A --(5)-- B --(1)-- G
+  # | ＼      |       ／
+  #(1)  (4)  (2)  (4)
+  # |      ＼ | ／
+  # C --(5)-- D
+  #
+  # A -> G : A -> B -> G
+  def test_dijkstra_2
+    @graph.edges.build(source: @a, target: @b, weight: 5) # A->B
+    @graph.edges.build(source: @a, target: @c, weight: 1) # A->C
+    @graph.edges.build(source: @a, target: @d, weight: 4) # A->D
+    @graph.edges.build(source: @b, target: @d, weight: 2) # B->D
+    @graph.edges.build(source: @c, target: @d, weight: 5) # C->D
+    @graph.edges.build(source: @b, target: @g, weight: 1) # B->G
+    @graph.edges.build(source: @d, target: @g, weight: 4) # D->G
+
+    vertices = @graph.dijkstra(@a, @g)
+    # p vertices.map(&:label)
+
+    assert_equal 3, vertices.size
+    assert_equal vertices[0], @a
+    assert_equal vertices[1], @b
+    assert_equal vertices[2], @g
+  end
+
+  # A --(5)-- B --(1)-- G
+  # | ＼      |       ／
+  #(1)  (4)  (2)  (4)
+  # |      ＼ | ／
+  # C --(5)-- D
+  #
+  # A -> B : A -> B
+  def test_dijkstra_3
+    @graph.edges.build(source: @a, target: @b, weight: 5) # A->B
+    @graph.edges.build(source: @a, target: @c, weight: 1) # A->C
+    @graph.edges.build(source: @a, target: @d, weight: 4) # A->D
+    @graph.edges.build(source: @b, target: @d, weight: 2) # B->D
+    @graph.edges.build(source: @c, target: @d, weight: 5) # C->D
+    @graph.edges.build(source: @b, target: @g, weight: 1) # B->G
+    @graph.edges.build(source: @d, target: @g, weight: 4) # D->G
+
+    vertices = @graph.dijkstra(@a, @b)
+    assert_equal 2, vertices.size
+    assert_equal vertices[0], @a
+    assert_equal vertices[1], @b
+  end
+
+  # A --(5)-- B --(1)-- G
+  # | ＼      |       ／
+  #(1)  (4)  (2)  (4)
+  # |      ＼ | ／
+  # C --(5)-- D
+  #
+  # A -> C : A -> C
+  def test_dijkstra_4
+    @graph.edges.build(source: @a, target: @b, weight: 5) # A->B
+    @graph.edges.build(source: @a, target: @c, weight: 1) # A->C
+    @graph.edges.build(source: @a, target: @d, weight: 4) # A->D
+    @graph.edges.build(source: @b, target: @d, weight: 2) # B->D
+    @graph.edges.build(source: @c, target: @d, weight: 5) # C->D
+    @graph.edges.build(source: @b, target: @g, weight: 1) # B->G
+    @graph.edges.build(source: @d, target: @g, weight: 4) # D->G
+
+    vertices = @graph.dijkstra(@a, @c)
+    assert_equal 2, vertices.size
+    assert_equal vertices[0], @a
+    assert_equal vertices[1], @c
+  end
+end

data/test/lib/rgraphum/math/modularity_test.rb

@@ -0,0 +1,154 @@
+# -*- coding: utf-8 -*-
+
+require 'test_helper'
+require 'rgraphum'
+
+class RgraphumMathModularityTest < MiniTest::Test
+  def setup
+    #  1 - 2
+    #   \ /
+    #    3
+    #   / \
+    #  4 - 5
+
+    @graph = Rgraphum::Graph.new
+    @graph.vertices = [
+      { id: 1, label: "A", community_id: 1 },
+      { id: 2, label: "B", community_id: 1 },
+      { id: 3, label: "C" },
+      { id: 4, label: "D" },
+      { id: 5, label: "E" },
+    ]
+    @graph.edges = [
+      { id: 0, source: 1, target: 2, weight: 1 },
+      { id: 1, source: 1, target: 3, weight: 1 },
+      { id: 2, source: 2, target: 3, weight: 1 },
+      { id: 3, source: 3, target: 4, weight: 1 },
+      { id: 4, source: 3, target: 5, weight: 1 },
+      { id: 5, source: 4, target: 5, weight: 1 },
+    ]
+  end
+
+  def test_modularity
+    assert @graph.modularity
+    assert_equal 1.0, @graph.modularity * 9.0
+
+    community_id_a = @graph.vertices[0].community_id
+    assert_equal @graph.vertices[0].community_id, community_id_a
+    assert_equal @graph.vertices[1].community_id, community_id_a
+    assert_equal @graph.vertices[2].community_id, community_id_a
+    community_id_a = @graph.vertices[3].community_id
+    assert_equal @graph.vertices[3].community_id, community_id_a
+    assert_equal @graph.vertices[4].community_id, community_id_a
+
+    @graph = Rgraphum::Graph.new
+    @graph.vertices = [
+      { id:  0, label:  "0" },
+      { id:  1, label:  "1" },
+      { id:  2, label:  "2" },
+      { id:  3, label:  "3" },
+      { id:  4, label:  "4" },
+      { id:  5, label:  "5" },
+      { id:  6, label:  "6" },
+      { id:  7, label:  "7" },
+      { id:  8, label:  "8" },
+      { id:  9, label:  "9" },
+      { id: 10, label: "10" },
+      { id: 11, label: "11" },
+      { id: 12, label: "12" },
+      { id: 13, label: "13" },
+      { id: 14, label: "14" },
+      { id: 15, label: "15" },
+    ]
+    @graph.edges = [
+      { id:  0, source:  0, target:  2, weight: 1 },
+      { id:  1, source:  0, target:  3, weight: 1 },
+      { id:  2, source:  0, target:  4, weight: 1 },
+      { id:  3, source:  0, target:  5, weight: 1 },
+      { id:  4, source:  1, target:  2, weight: 1 },
+      { id:  5, source:  1, target:  4, weight: 1 },
+      { id:  6, source:  1, target:  7, weight: 1 },
+      { id:  7, source:  2, target:  4, weight: 1 },
+      { id:  8, source:  2, target:  5, weight: 1 },
+      { id:  9, source:  2, target:  6, weight: 1 },
+      { id: 10, source:  3, target:  7, weight: 1 },
+      { id: 11, source:  4, target: 10, weight: 1 },
+      { id: 12, source:  5, target:  7, weight: 1 },
+      { id: 13, source:  5, target: 11, weight: 1 },
+      { id: 14, source:  6, target:  7, weight: 1 },
+      { id: 15, source:  6, target: 11, weight: 1 },
+      { id: 16, source:  8, target:  9, weight: 1 },
+      { id: 17, source:  8, target: 10, weight: 1 },
+      { id: 18, source:  8, target: 11, weight: 1 },
+      { id: 19, source:  8, target: 14, weight: 1 },
+      { id: 20, source:  8, target: 15, weight: 1 },
+      { id: 21, source:  9, target: 12, weight: 1 },
+      { id: 22, source:  9, target: 14, weight: 1 },
+      { id: 23, source: 10, target: 11, weight: 1 },
+      { id: 24, source: 10, target: 12, weight: 1 },
+      { id: 25, source: 10, target: 13, weight: 1 },
+      { id: 26, source: 10, target: 14, weight: 1 },
+      { id: 27, source: 11, target: 13, weight: 1 },
+    ]
+    vertices = @graph.vertices
+    edges = @graph.edges
+
+    assert_equal 0.392, @graph.modularity.round(3)
+    # @graph.modularity.round(3)
+
+    community_id_a = @graph.vertices[0].community_id
+    assert_equal 0, community_id_a
+    assert_equal @graph.vertices[ 0].community_id, community_id_a
+    assert_equal @graph.vertices[ 1].community_id, community_id_a
+    assert_equal @graph.vertices[ 2].community_id, community_id_a
+    assert_equal @graph.vertices[ 3].community_id, community_id_a
+    assert_equal @graph.vertices[ 4].community_id, community_id_a
+    assert_equal @graph.vertices[ 5].community_id, community_id_a
+    assert_equal @graph.vertices[ 6].community_id, community_id_a
+    assert_equal @graph.vertices[ 7].community_id, community_id_a
+
+    community_id_b = @graph.vertices[8].community_id
+    assert_equal 8, community_id_b
+    assert_equal @graph.vertices[ 8].community_id, community_id_b
+    assert_equal @graph.vertices[ 9].community_id, community_id_b
+    assert_equal @graph.vertices[10].community_id, community_id_b
+    assert_equal @graph.vertices[11].community_id, community_id_b
+    assert_equal @graph.vertices[12].community_id, community_id_b
+    assert_equal @graph.vertices[13].community_id, community_id_b
+    assert_equal @graph.vertices[14].community_id, community_id_b
+
+    # same graph befor after
+    @graph.vertices.each_with_index do |vertex,i|
+      assert_same vertex, vertices[i]
+    end
+    @graph.edges.each_with_index do |edge,i|
+      assert_same edge, edges[i]
+      assert_same edge.source, edges[i].source
+      assert_same edge.target, edges[i].target
+    end
+
+    gexf = @graph.to_gephi
+    file = File.open("tmp/modularity.gexf", "w")
+    file.write(gexf)
+  end
+
+  def test_none_edges_modularity
+    # nosw 3 is only vertex
+    # vertex 1 - 2, 4 - 5 is one edge cluster
+
+    @graph = Rgraphum::Graph.new
+    @graph.vertices = [
+      { id: 1, label: "A", community_id: 1 },
+      { id: 2, label: "B", community_id: 1 },
+      { id: 3, label: "C" },
+      { id: 4, label: "D" },
+      { id: 5, label: "E" },
+    ]
+    @graph.edges = [
+      { id: 0, source: 1, target: 2, weight: 1 },
+      { id: 5, source: 4, target: 5, weight: 1 },
+    ]
+
+    assert_equal 0.5,@graph.modularity
+  end
+end

data/test/lib/rgraphum/math/quick_average_distance_matrix_test.rb

@@ -0,0 +1,84 @@
+# -*- coding: utf-8 -*-
+
+require 'rgraphum'
+require 'test_helper'
+
+class RgraphumMathQuickAverageDistanceMatrixTest < MiniTest::Test
+  def setup
+    @graph = Rgraphum::Graph.new
+    # @graph.vertices = [
+    #   { label: "A" },
+    #   { label: "B" },
+    #   { label: "C" },
+    #   { label: "D" },
+    #   { label: "G" },
+    # ]
+    @a = @graph.vertices.build(label: "A")
+    @b = @graph.vertices.build(label: "B")
+    @c = @graph.vertices.build(label: "C")
+    @d = @graph.vertices.build(label: "D")
+    @g = @graph.vertices.build(label: "G")
+  end
+
+  # A --(5)-- B --(1)-- G
+  # | ＼      |       ／
+  #(1)  (4)  (2)  (4)
+  # |      ＼ | ／
+  # C --(5)-- D
+  #
+  def test_average_distance_1
+    @graph.edges.build(source: @a, target: @b, weight: 5) # A->B
+    @graph.edges.build(source: @a, target: @c, weight: 1) # A->C
+    @graph.edges.build(source: @a, target: @d, weight: 4) # A->D
+    @graph.edges.build(source: @b, target: @d, weight: 2) # B->D
+    @graph.edges.build(source: @c, target: @d, weight: 5) # C->D
+    @graph.edges.build(source: @b, target: @g, weight: 1) # B->G
+    @graph.edges.build(source: @d, target: @g, weight: 4) # D->G
+
+    average_distance = @graph.quick_average_distance
+
+    n = @graph.vertices.size
+    minimum_distance_matrix = [
+      #  A    B    C    D    G
+      [  0,   5,   1,   4,   6 ], # A
+      [  5,   0,   6,   2,   1 ], # B
+      [  1,   6,   0,   5,   7 ], # C
+      [  4,   2,   5,   0,   3 ], # D
+      [  6,   1,   7,   3,   0 ], # G
+    ]
+    expected = Rational(minimum_distance_matrix.flatten.inject(&:+), n * (n - 1))
+
+    assert_equal expected, average_distance
+  end
+
+  # A --(1)-- B --(4)-- G
+  # | ＼      |       ／
+  #(2)  (4)  (2)  (1)
+  # |      ＼ | ／
+  # C --(3)-- D
+  #
+  def test_average_distance_2
+    @graph.edges.build(source: @a, target: @b, weight: 1) # A->B
+    @graph.edges.build(source: @a, target: @c, weight: 2) # A->C
+    @graph.edges.build(source: @a, target: @d, weight: 4) # A->D
+    @graph.edges.build(source: @b, target: @d, weight: 2) # B->D
+    @graph.edges.build(source: @c, target: @d, weight: 3) # C->D
+    @graph.edges.build(source: @b, target: @g, weight: 4) # B->G
+    @graph.edges.build(source: @d, target: @g, weight: 1) # D->G
+
+    average_distance = @graph.quick_average_distance
+
+    n = @graph.vertices.size
+    minimum_distance_matrix = [
+      #  A    B    C    D    G
+      [  0,   1,   2,   3,   4 ], # A
+      [  1,   0,   3,   2,   3 ], # B
+      [  2,   3,   0,   3,   4 ], # C
+      [  3,   2,   3,   0,   1 ], # D
+      [  4,   3,   4,   1,   0 ], # G
+    ]
+    expected = Rational(minimum_distance_matrix.flatten.inject(&:+), n * (n - 1))
+
+    assert_equal expected, average_distance
+  end
+end

data/test/lib/rgraphum/path_test.rb

@@ -0,0 +1,44 @@
+# -*- coding: utf-8 -*-
+
+require 'rgraphum'
+require 'test_helper'
+
+class RgraphumPathTest < MiniTest::Test
+  def setup
+    @graph = Rgraphum::Graph.new
+    @v1 = @graph.vertices.build(label: "v1")
+    @v2 = @graph.vertices.build(label: "v2")
+    @v3 = @graph.vertices.build(label: "v3")
+    @v4 = @graph.vertices.build(label: "v4")
+    @v5 = @graph.vertices.build(label: "v5")
+    @v6 = @graph.vertices.build(label: "v6")
+
+    @e1 = @graph.edges.build(source: @v1, target: @v2, weight: 1)
+    @e2 = @graph.edges.build(source: @v2, target: @v3, weight: 2)
+    @e3 = @graph.edges.build(source: @v3, target: @v4, weight: 3)
+    @e4 = @graph.edges.build(source: @v4, target: @v5, weight: 4)
+    @e5 = @graph.edges.build(source: @v5, target: @v6, weight: 5)
+  end
+
+  def test_path_vertices
+    path = Rgraphum::Path.new(@v3, [@v1, @v2, @v3])
+    assert_equal [@v1, @v2, @v3], path.vertices
+  end
+
+  def test_path_total_weight
+    path = Rgraphum::Path.new(@v2, [@v1, @v2])
+    assert_equal 1, path.total_weight
+
+    path = Rgraphum::Path.new(@v3, [@v1, @v2, @v3])
+    assert_equal 3, path.total_weight
+
+    path = Rgraphum::Path.new(@v4, [@v1, @v2, @v3, @v4])
+    assert_equal 6, path.total_weight
+
+    path = Rgraphum::Path.new(@v4, [@v1, @v2, @v3, @v4, @v5])
+    assert_equal 10, path.total_weight
+
+    path = Rgraphum::Path.new(@v6, [@v1, @v2, @v3, @v4, @v5, @v6])
+    assert_equal 15, path.total_weight
+  end
+end

data/test/lib/rgraphum/query/enumerable_test.rb

@@ -0,0 +1,42 @@
+# -*- coding: utf-8 -*-
+
+require 'test_helper'
+require 'rgraphum'
+
+class RgraphumQueryEnumerableTest < MiniTest::Test
+  def setup
+    @array = [
+      OpenStruct.new(id: 1,  label: "aaa"),
+      OpenStruct.new(id: 2,  label: "bbb"),
+      OpenStruct.new(id: 3,  label: "ccc"),
+      OpenStruct.new(id: 4,  label: "ddd"),
+      OpenStruct.new(id: 5,  label: "aaa"),
+      OpenStruct.new(id: 6,  label: "bbb"),
+      OpenStruct.new(id: 7,  label: "ccc"),
+      OpenStruct.new(id: 8,  label: "ddd"),
+      OpenStruct.new(id: 9,  label: "aaa"),
+      OpenStruct.new(id: 10, label: "bbb"),
+      OpenStruct.new(id: 11, label: "ccc"),
+      OpenStruct.new(id: 12, label: "ddd"),
+    ]
+    @query = Rgraphum::Query.new(@array)
+  end
+
+  def test_where_and_all
+    items = @query.where(label: "aaa") # .all
+    assert_equal [1, 5, 9], items.map(&:id)
+  end
+
+  def test_where_and_all_without_matches
+    items = @query.where(label: "xyz") # .all
+    assert_empty items
+  end
+
+  def test_each
+    items = []
+    @query.where(label: "ccc").each do |item|
+      items << item
+    end
+    assert_equal [3, 7, 11], items.map(&:id)
+  end
+end

data/test/lib/rgraphum/query/where_operators_test.rb

@@ -0,0 +1,75 @@
+# -*- coding: utf-8 -*-
+
+require 'rgraphum'
+require 'test_helper'
+
+class RgraphumQueryWhereOperatorsTest < MiniTest::Test
+  def setup
+    @array = [
+      OpenStruct.new(id: 1,  label: "aaa"),
+      OpenStruct.new(id: 2,  label: "bbb"),
+      OpenStruct.new(id: 3,  label: "ccc"),
+      OpenStruct.new(id: 4,  label: "ddd"),
+      OpenStruct.new(id: 5,  label: "aaa"),
+      OpenStruct.new(id: 6,  label: "bbb"),
+      OpenStruct.new(id: 7,  label: "ccc"),
+      OpenStruct.new(id: 8,  label: "ddd"),
+      OpenStruct.new(id: 9,  label: "aaa"),
+      OpenStruct.new(id: 10, label: "bbb"),
+      OpenStruct.new(id: 11, label: "ccc"),
+      OpenStruct.new(id: 12, label: "ddd"),
+    ]
+    @query = Rgraphum::Query.new(@array)
+  end
+
+  def test_where_eq_1
+    items = @query.where(:label, :eq, "aaa").all
+    assert_equal [1, 5, 9], items.map(&:id)
+  end
+
+  def test_where_eq_2
+    items = @query.where(:id, :eq, 3).all
+    assert_equal [3], items.map(&:id)
+  end
+
+  def test_where_ne
+    items = @query.where(:id, :ne, 3).all
+    assert_equal [1,2,4,5,6,7,8,9,10,11,12], items.map(&:id)
+  end
+
+  def test_where_gt
+    items = @query.where(:id, :gt, 6).all
+    assert_equal [7,8,9,10,11,12], items.map(&:id)
+  end
+
+  def test_where_gte
+    items = @query.where(:id, :gte, 6).all
+    assert_equal [6,7,8,9,10,11,12], items.map(&:id)
+  end
+
+  def test_where_lt
+    items = @query.where(:id, :lt, 6).all
+    assert_equal [1,2,3,4,5], items.map(&:id)
+  end
+
+  def test_where_lte
+    items = @query.where(:id, :lte, 6).all
+    assert_equal [1,2,3,4,5,6], items.map(&:id)
+  end
+
+  def test_where_match
+    items = @query.where(:label, :match, /^a+$/).all
+    assert_equal [1,5,9], items.map(&:id)
+
+    items = @query.where(:label, :=~, /^a+$/).all
+    assert_equal [1,5,9], items.map(&:id)
+  end
+
+  def test_where_not_match
+    items = @query.where(:label, :not_match, /^a+$/).all
+    assert_equal [2,3,4,6,7,8,10,11,12], items.map(&:id)
+
+    items = @query.where(:label, :!~, /^a+$/).all
+    assert_equal [2,3,4,6,7,8,10,11,12], items.map(&:id)
+  end
+end

data/test/lib/rgraphum/query/where_test.rb

@@ -0,0 +1,59 @@
+# -*- coding: utf-8 -*-
+
+require 'rgraphum'
+require 'test_helper'
+
+class RgraphumQueryWhereTest < MiniTest::Test
+  def setup
+    @array = [
+      OpenStruct.new(id: 1,  label: "aaa"),
+      OpenStruct.new(id: 2,  label: "bbb"),
+      OpenStruct.new(id: 3,  label: "ccc"),
+      OpenStruct.new(id: 4,  label: "ddd"),
+      OpenStruct.new(id: 5,  label: "aaa"),
+      OpenStruct.new(id: 6,  label: "bbb"),
+      OpenStruct.new(id: 7,  label: "ccc"),
+      OpenStruct.new(id: 8,  label: "ddd"),
+      OpenStruct.new(id: 9,  label: "aaa"),
+      OpenStruct.new(id: 10, label: "bbb"),
+      OpenStruct.new(id: 11, label: "ccc"),
+      OpenStruct.new(id: 12, label: "ddd"),
+    ]
+    @query = Rgraphum::Query.new(@array)
+  end
+
+  def test_where_and_all
+    items = @query.where(label: "aaa").all
+    assert_equal [1, 5, 9], items.map(&:id)
+  end
+
+  def test_where_and_all_without_matches
+    items = @query.where(label: "xyz").all
+    assert_empty items
+  end
+
+  def test_where_and_first_1
+    item = @query.where(id: 3).first
+    assert_equal 3, item.id
+  end
+
+  def test_where_and_first_2
+    item = @query.where(id: 2).where(label: "bbb").first
+    assert_equal 2, item.id
+  end
+
+  def test_where_and_first_without_matches
+    item = @query.where(id: 2).where(label: "xyz").first
+    assert_nil item
+  end
+
+  def test_where_and_last
+    item = @query.where(label: "bbb").last
+    assert_equal 10, item.id
+  end
+
+  def test_where_and_last_without_matches
+    item = @query.where(label: "xyz").last
+    assert_nil item
+  end
+end