rgraphum 0.0.1.alpha

data/test/lib/rgraphum/vertices_test.rb

@@ -0,0 +1,180 @@
+# -*- coding: utf-8 -*-
+
+require 'rgraphum'
+require 'test_helper'
+
+class RgraphumVerticesTest < MiniTest::Test
+  def setup
+    @graph = Rgraphum::Graph.new
+    @graph.vertices << { id: 1, label: "hoge" }
+    @graph.vertices << { id: 2, label: "huga" }
+
+    @vertex0, @vertex1 = @graph.vertices
+  end
+
+  def test_vertices
+    assert_instance_of Rgraphum::Vertex,   @vertex0
+    assert_empty @vertex0.edges
+    assert_instance_of Rgraphum::Edges,  @vertex0.edges
+
+    @vertex0.edges << { source: @vertex0, target: @vertex1 }
+
+    # rg_assert_equal [ { id: 0, source: @vertex0, target: @vertex1 } ], @vertex0.edges
+    # rg_assert_equal [ { id: 0, source: @vertex0, target: @vertex1 } ], @vertex1.edges
+    # rg_assert_equal [ { id: 0, source: @vertex0, target: @vertex1 } ], @graph.edges
+
+    # rg_assert_equal [ { id: 0, source: @vertex0, target: @vertex1 } ], @vertex0.edges
+    assert_equal 1, @vertex0.edges.size
+    assert_equal 0, @vertex0.edges[0].id
+    rg_assert_equal @vertex0, @vertex0.edges[0].source
+    rg_assert_equal @vertex1, @vertex0.edges[0].target
+
+    # rg_assert_equal [ { id: 0, source: @vertex0, target: @vertex1 } ], @vertex1.edges
+    assert_equal 1, @vertex1.edges.size
+    assert_equal 0, @vertex1.edges[0].id
+    rg_assert_equal @vertex0, @vertex1.edges[0].source
+    rg_assert_equal @vertex1, @vertex1.edges[0].target
+
+    # rg_assert_equal [ { id: 0, source: @vertex0, target: @vertex1 } ], @graph.edges
+    assert_equal 1, @graph.edges.size
+    assert_equal 0, @graph.edges[0].id
+    rg_assert_equal @vertex0, @graph.edges[0].source
+    rg_assert_equal @vertex1, @graph.edges[0].target
+  end
+
+  def test_vertices_dump_and_load
+    vertex1 = Rgraphum::Vertex.new(id: 1, label: "vertex 1")
+    vertex2 = Rgraphum::Vertex.new(id: 2, label: "vertex 2")
+    vertices = [vertex1, vertex2, vertex1]
+
+    data = Marshal.dump(vertices)
+    vertices_dash = Marshal.load(data)
+
+    rg_assert_equal vertices, vertices_dash
+    rg_refute_equal vertices_dash[0], vertices_dash[1]
+    assert_same  vertices_dash[0], vertices_dash[2]
+  end
+
+  def test_finders_with_where
+    10.times do |i|
+      @graph.vertices << { label: "aaa" }
+    end
+    @graph.vertices << { label: "foo" }
+    @graph.vertices << { label: "bar" }
+
+    assert_equal 2,  @graph.vertices.where(label: "huga").first.id
+    assert_equal 3,  @graph.vertices.where(label: "aaa").first.id
+    assert_equal 12, @graph.vertices.where(label: "aaa").last.id
+    assert_equal 10, @graph.vertices.where(label: "aaa").all.size
+  end
+
+  def test_delete
+    @vertex2 = @graph.vertices.build(label: "v 2")
+    @vertex3 = @graph.vertices.build(label: "v 3")
+    @graph.edges << { source: @vertex0, target: @vertex1 }
+    @graph.edges << { source: @vertex1, target: @vertex2 }
+    @graph.edges << { source: @vertex2, target: @vertex3 }
+    @graph.edges << { source: @vertex3, target: @vertex0 }
+
+    # v0 -> v1 -> v2 -> v3
+    #  ^                 |
+    #  +-----------------+
+    assert_equal 4, @graph.vertices.size
+    assert_equal 4, @graph.edges.size
+
+    @graph.vertices.delete @vertex2
+
+    # v0 -> v1          v3
+    #  ^                 |
+    #  +-----------------+
+    assert_equal 3, @graph.vertices.size
+    assert_equal 2, @graph.edges.size
+  end
+
+  # delete_if calls delete
+  # delete_if == reject!
+  def test_delete_if
+    graph = Rgraphum::Graph.new
+    (0..9).each do |i|
+      graph.vertices << { label: "v#{i}" }
+    end
+    (0..9).each do |i|
+      graph.edges << {
+        source: graph.vertices[i],
+        target: graph.vertices[(i+1) % 10],
+        weight: i,
+      }
+    end
+
+    # v0 -> v1 -> v2 -> v3 -> v4 -> v5 -> v6 -> v7 -> v8 -> v9
+    #  ^                                                     |
+    #  +-----------------------------------------------------+
+    assert_equal 10, graph.vertices.size
+    assert_equal 10, graph.edges.size
+    graph.vertices do |vertex|
+      assert_equal 2, vertex.edges.size
+    end
+
+    graph.vertices.delete_if { |vertex|
+      (vertex.label.delete('v').to_i % 3) == 0
+    }
+
+    #       v1 -> v2          v4 -> v5          v7 -> v8
+    assert_equal  6, graph.vertices.size
+    assert_equal  3, graph.edges.size
+
+    assert_equal  "v1", graph.vertices[0].label
+    assert_equal  "v2", graph.vertices[1].label
+    assert_equal  "v4", graph.vertices[2].label
+    assert_equal  "v5", graph.vertices[3].label
+    assert_equal  "v7", graph.vertices[4].label
+    assert_equal  "v8", graph.vertices[5].label
+
+    graph.vertices do |vertex|
+      assert_equal 1, vertex.edges.size
+    end
+  end
+
+  def test_reject
+    graph = Rgraphum::Graph.new
+    (0..9).each do |i|
+      graph.vertices << { label: "v#{i}" }
+    end
+    (0..9).each do |i|
+      graph.edges << {
+        source: graph.vertices[i],
+        target: graph.vertices[(i+1) % 10],
+        weight: i,
+      }
+    end
+
+    # v0 -> v1 -> v2 -> v3 -> v4 -> v5 -> v6 -> v7 -> v8 -> v9
+    #  ^                                                     |
+    #  +-----------------------------------------------------+
+    assert_equal 10, graph.vertices.size
+
+    rejected_vertices = graph.vertices.reject { |vertex|
+      (vertex.label.delete('v').to_i % 3) == 0
+    }
+
+    assert_equal 10, graph.vertices.size, "Should not change size"
+
+    #       v1 -> v2          v4 -> v5          v7 -> v8
+    assert_equal  6, rejected_vertices.size
+  end
+
+  def test_plural_set
+    expected_vertices = [
+      { label: "A" },
+      { label: "B" },
+      { label: "C" },
+    ]
+
+    graph = Rgraphum::Graph.new
+    graph.vertices = expected_vertices
+
+    expected_vertices.each_with_index do |expected_vertex, i|
+      assert_equal expected_vertex[:label], graph.vertices[i].label
+    end
+  end
+end

data/test/test_helper.rb

@@ -0,0 +1,98 @@
+# -*- coding: utf-8 -*-
+
+require 'minitest'
+require 'minitest/autorun'
+require 'tempfile'
+require 'pp'
+
+class MiniTest::Test
+  # Add more helper methods to be used by all tests here...
+
+  # alias :original_assert_equal :assert_equal
+  #
+  # # assert_equal(exp, act, msg = nil)
+  # def assert_equal(exp, act, msg = nil)
+  #   binding.pry if @breakpoint
+  #   exp = exp.to_hash if exp.is_a?(Rgraphum::Vertex) || exp.is_a?(Rgraphum::Edge)
+  #   act = act.to_hash if act.is_a?(Rgraphum::Vertex) || act.is_a?(Rgraphum::Edge)
+  #   if exp.is_a?(Rgraphum::RgraphumArray)
+  #     exp = exp.map(&:to_hash)
+  #   elsif exp.is_a?(Array) && exp.find { |item| item.is_a?(Rgraphum::Vertex) || item.is_a?(Rgraphum::Edge) }
+  #     exp = exp.map(&:to_hash)
+  #   end
+  #   if act.is_a?(Rgraphum::RgraphumArray)
+  #     act = act.map(&:to_hash)
+  #   elsif act.is_a?(Array) && act.find { |item| item.is_a?(Rgraphum::Vertex) || item.is_a?(Rgraphum::Edge) }
+  #     act = act.map(&:to_hash)
+  #   end
+  #   original_assert_equal(exp, act, msg)
+  # end
+
+  def rg_assert_equal(exp, act, msg = nil)
+    binding.pry if @breakpoint
+    exp, act = rg_convert_exp_and_act(exp, act)
+    assert_equal(exp, act, msg)
+  end
+
+  def rg_refute_equal(exp, act, msg = nil)
+    binding.pry if @breakpoint
+    exp, act = rg_convert_exp_and_act(exp, act)
+    refute_equal(exp, act, msg)
+  end
+
+  def assert_breakpoint!(on=true)
+    @breakpoint = on
+  end
+
+  private
+
+  def rg_convert_exp_and_act(exp, act)
+    exp = exp.to_hash if exp.is_a?(Rgraphum::Vertex) || exp.is_a?(Rgraphum::Edge)
+    act = act.to_hash if act.is_a?(Rgraphum::Vertex) || act.is_a?(Rgraphum::Edge)
+    if exp.is_a?(Rgraphum::RgraphumArray)
+      exp = exp.map(&:to_hash)
+    elsif exp.is_a?(Array) && exp.find { |item| item.is_a?(Rgraphum::Vertex) || item.is_a?(Rgraphum::Edge) }
+      exp = exp.map(&:to_hash)
+    end
+    if act.is_a?(Rgraphum::RgraphumArray)
+      act = act.map(&:to_hash)
+    elsif act.is_a?(Array) && act.find { |item| item.is_a?(Rgraphum::Vertex) || item.is_a?(Rgraphum::Edge) }
+      act = act.map(&:to_hash)
+    end
+    [exp, act]
+  end
+end
+
+module ClearVerticesAndEdgesIdHolder
+  def before_setup
+    super
+    Rgraphum::Vertices.reset_id
+    Rgraphum::Edges.reset_id
+  end
+end
+
+class MiniTest::Unit::TestCase
+  include ClearVerticesAndEdgesIdHolder
+end
+
+module Minitest
+  class Assertion
+    # def location
+    #   last_before_assertion = ""
+    #   self.backtrace.reverse_each do |s|
+    #     break if s =~ /in .(assert|refute|flunk|pass|fail|raise|must|wont)/
+    #     last_before_assertion = s
+    #   end
+    #   last_before_assertion.sub(/:in .*$/, "")
+    # end
+
+    def location
+      last_before_assertion = ""
+      self.backtrace.reverse_each do |s|
+        break if s =~ /in .(rg_|)(assert|refute|flunk|pass|fail|raise|must|wont)/
+        last_before_assertion = s
+      end
+      last_before_assertion.sub(/:in .*$/, "")
+    end
+  end
+end

metadata

@@ -0,0 +1,254 @@
+--- !ruby/object:Gem::Specification
+name: rgraphum
+version: !ruby/object:Gem::Version
+  version: 0.0.1.alpha
+  prerelease: 6
+platform: ruby
+authors:
+- omi
+- ice
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2013-08-31 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: builder
+  requirement: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: bundler
+  requirement: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '1.3'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '1.3'
+- !ruby/object:Gem::Dependency
+  name: minitest
+  requirement: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: yard
+  requirement: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+description: ! 'Rgraphum: Graphum ruby implementation'
+email:
+- rgraphum@rgraphum.com
+executables:
+- rgraphum_console
+- rgraphum_runner
+extensions: []
+extra_rdoc_files: []
+files:
+- .gitignore
+- GLOSSARIES.md
+- GREMLIN.md
+- Gemfile
+- LICENSE.txt
+- README.md
+- Rakefile
+- bin/.irbrc
+- bin/rgraphum_console
+- bin/rgraphum_runner
+- examples/ba_model/make.rb
+- examples/ba_model/make_dummy_twitter_rt_data.rb
+- examples/basic/check_modularity.rb
+- examples/basic/make_graph.rb
+- examples/parser/dot.rb
+- examples/sis_model/lifegame.rb
+- graph_struct.jpg
+- lib/rgraphum.rb
+- lib/rgraphum/analyzer.rb
+- lib/rgraphum/analyzer/linear_regression.rb
+- lib/rgraphum/analyzer/meme_tracker.rb
+- lib/rgraphum/analyzer/twitter/rt_at_mark.rb
+- lib/rgraphum/cluster.rb
+- lib/rgraphum/communities.rb
+- lib/rgraphum/community.rb
+- lib/rgraphum/cosine_similarity_matrix.rb
+- lib/rgraphum/edge.rb
+- lib/rgraphum/edges.rb
+- lib/rgraphum/ext/cosine_similarity_matrix.rb
+- lib/rgraphum/ext/linear_regression.rb
+- lib/rgraphum/ext/tf_idf.rb
+- lib/rgraphum/graph.rb
+- lib/rgraphum/graph/gremlin.rb
+- lib/rgraphum/graph/math.rb
+- lib/rgraphum/graph/math/clustering_coefficient.rb
+- lib/rgraphum/graph/math/community_detection.rb
+- lib/rgraphum/graph/math/degree_distribution.rb
+- lib/rgraphum/graph/math/dijkstra.rb
+- lib/rgraphum/importer.rb
+- lib/rgraphum/marshal.rb
+- lib/rgraphum/motifs.rb
+- lib/rgraphum/parsers.rb
+- lib/rgraphum/parsers/flare.rb
+- lib/rgraphum/parsers/gephi.rb
+- lib/rgraphum/parsers/graphviz.rb
+- lib/rgraphum/parsers/miserables.rb
+- lib/rgraphum/path.rb
+- lib/rgraphum/query.rb
+- lib/rgraphum/rgraphum_array.rb
+- lib/rgraphum/rgraphum_array_dividers.rb
+- lib/rgraphum/rgraphum_random.rb
+- lib/rgraphum/simulator.rb
+- lib/rgraphum/simulator/ba_model.rb
+- lib/rgraphum/simulator/sir_model.rb
+- lib/rgraphum/simulator/sis_model.rb
+- lib/rgraphum/statistic/power_law.rb
+- lib/rgraphum/t.rb
+- lib/rgraphum/tf_idf.rb
+- lib/rgraphum/version.rb
+- lib/rgraphum/vertex.rb
+- lib/rgraphum/vertices.rb
+- performance/add-vertices-edges.rb
+- performance/add-vertices.rb
+- performance/build-graph.rb
+- performance/delete-graph.rb
+- performance/delete-vertices.rb
+- performance/refer-graph.rb
+- rgraphum.gemspec
+- test/lib/rgraphum/analyzer/linear_regression_test.rb
+- test/lib/rgraphum/analyzer/meme_tracker_test.rb
+- test/lib/rgraphum/analyzer/twitter/rt_at_mark_test.rb
+- test/lib/rgraphum/array_test.rb
+- test/lib/rgraphum/bubble_test.rb
+- test/lib/rgraphum/communities_test.rb
+- test/lib/rgraphum/cosine_similarity_test.rb
+- test/lib/rgraphum/edge_test.rb
+- test/lib/rgraphum/edges_test.rb
+- test/lib/rgraphum/graph_builder_test.rb
+- test/lib/rgraphum/graph_dup_test.rb
+- test/lib/rgraphum/graph_plus_test.rb
+- test/lib/rgraphum/graph_test.rb
+- test/lib/rgraphum/gremlin_test.rb
+- test/lib/rgraphum/importers/idg_json_edges.json
+- test/lib/rgraphum/importers/idg_json_test.rb
+- test/lib/rgraphum/importers/idg_json_vertices.json
+- test/lib/rgraphum/math/average_distance_matrix_test.rb
+- test/lib/rgraphum/math/clustering_coefficient_test.rb
+- test/lib/rgraphum/math/community_test.rb
+- test/lib/rgraphum/math/degree_distribution_test.rb
+- test/lib/rgraphum/math/dijkstra_test.rb
+- test/lib/rgraphum/math/modularity_test.rb
+- test/lib/rgraphum/math/quick_average_distance_matrix_test.rb
+- test/lib/rgraphum/path_test.rb
+- test/lib/rgraphum/query/enumerable_test.rb
+- test/lib/rgraphum/query/where_operators_test.rb
+- test/lib/rgraphum/query/where_test.rb
+- test/lib/rgraphum/simulator/ba_model_test.rb
+- test/lib/rgraphum/simulator/sir_model_test.rb
+- test/lib/rgraphum/simulator/sis_model_test.rb
+- test/lib/rgraphum/simulator_test.rb
+- test/lib/rgraphum/tf_idf_test.rb
+- test/lib/rgraphum/vertex_test.rb
+- test/lib/rgraphum/vertices_test.rb
+- test/test_helper.rb
+- tmp/.gitkeep
+homepage: http://rgraphum.com
+licenses:
+- MIT
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  none: false
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  none: false
+  requirements:
+  - - ! '>'
+    - !ruby/object:Gem::Version
+      version: 1.3.1
+requirements: []
+rubyforge_project: 
+rubygems_version: 1.8.25
+signing_key: 
+specification_version: 3
+summary: Graphum is graph, vertex and edge manipulation library.
+test_files:
+- test/lib/rgraphum/analyzer/linear_regression_test.rb
+- test/lib/rgraphum/analyzer/meme_tracker_test.rb
+- test/lib/rgraphum/analyzer/twitter/rt_at_mark_test.rb
+- test/lib/rgraphum/array_test.rb
+- test/lib/rgraphum/bubble_test.rb
+- test/lib/rgraphum/communities_test.rb
+- test/lib/rgraphum/cosine_similarity_test.rb
+- test/lib/rgraphum/edge_test.rb
+- test/lib/rgraphum/edges_test.rb
+- test/lib/rgraphum/graph_builder_test.rb
+- test/lib/rgraphum/graph_dup_test.rb
+- test/lib/rgraphum/graph_plus_test.rb
+- test/lib/rgraphum/graph_test.rb
+- test/lib/rgraphum/gremlin_test.rb
+- test/lib/rgraphum/importers/idg_json_edges.json
+- test/lib/rgraphum/importers/idg_json_test.rb
+- test/lib/rgraphum/importers/idg_json_vertices.json
+- test/lib/rgraphum/math/average_distance_matrix_test.rb
+- test/lib/rgraphum/math/clustering_coefficient_test.rb
+- test/lib/rgraphum/math/community_test.rb
+- test/lib/rgraphum/math/degree_distribution_test.rb
+- test/lib/rgraphum/math/dijkstra_test.rb
+- test/lib/rgraphum/math/modularity_test.rb
+- test/lib/rgraphum/math/quick_average_distance_matrix_test.rb
+- test/lib/rgraphum/path_test.rb
+- test/lib/rgraphum/query/enumerable_test.rb
+- test/lib/rgraphum/query/where_operators_test.rb
+- test/lib/rgraphum/query/where_test.rb
+- test/lib/rgraphum/simulator/ba_model_test.rb
+- test/lib/rgraphum/simulator/sir_model_test.rb
+- test/lib/rgraphum/simulator/sis_model_test.rb
+- test/lib/rgraphum/simulator_test.rb
+- test/lib/rgraphum/tf_idf_test.rb
+- test/lib/rgraphum/vertex_test.rb
+- test/lib/rgraphum/vertices_test.rb
+- test/test_helper.rb