graphsrb 0.1.0

data/lib/graphsrb/diedge.rb

@@ -0,0 +1,6 @@
+
+class Graphsrb::DiEdge < Graphsrb::Edge
+  def ==(other)
+    (vertex1.id == other.vertex1.id) && (vertex2.id == other.vertex2.id)
+  end
+end

data/lib/graphsrb/digraph.rb

@@ -0,0 +1,93 @@
+#Directed graph
+class Graphsrb::Digraph < Graphsrb::BaseGraph
+
+  #Retrieves adjacent vertices of a vertex (takes only outgoing edeges)
+  def adjacent_vertices(vertex)
+    nodes = []
+    id = vertex.id
+    nodes = adj_table[id].nodes unless adj_table[id].nil?
+    #Convert nodes into vertices
+    nodes.map{|node| _create_vertex(node.vertex.id)}
+  end
+
+  alias neighborhood adjacent_vertices
+
+  #Checks whether the digraph has an edge
+  def has_edge?(id1, id2)
+    has_vertex?(id1) && adj_table[id1].has_node?(_create_node(id2))
+  end
+  alias edge? has_edge?
+
+  #Retrieves an edge
+  def edge(v, u)
+    id1, id2 = v.id, u.id
+    if has_vertex?(id1)
+      node = adj_table[id1].find(_create_node(id2))
+      return _create_edge(id1, id2, weight:node.weight) if node
+    end
+  end
+
+  #Updates edge weight
+  def update_weight(v, u, w)
+    id1, id2 = v.id, u.id
+    adj_table[id1].update_weight(_create_node(id2), w) if has_vertex?(id1)
+  end
+
+  #Increses edge weight by +w+
+  def increase_weight(v, u, dw)
+    id1, id2 = v.id, u.id
+    adj_table[id1].increase_weight(_create_node(id2), dw) if has_vertex?(id1)
+  end
+
+
+  #Remove an edge from the graph
+  def remove_edge(id1, id2)
+    adj_table[id1].delete(_create_node(id2)) if has_vertex?(id1)
+    true
+  end
+
+  #Retrieves outgoing edges of a vertex
+  def outgoing_edges(v)
+    #Convert nodes into edges
+    _outgoing_nodes(v.id).map{|node| _create_edge(v.id, node.vertex.id, weight:node.weight)}
+  end
+
+  #Retrieves incoming edges of a vertex
+  def incoming_edges(v)
+    #Convert nodes into edges
+    _incoming_nodes(v.id).map{|node| _create_edge(node.vertex.id, v.id, weight:node.weight)}
+  end
+
+  #Returns +out-degree+ of a vertex
+  def outdegree(v)
+    _outgoing_nodes(v.id).size
+  end
+
+  #Returns +in-degree+ of a vertex
+  def indegree(v)
+    _incoming_nodes(v.id).size
+  end
+
+  private
+
+  def _outgoing_nodes(id)
+    nodes = []
+    nodes = adj_table[id].nodes unless adj_table[id].nil?
+    nodes
+  end
+
+  def _incoming_nodes(id)
+    nodes = []
+    vertices.each do |vertex|
+      next if vertex.id == id
+      node = adj_table[vertex.id].find(_create_node(id))
+      nodes << _create_node(vertex.id, weight:node.weight) unless node.nil?
+    end
+    nodes
+  end
+
+  protected
+  def _create_edge(id1, id2, args={})
+    Graphsrb::DiEdge.new(id1, id2, args)
+  end
+end

data/lib/graphsrb/edge.rb

@@ -0,0 +1,34 @@
+
+class Graphsrb::Edge
+  attr_reader :vertex1, :vertex2, :weight
+  def initialize(id1, id2, args={})
+    if id1 == id2
+      raise Graphsrb::EdgeInitializationError, "Vertex id's must be different from each other"
+    end
+
+    @vertex1 = Graphsrb::Vertex.new(id1)
+    @vertex2 = Graphsrb::Vertex.new(id2)
+    @weight = args.fetch(:weight, 1)
+  end
+
+  alias initial_vertex vertex1
+  alias terminal_vertex vertex2
+
+  def ==(other)
+    (vertex1.id == other.vertex1.id) && (vertex2.id == other.vertex2.id) ||
+    (vertex1.id == other.vertex2.id) && (vertex2.id == other.vertex1.id)
+  end
+
+  def eql?(other)
+    self == other
+  end
+
+  def to_s
+    "(#{vertex1.id}, #{vertex2.id}, weight:#{weight})"
+  end
+
+  def to_json
+    {vertex1: vertex1.id, vertex2: vertex2.id, weight: weight}.to_json
+  end
+
+end

data/lib/graphsrb/exceptions.rb

@@ -0,0 +1,5 @@
+class Graphsrb::VertexInitializationError < StandardError
+end
+
+class Graphsrb::EdgeInitializationError < StandardError
+end

data/lib/graphsrb/graph.rb

@@ -0,0 +1,46 @@
+class Graphsrb::Graph < Graphsrb::BaseGraph
+
+  #Retrieves adjacent vertices of a vertex
+  def adjacent_vertices(vertex)
+    nodes = []
+    id = vertex.id
+    nodes = adj_table[id].nodes unless adj_table[id].nil?
+    vertices.each do |v|
+      next if v.id == id
+      node = adj_table[v.id].find(_create_node(id))
+      nodes << _create_node(v.id, weight:node.weight) unless node.nil?
+    end
+    #Convert nodes into vertices
+    nodes.map{|node| _create_vertex(node.vertex.id)}
+  end
+
+  alias neighborhood adjacent_vertices
+
+  #Retrieves incident edges of a vertex
+  def incident_edges(v)
+    #Convert nodes into edges with weights
+    _incident_nodes(v.id).map{|node| _create_edge(v.id, node.vertex.id, weight:node.weight)}
+  end
+
+  #Returns +degree+ of a vertex
+  def degree(v)
+    _incident_nodes(v.id).size
+  end
+
+  #Returns maximum degree of all graph vertices
+  def max_degree
+    self.vertices.map{|v| self.degree(v)}.max
+  end
+
+  private
+  def _incident_nodes(id)
+    nodes = []
+    nodes = adj_table[id].nodes unless adj_table[id].nil?
+    vertices.each do |vertex|
+      next if vertex.id == id
+      node = adj_table[vertex.id].find(_create_node(id))
+      nodes << _create_node(vertex.id, weight:node.weight) unless node.nil?
+    end
+    nodes
+  end
+end

data/lib/graphsrb/node.rb

@@ -0,0 +1,21 @@
+
+#This class represents a single entry in a adjacency list.
+class Graphsrb::Node
+  attr_reader :vertex, :weight
+
+  #Creates a new node
+  def initialize(vertex_id, args={})
+    @vertex = Graphsrb::Vertex.new(vertex_id)
+    @weight = args.fetch(:weight, 1)
+  end
+
+  #Updates weight
+  def update_weight(w)
+    @weight = w
+  end
+
+  #Compares two nodes. Two nodes are equal if their +vertices+ are equal.
+  def ==(node)
+    vertex == node.vertex
+  end
+end

data/lib/graphsrb/version.rb

@@ -0,0 +1,3 @@
+module Graphsrb
+  VERSION = "0.1.0"
+end

data/lib/graphsrb/vertex.rb

@@ -0,0 +1,32 @@
+
+#This class represents a graph vertex.
+class Graphsrb::Vertex
+  attr_reader :id
+
+  #Creates a vertex given its +id+, a nonnegative integer.
+  def initialize(id)
+    raise Graphsrb::VertexInitializationError, 'Vertex id may not be nil' if id.nil?
+    @id = id
+  end
+
+  #Compares two vertices. Two vertices are equal if their +id+s are equal.
+  def ==(vertex)
+    id == vertex.id
+  end
+
+  def !=(vertex)
+    id != vertex.id
+  end
+
+  def eql?(other)
+    self == other
+  end
+
+  def to_s
+    self.id.to_s
+  end
+
+  def hash
+    self.id
+  end
+end

metadata

@@ -0,0 +1,149 @@
+--- !ruby/object:Gem::Specification
+name: graphsrb
+version: !ruby/object:Gem::Version
+  version: 0.1.0
+platform: ruby
+authors:
+- Bayram Kuliyev
+autorequire: 
+bindir: exe
+cert_chain: []
+date: 2019-01-13 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: bundler
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.16'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.16'
+- !ruby/object:Gem::Dependency
+  name: rake
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '10.0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '10.0'
+- !ruby/object:Gem::Dependency
+  name: rspec
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '3.0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '3.0'
+- !ruby/object:Gem::Dependency
+  name: json
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.8'
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.8'
+description: 
+email:
+- bkuliyev@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- ".DS_Store"
+- ".gitignore"
+- ".rspec"
+- ".travis.yml"
+- CODE_OF_CONDUCT.md
+- Gemfile
+- Gemfile.lock
+- LICENSE.txt
+- README.md
+- Rakefile
+- bin/console
+- bin/setup
+- examples/ApproxAlgs/TSP/tsp.rb
+- examples/ApproxAlgs/VertexCover/main.rb
+- examples/ApproxAlgs/VertexCover/vertex_cover.rb
+- examples/Apts/artc_points.rb
+- examples/Apts/main.rb
+- examples/BackEdges/backedges.rb
+- examples/BackEdges/main.rb
+- examples/BipartMatching/bipart_matching.rb
+- examples/BipartMatching/main.rb
+- examples/EdgeConnectivity/econ.rb
+- examples/EdgeConnectivity/main.rb
+- examples/Euler/euler_tour.rb
+- examples/Euler/main.rb
+- examples/FundCircuits/fund_circuits.rb
+- examples/FundCircuits/main.rb
+- examples/FundCutsets/fund_cutsets.rb
+- examples/FundCutsets/main.rb
+- examples/MaxFlow/edmonds_karp.rb
+- examples/MaxFlow/main.rb
+- examples/PrimMST/main.rb
+- examples/PrimMST/prim.rb
+- examples/ProbAlgs/LargeCustset/large_cutset.rb
+- examples/ProbAlgs/LargeCustset/main.rb
+- graphsrb.gemspec
+- lib/graphsrb.rb
+- lib/graphsrb/adjacency_list.rb
+- lib/graphsrb/base_graph.rb
+- lib/graphsrb/diedge.rb
+- lib/graphsrb/digraph.rb
+- lib/graphsrb/edge.rb
+- lib/graphsrb/exceptions.rb
+- lib/graphsrb/graph.rb
+- lib/graphsrb/node.rb
+- lib/graphsrb/version.rb
+- lib/graphsrb/vertex.rb
+homepage: https://github.com/fade2black/graphsrb
+licenses:
+- MIT
+metadata:
+  allowed_push_host: https://rubygems.org
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubyforge_project: 
+rubygems_version: 2.7.7
+signing_key: 
+specification_version: 4
+summary: This gem allows to create simple directed and undirected graphs. Basic operations
+  allows easily implement graph algorithms
+test_files: []