graph.njae 0.3.0 → 0.3.1
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- data/VERSION +1 -1
- data/graph.njae.gemspec +1 -1
- data/lib/graph.njae/graph.rb +13 -1
- metadata +8 -8
data/VERSION
CHANGED
|
@@ -1 +1 @@
|
|
|
1
|
-
0.3.
|
|
1
|
+
0.3.1
|
data/graph.njae.gemspec
CHANGED
data/lib/graph.njae/graph.rb
CHANGED
|
@@ -66,6 +66,10 @@ module GraphNjae
|
|
|
66
66
|
end
|
|
67
67
|
|
|
68
68
|
|
|
69
|
+
# Calculates the initial similarity of each vertex in a product graph.
|
|
70
|
+
# If passed an optional block, that block is used to find the
|
|
71
|
+
# initial similarity. If no block is given, every vertex is given
|
|
72
|
+
# an initial similarity of 1.0.
|
|
69
73
|
def initial_similarity
|
|
70
74
|
self.vertices.each do |v|
|
|
71
75
|
if block_given?
|
|
@@ -77,8 +81,16 @@ module GraphNjae
|
|
|
77
81
|
end
|
|
78
82
|
end
|
|
79
83
|
|
|
80
|
-
# Performs similarity flooding on a graph
|
|
84
|
+
# Performs similarity flooding on a graph, as described by
|
|
85
|
+
# Sergey Melnik, Hector Garcia-Molina, and Erhard Rahm,
|
|
86
|
+
# "Similarity Flooding: A Versatile Graph Matching Algorithm
|
|
87
|
+
# and its Application to Schema Matching", Proceedings of
|
|
88
|
+
# the 18th International Conference on Data Engineering (ICDE’02)
|
|
89
|
+
#
|
|
81
90
|
# Assumes that the initial similarity has already been calculated
|
|
91
|
+
# If passed an optional block, it uses that block to update the
|
|
92
|
+
# similarity on each iteration. If no block is passed, it uses the
|
|
93
|
+
# default similarity updating method from the paper.
|
|
82
94
|
def similarity_flood(opts = {})
|
|
83
95
|
max_iterations = opts[:iterations] || 100
|
|
84
96
|
max_residual = opts[:max_residual] || 0.001
|
metadata
CHANGED
|
@@ -1,7 +1,7 @@
|
|
|
1
1
|
--- !ruby/object:Gem::Specification
|
|
2
2
|
name: graph.njae
|
|
3
3
|
version: !ruby/object:Gem::Version
|
|
4
|
-
version: 0.3.
|
|
4
|
+
version: 0.3.1
|
|
5
5
|
prerelease:
|
|
6
6
|
platform: ruby
|
|
7
7
|
authors:
|
|
@@ -13,7 +13,7 @@ date: 2012-05-18 00:00:00.000000000 Z
|
|
|
13
13
|
dependencies:
|
|
14
14
|
- !ruby/object:Gem::Dependency
|
|
15
15
|
name: rspec
|
|
16
|
-
requirement: &
|
|
16
|
+
requirement: &80307360 !ruby/object:Gem::Requirement
|
|
17
17
|
none: false
|
|
18
18
|
requirements:
|
|
19
19
|
- - ~>
|
|
@@ -21,10 +21,10 @@ dependencies:
|
|
|
21
21
|
version: 2.8.0
|
|
22
22
|
type: :development
|
|
23
23
|
prerelease: false
|
|
24
|
-
version_requirements: *
|
|
24
|
+
version_requirements: *80307360
|
|
25
25
|
- !ruby/object:Gem::Dependency
|
|
26
26
|
name: bundler
|
|
27
|
-
requirement: &
|
|
27
|
+
requirement: &80323410 !ruby/object:Gem::Requirement
|
|
28
28
|
none: false
|
|
29
29
|
requirements:
|
|
30
30
|
- - ~>
|
|
@@ -32,10 +32,10 @@ dependencies:
|
|
|
32
32
|
version: 1.0.0
|
|
33
33
|
type: :development
|
|
34
34
|
prerelease: false
|
|
35
|
-
version_requirements: *
|
|
35
|
+
version_requirements: *80323410
|
|
36
36
|
- !ruby/object:Gem::Dependency
|
|
37
37
|
name: jeweler
|
|
38
|
-
requirement: &
|
|
38
|
+
requirement: &80323100 !ruby/object:Gem::Requirement
|
|
39
39
|
none: false
|
|
40
40
|
requirements:
|
|
41
41
|
- - ~>
|
|
@@ -43,7 +43,7 @@ dependencies:
|
|
|
43
43
|
version: 1.8.0
|
|
44
44
|
type: :development
|
|
45
45
|
prerelease: false
|
|
46
|
-
version_requirements: *
|
|
46
|
+
version_requirements: *80323100
|
|
47
47
|
description: A simple graph library
|
|
48
48
|
email: neil.github@njae.me.uk
|
|
49
49
|
executables: []
|
|
@@ -84,7 +84,7 @@ required_ruby_version: !ruby/object:Gem::Requirement
|
|
|
84
84
|
version: '0'
|
|
85
85
|
segments:
|
|
86
86
|
- 0
|
|
87
|
-
hash:
|
|
87
|
+
hash: -190252433
|
|
88
88
|
required_rubygems_version: !ruby/object:Gem::Requirement
|
|
89
89
|
none: false
|
|
90
90
|
requirements:
|