rgraphum 0.0.1.alpha

data/test/lib/rgraphum/analyzer/meme_tracker_test.rb

@@ -0,0 +1,383 @@
+# coding: utf-8
+
+require 'test_helper'
+require 'rgraphum'
+
+class MemeTrackerTest < MiniTest::Test
+  def setup
+    @meme_tracker = make_base_phrase_graph
+    @graph = make_sample_graph_for_cluster
+    @meme_tracker.graph = @graph
+    @vertices = @meme_tracker.graph.vertices
+  end
+
+  # some big method check
+  def test_make_edges
+    graph = Rgraphum::Graph.new
+    phrases = [
+      phrase_a = {id: 0, words: %w{私 は 山 が 好き}},
+      phrase_b = {id: 1, words: %w{君 は 山 が 好き かな}},
+      phrase_c = {id: 2, words: %w{僕 は 海 も 好き}}
+    ]
+    graph.vertices = phrases
+
+    meme_tracker = Rgraphum::Analyzer::MemeTracker.new
+    meme_tracker.make_edges(graph)
+
+    edge = graph.edges[0]
+    assert_equal 0,        edge.id
+    rg_assert_equal phrase_a, edge.source
+    rg_assert_equal phrase_b, edge.target
+    assert_equal 1.0/3.0,  edge.weight
+
+    edge = graph.edges[1]
+    assert_equal 1,        edge.id
+    rg_assert_equal phrase_a, edge.source
+    rg_assert_equal phrase_c, edge.target
+    assert_equal 1.0/4.0,  edge.weight
+
+    edge = graph.edges[2]
+    assert_equal 2,        edge.id
+    rg_assert_equal phrase_b, edge.source
+    rg_assert_equal phrase_c, edge.target
+    assert_equal 1.0/5.0,  edge.weight
+  end
+
+  def test_count_same_words_vertices
+    phrases = [
+      phrase_a = {id: 0, words: %w{山 が 好き}},
+      phrase_b = {id: 1, words: %w{山 が 好き}},
+      phrase_c = {id: 2, words: %w{海 が 好き}},
+    ]
+    graph = Rgraphum::Graph.new
+    graph.vertices = phrases
+
+    meme_tracker = Rgraphum::Analyzer::MemeTracker.new
+    meme_tracker.count_same_words_vertices(graph)
+
+    assert_equal 1,   graph.vertices[0].count
+    assert_nil graph.vertices[1].count
+    assert_nil graph.vertices[2].count
+  end
+
+  def test_make_graph_some_of_functional
+    phrases = [
+      phrase_a = {words: %w{私 は 山 が 好き}},
+      phrase_b = {words: %w{君 は 山 が 好き かな}},
+      phrase_c = {words: %w{僕 は 海 も 好き}},
+    ]
+
+    meme_tracker = Rgraphum::Analyzer::MemeTracker.new
+    graph = meme_tracker.make_graph(phrases)
+    graph = make_sample_graph_for_cluster
+
+    #<Rgraphum::Graph:0x00000003bb5e88 @vertices=[{:words=>["私", "は", "山", "が", "好き"], :id=>0, :count=>1}, {:words=>["君", "は", "山", "が", "好き", "かな"], :id=>1, :count=>1}, {:words=>["僕", "は", "海", "も", "好き"], :id=>2, :count=>1}], @edges=[{:source=>{:words=>["私", "は", "山", "が", "好き"], :id=>0, :count=>1}, :target=>{:words=>["君", "は", "山", "が", "好き", "かな"], :id=>1, :count=>1}, :weight=>0.3333333333333333, :id=>0}, {:source=>{:words=>["私", "は", "山", "が", "好き"], :id=>0, :count=>1}, :target=>{:words=>["僕", "は", "海", "も", "好き"], :id=>2, :count=>1}, :weight=>0.25, :id=>1}, {:source=>{:words=>["君", "は", "山", "が", "好き", "かな"], :id=>1, :count=>1}, :target=>{:words=>["僕", "は", "海", "も", "好き"], :id=>2, :count=>1}, :weight=>0.2, :id=>2}], @aspect="real">
+  end
+
+  def test_distance
+    # distance of insert delete is 1
+    assert_equal 1, @meme_tracker.edit_distance(%w{hoge},           %w{hoge huga})
+    assert_equal 1, @meme_tracker.edit_distance(%w{hoge},           %w{huga hoge})
+    assert_equal 1, @meme_tracker.edit_distance(%w{hoge piyo},      %w{hoge huga piyo})
+    assert_equal 1, @meme_tracker.edit_distance(%w{hoge huga piyo}, %w{hoge piyo})
+
+    # distance of change is 1
+    assert_equal 1, @meme_tracker.edit_distance(%w{hoge huga piyo}, %w{hxge huga piyo})
+    assert_equal 1, @meme_tracker.edit_distance(%w{hoge huga piyo}, %w{hoge hxga piyo})
+    assert_equal 1, @meme_tracker.edit_distance(%w{hoge huga piyo}, %w{hoge huga pxyo})
+
+    # change of potion is 2
+    assert_equal 2, @meme_tracker.edit_distance(%w{hoge huga piyo}, %w{huga hoge piyo})
+    assert_equal 2, @meme_tracker.edit_distance(%w{hoge huga piyo}, %w{hoge piyo huga})
+    assert_equal 2, @meme_tracker.edit_distance(%w{hoge huga piyo}, %w{piyo huga hoge})
+
+    base_array = %w{hoge huga piyo puyo}
+    # distance of 2 insert
+    base_array.combination(2) do |pair|
+      assert_equal 2, @meme_tracker.edit_distance(pair, base_array)
+    end
+    # distance of 2 insert
+    base_array.combination(2) do |pair|
+      assert_equal 2, @meme_tracker.edit_distance(base_array, pair)
+    end
+
+    # complex test
+    assert_equal 1, @meme_tracker.edit_distance(%w{A B D D},               %w{A C B D D})
+    assert_equal 2, @meme_tracker.edit_distance(%w{A B D D D},             %w{A C D B D})
+    assert_equal 3, @meme_tracker.edit_distance(%w{A B A A A B A A A A A}, %w{B A A B A A A A})
+
+    # big diff test
+    assert_equal 4, @meme_tracker.edit_distance(%w{A C C C C}, %w{A D D D D})
+    assert_equal 4, @meme_tracker.edit_distance(%w{C A D C C}, %w{A D D D D})
+    assert_equal 4, @meme_tracker.edit_distance(%w{C C A D C}, %w{A D D D D})
+    assert_equal 4, @meme_tracker.edit_distance(%w{C C C A D}, %w{A D D D D})
+    assert_equal 4, @meme_tracker.edit_distance(%w{D D C C A}, %w{A D D D D})
+
+    # big diff test
+    assert_equal 5, @meme_tracker.edit_distance(%w{A C C C C C}, %w{A D D D D D})
+    assert_equal 5, @meme_tracker.edit_distance(%w{C A D C C C}, %w{A D D D D D})
+    assert_equal 5, @meme_tracker.edit_distance(%w{C C A D C C}, %w{A D D D D D})
+    assert_equal 5, @meme_tracker.edit_distance(%w{C C C A D C}, %w{A D D D D D})
+    assert_equal 5, @meme_tracker.edit_distance(%w{C C C C A D}, %w{A D D D D D})
+
+    assert_equal 2, @meme_tracker.edit_distance(%w{F A B C D E}, %w{A B C D E F})
+  end
+
+  #        __(4)___(8)___
+  #       /     ___/     (13)
+  #    (1)___  |____(9)__/
+  #          (5)___
+  #       ___/     (10)__
+  #    (2)___   __/    __(14)
+  #   /   ___(6)___   /
+  #  | (3)___   ___(11)
+  #   \______(7)_________(15)
+  #                (12)__/
+  #
+  #
+  #         (3)/--(2)   (1)
+  #         / X   / \   / \
+  #        / / \ /   \ /   \
+  #       (7)  (6)   (5)   (4)
+  #       /  \ / \  /  \    |
+  # (12) /  (11) (10) (9)  (8)
+  #   \ /      \ /      \  /
+  #   (15)     (14)     (13)
+  #
+  def test_phrase_clusters_1
+    #####################################
+    # test start_vertices and end_vertices
+    start_root_vertices = @meme_tracker.start_root_vertices
+    rg_assert_equal [{id: 1}, {id: 2}, {id: 3}, {id: 12}], start_root_vertices
+
+    end_root_vertices = @meme_tracker.end_root_vertices
+    rg_assert_equal [{id: 13}, {id: 14}, {id: 15}], end_root_vertices
+  end
+
+  def test_phrase_clusters_2
+    ###################################
+    # test for find path from start vertices
+    start_vertex = @graph.vertices.where(id: 8).first
+    cluster = @meme_tracker.build_cluster(start_vertex)
+    path = cluster.find_path(13)
+    rg_assert_equal({id: 13}, path.end_vertex)
+    rg_assert_equal([{id: 13}, {id: 8}], path.vertices)
+
+    start_vertex = @graph.vertices.where(id: 9).first
+    cluster = @meme_tracker.build_cluster(start_vertex)
+    path = cluster.find_path(13)
+    rg_assert_equal({id: 13}, path.end_vertex)
+    rg_assert_equal([{id: 13}, {id: 9}], path.vertices)
+
+    start_vertex = @graph.vertices.where(id: 4).first
+    cluster = @meme_tracker.build_cluster(start_vertex)
+    path = cluster.find_path(13)
+    rg_assert_equal({id: 13}, path.end_vertex)
+    rg_assert_equal([{id: 13}, {id: 8}, {id: 4}], path.vertices)
+
+    start_vertex = @graph.vertices.where(id: 5).first
+    cluster = @meme_tracker.build_cluster(start_vertex)
+    expected = {
+      13 => [{id: 13}, {id: 8}, {id: 5}, {id: 9}],
+      14 => [{id: 14}, {id: 10}, {id: 5}],
+    }
+    rg_assert_equal expected[13], cluster.find_path(13).vertices
+    rg_assert_equal expected[14], cluster.find_path(14).vertices
+
+    start_vertex = @graph.vertices.where(id: 1).first
+    cluster = @meme_tracker.build_cluster(start_vertex)
+    expected = {
+      13 => [{id: 13}, {id: 8},  {id: 4}, {id: 1}, {id: 5}, {id: 9} ],
+      14 => [{id: 14}, {id: 10}, {id: 5}, {id: 1}],
+    }
+    rg_assert_equal expected[13], cluster.find_path(13).vertices
+    rg_assert_equal expected[14], cluster.find_path(14).vertices
+  end
+
+  def test_phrase_clusters_3
+    # fail test
+    start_vertex = Rgraphum::Vertex.new
+    assert @meme_tracker.build_cluster(start_vertex).empty?
+  end
+
+  def test_phrase_clusters_4
+    ###################################
+    # test for one cluster make on graph
+
+    end_root_vertices   = @meme_tracker.end_root_vertices
+    end_vertex = end_root_vertices[0] # (13)
+    start_vertex = @graph.vertices.where(id: 8).first
+    cluster = @meme_tracker.find_cluster(start_vertex, end_vertex)
+    rg_assert_equal [{id: 13}, {id: 8}], cluster
+
+    start_vertex = @graph.vertices.where(id: 9).first
+    cluster = @meme_tracker.find_cluster(start_vertex, end_vertex)
+    rg_assert_equal [{id: 13}, {id: 9}], cluster
+
+    start_vertex = @graph.vertices.where(id: 4).first
+    cluster = @meme_tracker.find_cluster(start_vertex, end_vertex)
+    rg_assert_equal [{id: 13}, {id: 8}, {id: 4}], cluster
+
+    start_vertex = @graph.vertices.where(id: 1).first
+    cluster = @meme_tracker.find_cluster(start_vertex, end_vertex)
+    rg_assert_equal [{id: 13}, {id: 8}, {id: 4}, {id: 9}, {id: 5}, {id: 1}], cluster
+  end
+
+  def test_phrase_clusters_5
+    ###################################
+    # test for multi cluster make on graph
+
+    # 1,2 -> 13 3 => 14, 12 -> 15
+    start_root_vertices = [ @vertices.where(id: 1).first,  @vertices.where(id: 2).first,  @vertices.where(id: 3).first,  @vertices.where(id: 12).first ]
+    end_root_vertices   = [ @vertices.where(id: 13).first, @vertices.where(id: 13).first, @vertices.where(id: 14).first, @vertices.where(id: 15).first ]
+    clusters_a = @meme_tracker.make_communities(start_root_vertices,end_root_vertices)
+    expected = [
+      [ {:id => 13}, {:id => 8},  {:id => 4},  {:id => 9}, {:id => 5}, {:id => 1}, {:id => 2} ],
+      [ {:id => 14}, {:id => 10}, {:id => 11}, {:id => 6}, {:id => 7}, {:id => 3} ],
+      [ {:id => 15}, {:id => 12} ],
+    ]
+    # rg_assert_equal expected, clusters_a
+    (0...expected.size).each do |i|
+      rg_assert_equal expected[i], clusters_a[i].vertices
+    end
+
+    # sum_sigma_in
+    assert_equal 16, @meme_tracker.sum_sigma_in(clusters_a)
+  end
+
+  def test_phrase_clusters_6
+    ##
+    # 1 -> 13 2,3 -> 14, 12 -> 15
+    start_root_vertices = [ @vertices.where(id: 1).first,  @vertices.where(id: 2).first,  @vertices.where(id: 3).first,  @vertices.where(id: 12).first ]
+    end_root_vertices   = [ @vertices.where(id: 13).first, @vertices.where(id: 14).first, @vertices.where(id: 14).first, @vertices.where(id: 15).first ]
+    clusters_b = @meme_tracker.make_communities(start_root_vertices, end_root_vertices)
+    expected = [
+      [ {:id => 13}, {:id => 8},  {:id => 4},  {:id => 9}, {:id => 5}, {:id => 1} ],
+      [ {:id => 14}, {:id => 10}, {:id => 11}, {:id => 6}, {:id => 7}, {:id => 2}, {:id => 3} ],
+      [ {:id => 15}, {:id => 12} ],
+    ]
+    (0...expected.size).each do |i|
+      rg_assert_equal expected[i], clusters_b[i].vertices
+    end
+
+    # sum_sigma_in
+    assert_equal 17, @meme_tracker.sum_sigma_in(clusters_b)
+
+    clusters = @meme_tracker.phrase_clusters
+    assert clusters
+    assert_equal 3, clusters.size
+    (0...clusters_b.size).each do |i|
+      rg_assert_equal clusters_b[i].vertices, clusters[i].vertices
+    end
+  end
+
+  def test_phrase_clusters_7
+    # 1 -> 13 2,3,12 -> 15
+    start_root_vertices = [ @vertices.where(id: 1).first,  @vertices.where(id: 2).first,  @vertices.where(id: 3).first,  @vertices.where(id: 12).first ]
+    end_root_vertices   = [ @vertices.where(id: 13).first, @vertices.where(id: 15).first, @vertices.where(id: 15).first, @vertices.where(id: 15).first ]
+    clusters_c = @meme_tracker.make_communities(start_root_vertices, end_root_vertices)
+    expected = [
+      [ {:id => 13}, {:id => 8}, {:id => 4}, {:id => 9}, {:id => 5}, {:id => 1} ],
+      [ {:id => 15}, {:id => 7}, {:id => 2}, {:id => 3}, {:id => 12} ],
+    ]
+    (0...expected.size).each do |i|
+      rg_assert_equal expected[i], clusters_c[i].vertices
+    end
+
+    # sum_sigma_in
+    assert_equal 11, @meme_tracker.sum_sigma_in(clusters_c)
+  end
+
+  def test_phrase_clusters_8
+    # 1 -> 13 2,3 -> 14, 12 => 15
+    start_root_vertices = [ @vertices.where(id: 1).first,  @vertices.where(id: 2).first,  @vertices.where(id: 3).first,  @vertices.where(id: 12).first ]
+    end_root_vertices   = [ @vertices.where(id: 13).first, @vertices.where(id: 14).first, @vertices.where(id: 14).first, @vertices.where(id: 15).first ]
+    clusters_d = @meme_tracker.make_communities(start_root_vertices, end_root_vertices)
+    expected = [
+      [ {:id => 13}, {:id => 8},  {:id => 4},  {:id => 9}, {:id => 5}, {:id => 1} ],
+      [ {:id => 14}, {:id => 10}, {:id => 11}, {:id => 6}, {:id => 7}, {:id => 2}, {:id  => 3} ],
+      [ {:id => 15}, {:id => 12} ],
+    ]
+    (0...expected.size).each do |i|
+      rg_assert_equal expected[i], clusters_d[i].vertices
+    end
+  end
+
+  def test_path_graph
+    @graph.vertices.each { |vertex|
+      vertex.label == (vertex.label = vertex.id.to_s) # FIXME Why == is here?
+    }
+    meme_tracker = Rgraphum::Analyzer::MemeTracker.new
+
+    # please see under test of fint_path
+
+    graphes = meme_tracker.make_path_graph(@graph)
+
+    assert_equal 4, graphes.size
+
+    expected = [
+      {id: 13, label: "13"},
+      {id: 8,  label: "8"},
+      {id: 4,  label: "4"},
+      {id: 9,  label: "9"},
+      {id: 14, label: "14"},
+      {id: 10, label: "10"},
+      {id: 5,  label: "5"},
+      {id: 1,  label: "1"},
+    ]
+    rg_assert_equal expected, graphes[0].vertices
+
+    expected = [
+      {id: 0,  source: {id: 1,  label: "1"}, target: {id: 4,  label: "4"},  weight: 1},
+      {id: 1,  source: {id: 1,  label: "1"}, target: {id: 5,  label: "5"},  weight: 1},
+      {id: 7,  source: {id: 4,  label: "4"}, target: {id: 8,  label: "8"},  weight: 1},
+      {id: 9,  source: {id: 5,  label: "5"}, target: {id: 9,  label: "9"},  weight: 1},
+      {id: 10, source: {id: 5,  label: "5"}, target: {id: 10, label: "10"}, weight: 1},
+      {id: 15, source: {id: 8,  label: "8"}, target: {id: 13, label: "13"}, weight: 1},
+      {id: 17, source: {id: 10, label: "10"},target: {id: 14, label: "14"}, weight: 1},
+    ]
+    rg_assert_equal expected, graphes[0].edges.sort_by(){|edge| edge.id}
+  end
+
+  def test_cut_edges_with_srn
+    @graph = Rgraphum::Analyzer::MemeTracker.new.cut_edges_with_srn(@graph)
+    @graph.edges.sort_by{|edge| edge.id }.each do |edge|
+      #p     edge
+    end
+  end
+
+  private
+
+  def make_base_phrase_graph
+    phrase_array = [
+      { id:  1, words: %w{A} },
+      { id:  2, words: %w{A} },
+    ]
+    Rgraphum::Analyzer::MemeTracker.new(phrase_array)
+  end
+
+  def make_sample_graph_for_cluster
+    graph = Rgraphum::Graph.new
+    graph.vertices = [
+      {id:  1}, {id:  2}, {id:  3}, {id:  4}, {id:  5},
+      {id:  6}, {id:  7}, {id:  8}, {id:  9}, {id: 10},
+      {id: 11}, {id: 12}, {id: 13}, {id: 14}, {id: 15},
+    ]
+    graph.edges = [
+      {source:  1, target:  4}, {source: 1, target:  5},
+      {source:  2, target:  5}, {source: 2, target:  6}, {source: 2, target: 7},
+      {source:  3, target:  6}, {source: 3, target:  7},
+      {source:  4, target:  8},
+      {source:  5, target:  8}, {source: 5, target:  9}, {source: 5, target: 10},
+      {source:  6, target: 10}, {source: 6, target: 11},
+      {source:  7, target: 11}, {source: 7, target: 15},
+      {source:  8, target: 13},
+      {source:  9, target: 13},
+      {source: 10, target: 14},
+      {source: 11, target: 14},
+      {source: 12, target: 15},
+    ]
+    graph.edges.each { |edge| edge.weight = 1 }
+    graph
+  end
+end

data/test/lib/rgraphum/analyzer/twitter/rt_at_mark_test.rb

@@ -0,0 +1,120 @@
+# coding: utf-8
+
+require 'test_helper'
+require 'rgraphum'
+require 'csv'
+
+class RTAtMarkTest < MiniTest::Test
+  def setup
+    twits
+  end
+
+  def test_make_graph
+    at = Rgraphum::Analyzer::RTAtMark.new
+    graph = at.make_graph(@twits)
+
+    assert_equal 4, graph.vertices.size
+
+    vertex = graph.vertices.detect { |vertex| vertex.id == 0 }
+    assert vertex
+    rg_assert_equal({id: 0, label: "piyo",
+                         twits: [["221257277779353600", "piyo", "I remember it",    "2013-04-04 15:30:00", "ja"],
+                                 ["221257277779353602", "piyo", "I like it",        "2013-04-04 15:30:00", "ja"],
+                                 ["221257277779353605", "piyo", "I forget it",      "2013-04-04 15:30:00", "ja"],
+                                 ["221257277779353605", "piyo", "@hura I forget it","2013-04-04 15:30:00", "ja"]]}, vertex )
+    vertex = graph.vertices.detect { |vertex| vertex.id == 1 }
+    assert vertex
+    rg_assert_equal({id: 1, label: "hoge",
+                         twits: [["221257277779353601","hoge","@hoge remember me!","2013-01-01 12:00:00","ja"],
+                                 ["221257277779353604","hoge","Jast me @huga Do you mean @Hoge remember me!","2013-03-03 14:20:00","ja"]]}, vertex)
+
+    vertex = graph.vertices.detect { |vertex| vertex.id == 2 }
+    assert vertex
+    rg_assert_equal({id: 2, label: "huga",
+                         twits: [["221257277779353603","huga","Do you mean @hoge remember me!","2013-02-02 13:10:00","ja"],
+                                 ["221257277779353604","huga","Do you mean @Hoge remember me!","2013-03-03 14:20:00","ja"]]}, vertex)
+
+    vertex = graph.vertices.detect { |vertex| vertex.id == 3 }
+    assert vertex
+    rg_assert_equal({id: 3, label: "hura"}, vertex)
+  
+    assert_equal 5, graph.edges.size
+
+    edge = graph.edges.detect { |edge| edge.id == 0 }
+    assert edge
+    expected_edge = {id: 0, source: graph.vertices[1], target: graph.vertices[1], label: "@hoge remember me!", weight: 1}
+    assert_equal(expected_edge[:source].id, edge.source.id)
+    assert_equal(expected_edge[:target].id, edge.target.id)
+    assert_equal(expected_edge[:label],     edge.label)
+    assert_equal(expected_edge[:weight],    edge.weight)
+
+    edge = graph.edges.detect { |edge| edge.id == 1 }
+    assert edge
+    expected_edge = {id: 1, source: graph.vertices[1], target: graph.vertices[2], label: "Do you mean @hoge remember me!", weight: 1}
+    assert_equal(expected_edge[:source].id, edge.source.id)
+    assert_equal(expected_edge[:target].id, edge.target.id)
+    assert_equal(expected_edge[:label],     edge.label)
+    assert_equal(expected_edge[:weight],    edge.weight)
+
+    edge = graph.edges.detect { |edge| edge.id == 2 }
+    assert edge
+    expected_edge = {id: 2, source: graph.vertices[1], target: graph.vertices[2], label: "Do you mean @Hoge remember me!", weight: 1}
+    assert_equal(expected_edge[:source].id, edge.source.id)
+    assert_equal(expected_edge[:target].id, edge.target.id)
+    assert_equal(expected_edge[:label],     edge.label)
+    assert_equal(expected_edge[:weight],    edge.weight)
+
+    edge = graph.edges.detect { |edge| edge.id == 3 }
+    assert edge
+    expected_edge = {id: 3, source: graph.vertices[2], target: graph.vertices[1], label: "Jast me @huga Do you mean @Hoge remember me!", weight: 1}
+    assert_equal(expected_edge[:source].id, edge.source.id)
+    assert_equal(expected_edge[:target].id, edge.target.id)
+    assert_equal(expected_edge[:label],     edge.label)
+    assert_equal(expected_edge[:weight],    edge.weight)
+
+    edge = graph.edges.detect { |edge| edge.id == 4 }
+    assert edge
+    expected_edge = {id: 4, source: graph.vertices[3], target: graph.vertices[0], label: "@hura I forget it", weight: 1}
+    assert_equal(expected_edge[:source].id, edge.source.id)
+    assert_equal(expected_edge[:target].id, edge.target.id)
+    assert_equal(expected_edge[:label],     edge.label)
+    assert_equal(expected_edge[:weight],    edge.weight)
+  end
+
+  def test_pickup_screen_name
+    at = Rgraphum::Analyzer::RTAtMark.new
+    text = "@hoge huga"
+    assert_equal "hoge", at.pickup_screen_name(text)
+
+    text = " @hoge huga"
+    assert_equal "hoge", at.pickup_screen_name(text)
+
+    text = "huga @hoge"
+    assert_equal "hoge", at.pickup_screen_name(text)
+
+    text = "(@hoge) huga"
+    assert_equal "hoge", at.pickup_screen_name(text)
+
+    text = "@hoge: huga"
+    assert_equal "hoge", at.pickup_screen_name(text)
+
+    text = "@Hoge_Huga"
+    assert_equal "hoge_huga", at.pickup_screen_name(text)
+  end
+
+  private
+
+  def twits
+    @twits = [
+      ["221257277779353600",nil,nil,nil,nil,nil,nil,"piyo","I remember it"                               ,nil,nil,"2013-04-04 15:30:00","ja",nil],
+      ["221257277779353601",nil,nil,nil,nil,nil,nil,"hoge","@hoge remember me!"                          ,nil,nil,"2013-01-01 12:00:00","ja",nil],
+      ["221257277779353602",nil,nil,nil,nil,nil,nil,"piyo","I like it"                                   ,nil,nil,"2013-04-04 15:30:00","ja",nil],
+      ["221257277779353603",nil,nil,nil,nil,nil,nil,"huga","Do you mean @hoge remember me!"              ,nil,nil,"2013-02-02 13:10:00","ja",nil],
+      ["221257277779353604",nil,nil,nil,nil,nil,nil,"huga","Do you mean @Hoge remember me!"              ,nil,nil,"2013-03-03 14:20:00","ja",nil],
+      ["221257277779353604",nil,nil,nil,nil,nil,nil,"hoge","Jast me @huga Do you mean @Hoge remember me!",nil,nil,"2013-03-03 14:20:00","ja",nil],
+      ["221257277779353605",nil,nil,nil,nil,nil,nil,"piyo","I forget it"                                 ,nil,nil,"2013-04-04 15:30:00","ja",nil],
+      ["221257277779353605",nil,nil,nil,nil,nil,nil,"piyo","@hura I forget it"                           ,nil,nil,"2013-04-04 15:30:00","ja",nil]
+    ]
+  end
+
+end

data/test/lib/rgraphum/array_test.rb

@@ -0,0 +1,95 @@
+# -*- coding: utf-8 -*-
+
+require 'rgraphum'
+require 'test_helper'
+
+class RgraphumArrayTest < MiniTest::Test
+  def setup
+    @graph = Rgraphum::Graph.new
+  end
+
+  def test_vertex_in_E_in_outE_out
+    @graph.vertices = [
+      {:id => 1, :label => "hoge" },
+      {:id => 2, :label => "huga" },
+    ]
+    @graph.edges = [{id: 1, source: 1, target: 2}]
+
+    # rg_assert_equal [{id:1, source: {id:1, label:"hoge"}, target:{id: 2, label: "huga"}}], @graph.vertices[0].edges
+    assert_equal 1, @graph.vertices[0].edges.size
+    assert_equal 1, @graph.vertices[0].edges[0].id
+    rg_assert_equal({id: 1, label: "hoge"}, @graph.vertices[0].edges[0].source)
+    rg_assert_equal({id: 2, label: "huga"}, @graph.vertices[0].edges[0].target)
+
+    assert_empty @graph.vertices[0].inE
+    assert_empty @graph.vertices[0].in
+    # rg_assert_equal [{ id:1, source: {id:1,label:"hoge"}, target:{id:2,label:"huga"} }], @graph.vertices[0].outE
+    assert_equal 1, @graph.vertices[0].outE.size
+    assert_equal 1, @graph.vertices[0].outE[0].id
+    rg_assert_equal({id:1,label:"hoge"}, @graph.vertices[0].outE[0].source)
+    rg_assert_equal({id:2,label:"huga"}, @graph.vertices[0].outE[0].target)
+
+    rg_assert_equal [{id:2,label:"huga"}], @graph.vertices[0].out
+
+    assert_empty @graph.vertices[1].outE
+    assert_empty @graph.vertices[1].out
+    # rg_assert_equal [{id:1, source: {id:1,label:"hoge"}, target:{id:2,label:"huga"} }], @graph.vertices[1].inE
+    assert_equal 1, @graph.vertices[1].inE.size
+    assert_equal 1, @graph.vertices[1].inE[0].id
+    rg_assert_equal({id: 1,label: "hoge"}, @graph.vertices[1].inE[0].source)
+    rg_assert_equal({id: 2,label: "huga"}, @graph.vertices[1].inE[0].target)
+    rg_assert_equal [{id:1,label:"hoge"}], @graph.vertices[1].in
+  end
+
+  def test_start_root_vertices
+    @graph.vertices = [
+      { id: 1, label: "a" },
+      { id: 2, label: "b" },
+      { id: 3, label: "c" },
+      { id: 4, label: "d" },
+      { id: 5, label: "e" },
+      { id: 6, label: "f" },
+      { id: 7, label: "g" },
+      { id: 8, label: "h" },
+      { id: 9, label: "i" },
+    ]
+    @graph.edges = [
+      { source: 1, target: 2 }, # *1 "a"
+      { source: 2, target: 3 },
+      { source: 3, target: 4 },
+      { source: 5, target: 4 }, # *5 "e"
+      { source: 3, target: 6 },
+      { source: 7, target: 6 }, # *7 "g"
+      { source: 7, target: 8 },
+      #                         # *9 "i"
+    ]
+
+    assert_equal ["a", "e", "g", "i"], @graph.start_root_vertices.map(&:label)
+  end
+
+  def test_end_root_vertices
+    @graph.vertices = [
+      { id: 1, label: "a" },
+      { id: 2, label: "b" },
+      { id: 3, label: "c" },
+      { id: 4, label: "d" },
+      { id: 5, label: "e" },
+      { id: 6, label: "f" },
+      { id: 7, label: "g" },
+      { id: 8, label: "h" },
+      { id: 9, label: "i" },
+    ]
+    @graph.edges = [
+      { source: 1, target: 2 },
+      { source: 2, target: 3 },
+      { source: 3, target: 4 }, # *4 "d"
+      { source: 5, target: 4 },
+      { source: 3, target: 6 }, # *6 "f"
+      { source: 7, target: 6 },
+      { source: 7, target: 8 }, # *8 "h"
+      #                         # *9 "i"
+    ]
+
+    assert_equal ["d", "f", "h", "i"], @graph.end_root_vertices.map(&:label)
+  end
+end

data/test/lib/rgraphum/bubble_test.rb

@@ -0,0 +1,7 @@
+require 'test_helper'
+
+class BubbleTest < MiniTest::Test
+  # test "the truth" do
+  #   assert true
+  # end
+end

data/test/lib/rgraphum/communities_test.rb

@@ -0,0 +1,53 @@
+# -*- coding: utf-8 -*-
+
+require 'test_helper'
+require 'rgraphum'
+
+class RgraphumCommunitiesTest < MiniTest::Test
+  def setup
+  end
+
+  def test_new_communities
+    communities = Rgraphum::Communities.new
+
+    assert_empty communities
+  end
+
+  def test_communities_with_1_community
+    communities = Rgraphum::Communities.new
+    community = communities.build({})
+
+    assert_equal 1, communities.size
+    assert_same community, communities[0]
+  end
+
+  def test_converter
+    communities = Rgraphum::Communities.new
+    communities2 = Rgraphum::Communities(communities)
+
+    assert_same communities, communities2
+  end
+
+  def test_delete
+    communities = Rgraphum::Communities.new
+    c1 = communities.build(id: 1)
+    c2 = communities.build(id: 2)
+    c3 = communities.build(id: 3)
+    c4 = communities.build(id: 4)
+    c5 = communities.build(id: 5)
+
+    assert_equal 5, communities.size
+    assert_equal [1,2,3,4,5], communities.map(&:id)
+
+    communities.delete c2
+
+    assert_equal 4, communities.size
+    assert_equal [1,3,4,5], communities.map(&:id)
+
+
+    communities.delete c5.id
+
+    assert_equal 3, communities.size
+    assert_equal [1,3,4], communities.map(&:id)
+  end
+end

data/test/lib/rgraphum/cosine_similarity_test.rb

@@ -0,0 +1,18 @@
+# -*- coding: utf-8 -*-
+
+require 'rgraphum'
+require 'test_helper'
+
+class CosineSimilarityTest < MiniTest::Test
+  
+  def test_similarity
+    csm  = CosineSimilarityMatrix.new
+    sim = csm.similarity( [[1,1],[1,-1],[-1,1],[-1,-1] ] )
+
+    assert_equal [
+           [ 1.0,  0.0,  0.0, -1.0],
+           [ 0.0,  1.0, -1.0,  0.0],
+           [ 0.0, -1.0,  1.0,  0.0],
+           [-1.0,  0.0,  0.0,  1.0]], sim
+  end
+end