graphify 0.1.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: 124c7b666e738e2ea886e0b9a804a05230daca15
+  data.tar.gz: dc91569f2e17087a22fe4f9f07417ddf839edbb0
+SHA512:
+  metadata.gz: bfe2fb70be1c39bbc93eb9984ee44a7fe11cf9f97008c4d8f969a21e2db058ee161ecfed2fa38a8991914eb60e91195dec50a8e28cc48a0172a726b8f352881d
+  data.tar.gz: 24c4f04e43a9731798781e40cbdb877df045c0a75f2290d4133922a932619ab3c3661d6a70f7735568e901774cbeb74c055893844121de4f3db76cd8443c9966

data/.gitignore

@@ -0,0 +1,9 @@
+/.bundle/
+/.yardoc
+/Gemfile.lock
+/_yardoc/
+/coverage/
+/doc/
+/pkg/
+/spec/reports/
+/tmp/

data/.rspec

@@ -0,0 +1,2 @@
+--format documentation
+--color

data/.travis.yml

@@ -0,0 +1,5 @@
+sudo: false
+language: ruby
+rvm:
+  - 2.3.1
+before_install: gem install bundler -v 1.13.6

data/CODE_OF_CONDUCT.md

@@ -0,0 +1,74 @@
+# Contributor Covenant Code of Conduct
+
+## Our Pledge
+
+In the interest of fostering an open and welcoming environment, we as
+contributors and maintainers pledge to making participation in our project and
+our community a harassment-free experience for everyone, regardless of age, body
+size, disability, ethnicity, gender identity and expression, level of experience,
+nationality, personal appearance, race, religion, or sexual identity and
+orientation.
+
+## Our Standards
+
+Examples of behavior that contributes to creating a positive environment
+include:
+
+* Using welcoming and inclusive language
+* Being respectful of differing viewpoints and experiences
+* Gracefully accepting constructive criticism
+* Focusing on what is best for the community
+* Showing empathy towards other community members
+
+Examples of unacceptable behavior by participants include:
+
+* The use of sexualized language or imagery and unwelcome sexual attention or
+advances
+* Trolling, insulting/derogatory comments, and personal or political attacks
+* Public or private harassment
+* Publishing others' private information, such as a physical or electronic
+  address, without explicit permission
+* Other conduct which could reasonably be considered inappropriate in a
+  professional setting
+
+## Our Responsibilities
+
+Project maintainers are responsible for clarifying the standards of acceptable
+behavior and are expected to take appropriate and fair corrective action in
+response to any instances of unacceptable behavior.
+
+Project maintainers have the right and responsibility to remove, edit, or
+reject comments, commits, code, wiki edits, issues, and other contributions
+that are not aligned to this Code of Conduct, or to ban temporarily or
+permanently any contributor for other behaviors that they deem inappropriate,
+threatening, offensive, or harmful.
+
+## Scope
+
+This Code of Conduct applies both within project spaces and in public spaces
+when an individual is representing the project or its community. Examples of
+representing a project or community include using an official project e-mail
+address, posting via an official social media account, or acting as an appointed
+representative at an online or offline event. Representation of a project may be
+further defined and clarified by project maintainers.
+
+## Enforcement
+
+Instances of abusive, harassing, or otherwise unacceptable behavior may be
+reported by contacting the project team at rohan_bhide@hotmail.com. All
+complaints will be reviewed and investigated and will result in a response that
+is deemed necessary and appropriate to the circumstances. The project team is
+obligated to maintain confidentiality with regard to the reporter of an incident.
+Further details of specific enforcement policies may be posted separately.
+
+Project maintainers who do not follow or enforce the Code of Conduct in good
+faith may face temporary or permanent repercussions as determined by other
+members of the project's leadership.
+
+## Attribution
+
+This Code of Conduct is adapted from the [Contributor Covenant][homepage], version 1.4,
+available at [http://contributor-covenant.org/version/1/4][version]
+
+[homepage]: http://contributor-covenant.org
+[version]: http://contributor-covenant.org/version/1/4/

data/Gemfile

@@ -0,0 +1,4 @@
+source 'https://rubygems.org'
+
+# Specify your gem's dependencies in graphify.gemspec
+gemspec

data/LICENSE.txt

@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2016 brohan
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.

data/README.md

@@ -0,0 +1,41 @@
+# Graphify
+
+Welcome to your new gem! In this directory, you'll find the files you need to be able to package up your Ruby library into a gem. Put your Ruby code in the file `lib/graphify`. To experiment with that code, run `bin/console` for an interactive prompt.
+
+TODO: Delete this and the text above, and describe your gem
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+```ruby
+gem 'graphify'
+```
+
+And then execute:
+
+    $ bundle
+
+Or install it yourself as:
+
+    $ gem install graphify
+
+## Usage
+
+TODO: Write usage instructions here
+
+## Development
+
+After checking out the repo, run `bin/setup` to install dependencies. Then, run `rake spec` to run the tests. You can also run `bin/console` for an interactive prompt that will allow you to experiment.
+
+To install this gem onto your local machine, run `bundle exec rake install`. To release a new version, update the version number in `version.rb`, and then run `bundle exec rake release`, which will create a git tag for the version, push git commits and tags, and push the `.gem` file to [rubygems.org](https://rubygems.org).
+
+## Contributing
+
+Bug reports and pull requests are welcome on GitHub at https://github.com/[USERNAME]/graphify. This project is intended to be a safe, welcoming space for collaboration, and contributors are expected to adhere to the [Contributor Covenant](http://contributor-covenant.org) code of conduct.
+
+
+## License
+
+The gem is available as open source under the terms of the [MIT License](http://opensource.org/licenses/MIT).
+

data/Rakefile

@@ -0,0 +1,6 @@
+require "bundler/gem_tasks"
+require "rspec/core/rake_task"
+
+RSpec::Core::RakeTask.new(:spec)
+
+task :default => :spec

data/bin/console

@@ -0,0 +1,18 @@
+#!/usr/bin/env ruby
+
+require "bundler/setup"
+require "graphify"
+require "./lib/graphify/graph.rb"
+require "./lib/graphify/graph_matrix.rb"
+require "./lib/graphify/graph_list.rb"
+
+# You can add fixtures and/or initialization code here to make experimenting
+# with your gem easier. You can also use a different console, if you like.
+
+
+# (If you use this, don't forget to add pry to your Gemfile!)
+# require "pry"
+# Pry.start
+
+require "irb"
+IRB.start

data/bin/setup

@@ -0,0 +1,8 @@
+#!/usr/bin/env bash
+set -euo pipefail
+IFS=$'\n\t'
+set -vx
+
+bundle install
+
+# Do any other automated setup that you need to do here

data/graphify.gemspec

@@ -0,0 +1,41 @@
+# coding: utf-8
+lib = File.expand_path('../lib', __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+require 'graphify/version'
+
+Gem::Specification.new do |spec|
+  spec.name          = "graphify"
+  spec.version       = Graphify::VERSION
+  spec.authors       = ["brohan"]
+  spec.email         = ["brohan@seas.upenn.edu"]
+
+  spec.summary       = %q{To generate random graphs and store it in your database}
+  spec.description   = %q{To generate randomized graphs}
+  spec.homepage      = "https://www.seas.upenn.edu/~cis196"
+  spec.license       = "MIT"
+
+  # Prevent pushing this gem to RubyGems.org. To allow pushes either set the 'allowed_push_host'
+  # to allow pushing to a single host or delete this section to allow pushing to any host.
+  if spec.respond_to?(:metadata)
+    spec.metadata['allowed_push_host'] = "https://rubygems.org"
+  else
+    raise "RubyGems 2.0 or newer is required to protect against " \
+      "public gem pushes."
+  end
+
+  spec.files         = `git ls-files -z`.split("\x0").reject do |f|
+    f.match(%r{^(test|spec|features)/})
+  end
+  spec.bindir        = "exe"
+  spec.executables   = spec.files.grep(%r{^exe/}) { |f| File.basename(f) }
+  spec.require_paths = ["lib"]
+
+  spec.add_development_dependency "bundler", "~> 1.13"
+  spec.add_development_dependency "rake", "~> 10.0"
+  spec.add_development_dependency "rspec", "~> 3.0"
+  spec.add_development_dependency "activerecord", "~> 4.2.4"
+  spec.add_development_dependency "sqlite3"
+  spec.add_development_dependency "ruby-graphviz"
+  spec.add_development_dependency "pry"
+  spec.add_development_dependency "simplecov"
+end

data/lib/graphify.rb

@@ -0,0 +1,54 @@
+require "graphify/version"
+
+module Graphify
+
+  def self.get_graph(name, num_vertices, num_edges, storage_type, type, weight_limit)
+    errors = check_params(name, num_vertices, num_edges, storage_type, type, weight_limit)
+    p errors if errors != {}
+    raise 'Invalid Parameters as above' if errors != {}
+    Graph.new({'name': name, 'num_vertices': num_vertices, 'num_edges': num_edges, 'storage_type': storage_type,
+              'type': type, 'weight_limit': weight_limit})
+  end
+
+  private
+
+  def self.check_params(name, num_vertices, num_edges, storage_type, type, weight_limit)
+    errors = {}
+    errors['name'] = check_name(name) unless check_name(name).nil?
+    errors['num_vertices'] = check_num_vertices(num_vertices) unless check_num_vertices(num_vertices).nil?
+    errors['type'] = check_type(type) unless check_type(type).nil?
+    errors['weight_limit'] = check_weight_limit(weight_limit) unless check_weight_limit(weight_limit).nil?
+    errors['storage_type'] = check_storage_type(storage_type) unless check_storage_type(storage_type).nil?
+    errors['num_edges'] =
+        check_num_edges(num_edges, num_vertices, type) unless check_num_edges(num_edges, num_vertices, type).nil?
+    errors
+  end
+
+  def self.check_name(name)
+    [] << 'Name cannot be empty or nil' if name == '' || name.nil?
+  end
+
+  def self.check_num_vertices(num_vertices)
+    [] << 'Number of vertices cannot be negative' if num_vertices < 0
+  end
+
+  def self.check_num_edges(num_edges, num_vertices, type)
+    errors = []
+    errors << 'Number of edges cannot be negative' if num_edges < 0
+    edge_limit = type == 'directed' ? (num_vertices) * (num_vertices - 1) : ((num_vertices) * (num_vertices - 1) / 2)
+    errors << 'The number of edges is too large' if num_edges > edge_limit
+  end
+
+  def self.check_storage_type(storage_type)
+    [] << 'Storage type is invalid' if storage_type != 'matrix' && storage_type != 'list'
+  end
+
+  def self.check_type(type)
+    [] << 'Type of graph is invalid' if type != 'directed' && type != 'undirected'
+  end
+
+  def self.check_weight_limit(weight_limit)
+    [] << 'Weight limit cannot be negative' if weight_limit < 0
+  end
+
+end

data/lib/graphify/graph.rb

@@ -0,0 +1,296 @@
+require 'ruby-graphviz'
+require_relative 'graph_matrix'
+require_relative 'graph_list'
+class Graph
+
+  def initialize(args)
+    @graph =  if args[:storage_type] == 'matrix'
+                GraphMatrix.new(args)
+              elsif args[:storage_type] == 'list'
+                GraphList.new(args)
+              end
+    @type = args[:type] == 'directed' ? :digraph : :graph
+    @name = args[:name]
+    @storage_type = args[:storage_type]
+  end
+
+  def picture
+    g = GraphViz.new(:G, type: @type)
+    vertices = add_vertices_to_picture(g)
+    add_edges_to_picture(vertices, g)
+    g.output(png: @name + '.png')
+  end
+
+  def dfs_tree(vertex)
+    g = initialize_g
+    dfs_helper(vertex, [], g)
+    g
+  end
+
+  def edges
+    @graph.edges_with_weights
+  end
+
+  def dfs_tree_picture(vertex)
+    tree = dfs_tree(vertex)
+    if @storage_type == 'matrix'
+      produce_picture_from_matrix(tree, '_dfs_tree.png')
+    elsif @storage_type == 'list'
+      produce_picture_from_list(tree, '_dfs_tree.png')
+    end
+  end
+
+  def shortest_path_tree(vertex)
+    g = initialize_g
+    distances, predecessors = initialize_djikstras(vertex)
+    djikstras_helper(vertex, [], distances, predecessors, g)
+    g
+  end
+
+  def shortest_path_tree_picture(vertex)
+    tree = shortest_path_tree(vertex)
+    if @storage_type == 'matrix'
+      produce_picture_from_matrix(tree, '_shortest_path_tree.png')
+    elsif @storage_type == 'list'
+      produce_picture_from_list(tree, '_shortest_path_tree.png')
+    end
+  end
+
+  def scc_vertex_sets
+    scc_vertex_sets_helper
+  end
+
+  def scc_edge_set
+    construct_scc_edges(scc_vertex_sets)
+  end
+
+  def scc_picture
+    g = GraphViz.new(:G, type: @type)
+    picture_vertices = add_scc_vertices(scc_vertex_sets, g)
+    add_scc_edges(picture_vertices, scc_edge_set, g)
+    g.output(png: @name + '_strongly_connected_components.png')
+  end
+
+  def topological_sort
+    scc_total_ordering
+  end
+
+  def mst_picture
+    g = GraphViz.new(:G, type: @type)
+    picture_vertices = add_vertices_to_picture(g)
+    add_mst_edges(picture_vertices, g)
+    g.output(png: @name + '_minimum_spanning_tree.png')
+  end
+
+  def mst_edges
+    kruskals_edges
+  end
+
+  # Private helper functions
+
+  private
+
+  # Initialize the edge set for DFS, Djikstra's
+
+  def initialize_g
+    num_vertices = @graph.vertices.size
+    return Array.new(num_vertices) { Array.new(num_vertices) } if @storage_type == 'matrix'
+    g = {}
+    (0..num_vertices - 1).each do |num|
+      g[num] = {}
+    end
+    g
+  end
+
+
+  # Depth First Search Functions
+
+  def dfs_helper(vertex, seen, g)
+    seen << vertex
+    @graph.get_out_edges(vertex).each do |neighbour|
+      next if seen.include?(neighbour)
+      g[vertex][neighbour] = @graph.get_edge_weight(vertex, neighbour)
+      dfs_helper(neighbour, seen, g)
+    end
+  end
+
+  # Djikstra's Algorithm and Breadth First Search Functions
+
+  def initialize_djikstras(start)
+    dist = {}
+    predecessors = {}
+    @graph.vertices.each do |vertex|
+      dist[vertex] = vertex == start ? 0 : Float::INFINITY
+      predecessors[vertex] = vertex == start ? start : nil
+    end
+    return dist, predecessors
+  end
+
+
+  def djikstras_helper(vertex, seen, current_d, predecessors, g)
+    seen << vertex
+    add_predecessor(predecessors[vertex], vertex, g)
+    @graph.get_out_edges(vertex).each do |node|
+      next if seen.include?(node) || current_d[vertex] + @graph.get_edge_weight(vertex, node) > current_d[node]
+      current_d[node] = current_d[vertex] + @graph.get_edge_weight(vertex, node)
+      predecessors[node] = vertex
+    end
+    current_d.delete(vertex)
+    return if seen.size == predecessors.keys.size
+    djikstras_helper(current_d.key(current_d.values.min), seen, current_d, predecessors, g)
+  end
+  
+  def add_predecessor(from, to, g)
+    return if to == from
+    g[from][to] = @graph.get_edge_weight(from, to)
+  end
+
+  def add_matrix_edge_to_picture(from, to, edges, vertices, picture)
+    return if edges[from][to] == nil
+    picture_edge = picture.add_edges(vertices[from], vertices[to])
+    picture_edge[label: edges[from][to].to_s]
+  end
+
+
+  # Strongly Connected Components functions
+
+
+  def scc_get_dfs_order(vertex, seen, finished)
+    seen << vertex
+    @graph.get_out_edges(vertex).each do |neighbour|
+      next if seen.include?(neighbour) || finished.include?(neighbour)
+      scc_get_dfs_order(neighbour, seen, finished)
+    end
+    finished.unshift(vertex)
+  end
+
+  def scc_transpose_dfs(vertex, seen, this_set)
+    seen << vertex unless seen.include?(vertex)
+    this_set << vertex unless this_set.include?(vertex)
+    @graph.get_in_edges(vertex).each do |neighbour|
+      scc_transpose_dfs(neighbour, seen, this_set) unless seen.include?(neighbour) || this_set.include?(neighbour)
+    end
+  end
+
+  def scc_total_ordering
+    finished = []
+    for i in (0.. @graph.vertices.size - 1)
+      scc_get_dfs_order(i, [], finished) unless finished.include?(i)
+    end
+    finished
+  end
+
+  def scc_vertex_sets_helper
+    dfs_sets, seen, counter = {}, [], 0
+    scc_total_ordering.each do |vertex|
+      next if seen.include?(vertex)
+      dfs_set = []
+      scc_transpose_dfs(vertex, seen, dfs_set)
+      dfs_sets[counter] = dfs_set
+      counter += 1
+    end
+    dfs_sets
+  end
+
+
+  def construct_scc_edges(scc_vertex_set)
+    edges = Array.new(scc_vertex_set.size) { Array.new(scc_vertex_set.size) }
+    @graph.edges_with_weights.each do |edge|
+      from = (scc_vertex_set.select { |k, value| value.include?(edge[0]) }).keys[0]
+      to = (scc_vertex_set.select { |k , value| value.include?(edge[1]) }).keys[0]
+      next if to == from || !edges[from][to].nil?
+      edges[from][to] = 1
+    end
+    edges
+  end
+
+  def add_scc_vertices(scc_vertex_set, g)
+    vertices = {}
+    scc_vertex_set.each do |key, value|
+      vertices[key] = g.add_nodes(value.reduce('') { |memo, vertex| memo + vertex.to_s + ', ' })
+    end
+    vertices
+  end
+
+  def add_scc_edges(scc_picture_vertices, scc_edge_set, g)
+    (0..scc_edge_set.size - 1).each do |from|
+      (0..scc_edge_set.size - 1).each do |to|
+        g.add_edges(scc_picture_vertices[from], scc_picture_vertices[to]) unless scc_edge_set[from][to].nil?
+      end
+    end
+  end
+
+
+
+
+  # Kruskal's and Minimum Spanning Trees
+
+  def kruskals_edges
+    num_vertices = @graph.vertices.size
+    sorted_edges = @graph.edges_with_weights.sort_by { |elem| elem[2] }
+    result = []
+    tree = []
+    sorted_edges.each do |edge|
+      break if tree.size == num_vertices
+      next if tree.include?(edge[0]) && tree.include?(edge[1])
+      tree << edge[0] unless tree.include?(edge[0])
+      tree << edge[1] unless tree.include?(edge[1])
+      result << edge
+    end
+    result
+  end
+
+  def add_mst_edges(vertices, g)
+    kruskals_edges.each do |edge|
+      picture_edge = g.add_edges(vertices[edge[0]], vertices[edge[1]])
+      picture_edge[label: edge[2].to_s]
+    end
+  end
+
+
+
+  # Functions to draw the main picture
+
+
+  def add_vertices_to_picture(g)
+    vertices = {}
+    @graph.vertices.each do |vertex|
+      vertices[vertex] = g.add_nodes(vertex.to_s)
+    end
+    vertices
+  end
+
+  def add_edges_to_picture(vertices, g)
+    @graph.edges_with_weights.each do |edge|
+      picture_edge = g.add_edges(vertices[edge[0]], vertices[edge[1]])
+      picture_edge[label: edge[2].to_s]
+    end
+  end
+
+  def produce_picture_from_matrix(edges, type_name)
+    picture = GraphViz.new(:G, type: @type)
+    vertices = add_vertices_to_picture(picture)
+    (0..vertices.size - 1).each do |from|
+      (0..vertices.size - 1).each do |to|
+        add_matrix_edge_to_picture(from, to, edges, vertices, picture)
+      end
+    end
+    picture.output(png: @name + type_name)
+  end
+
+  def produce_picture_from_list(edges, type_name)
+    picture = GraphViz.new(:G, type: @type)
+    vertices = add_vertices_to_picture(picture)
+    edges.keys.each do |key|
+      edges[key].keys.each do |s_key|
+
+        picture_edge = picture.add_edges(vertices[key], vertices[s_key])
+        picture_edge[label: edges[key][s_key].to_s]
+      end
+    end
+    picture.output(png: @name + type_name)
+  end
+
+
+  attr_accessor :graph
+end

data/lib/graphify/graph_list.rb

@@ -0,0 +1,88 @@
+class GraphList
+
+  def initialize(args)
+    @type = args[:type]
+    @weight_limit = args[:weight_limit]
+    @edge_lists = {}
+    if args.has_key?(:num_vertices)
+      (0..args[:num_vertices] - 1).each do |num|
+        @edge_lists[num] = {}
+      end
+      initialize_edges(args[:num_vertices], args[:num_edges])
+    else
+      @edge_lists = args[:edge_lists]
+    end
+  end
+
+
+  def get_out_edges(vertex)
+    @edge_lists[vertex].keys
+  end
+
+  def get_in_edges(vertex)
+    @edge_lists.reduce([]) { |memo, (key, value)| value.has_key?(vertex) ? memo << key : memo }
+  end
+
+  def get_edge_weight(to, from)
+    @edge_lists[to][from]
+  end
+
+  def vertices
+    result = []
+    (0..@edge_lists.keys.size - 1).each do |vertex|
+      result << vertex
+    end
+    result
+  end
+
+  def edges
+    result = []
+    @edge_lists.keys.each do |k|
+      @edge_lists[k].keys.each do |s_k|
+        next if @type == 'undirected' && s_k > k
+        result << [k, s_k]
+      end
+    end
+    result
+  end
+
+  def edges_with_weights
+    result = []
+    @edge_lists.keys.each do |k|
+      @edge_lists[k].keys.each do |s_k|
+        next if @type == 'undirected' && s_k > k
+        result << [k, s_k, @edge_lists[k][s_k]]
+      end
+    end
+    result
+  end
+
+  private
+
+    def initialize_edges(num_vertices, num_edges)
+      counter = 0
+      while counter < num_edges
+        forward = rand(num_vertices)
+        to = rand(num_vertices)
+        next if forward == to
+        counter = add_edge_helper(to, forward, counter)
+      end
+    end
+
+    def add_edge_helper(to, from, counter)
+      return counter if @edge_lists[from].has_key?(to)
+      @edge_lists[from][to] = generate_edge_weight
+      @edge_lists[to][from] = @edge_lists[from][to] if @type == 'undirected'
+      counter + 1
+    end
+
+  def generate_edge_weight
+    if @weight_limit == 0
+      1
+    else
+      rand(@weight_limit)
+    end
+  end
+
+  attr_accessor :edge_lists, :type, :weight_limit
+end

data/lib/graphify/graph_matrix.rb

@@ -0,0 +1,95 @@
+class GraphMatrix
+
+  def initialize(args)
+    @type = args[:type]
+    @weight_limit = args[:weight_limit]
+    if args.has_key?(:num_vertices)
+      @edges = Array.new(args[:num_vertices]) { Array.new(args[:num_vertices]) }
+      initialize_helper(args[:num_vertices], args[:num_edges])
+    else
+      @edges = args[:edge_matrix]
+    end
+  end
+
+  def get_out_edges(vertex)
+    return if (vertex < 0 || vertex >= @edges.length)
+    vertices = []
+    (0..(@edges.length - 1)).each do |index|
+      vertices << index if @edges[vertex][index] != nil
+    end
+    vertices
+  end
+
+  def get_in_edges(vertex)
+    return if (vertex < 0 || vertex >= @edges.length)
+    vertices = []
+    (0..(@edges.length - 1)).each do |index|
+      vertices << index if @edges[index][vertex] != nil
+    end
+    vertices
+  end
+
+  def get_edge_weight(from, to)
+    @edges[from][to]
+  end
+
+  def vertices
+    vertices = []
+    (0..(@edges.length - 1)).each do |index|
+      vertices << index
+    end
+    vertices
+  end
+
+  def edges
+    result = []
+    (0..(@edges.length - 1)).each do |index|
+      (0..(@edges.length - 1)).each do |s_index|
+        next if @type == 'undirected' && s_index < index
+        result << [index, s_index] if @edges[index][s_index] != nil
+      end
+    end
+    result
+  end
+
+  def edges_with_weights
+    result = []
+    (0..(@edges.length - 1)).each do |index|
+      (0..(@edges.length - 1)).each do |s_index|
+        next if @type == 'undirected' && s_index < index
+        result << [index, s_index, @edges[index][s_index]] if @edges[index][s_index] != nil
+      end
+    end
+    result
+  end
+
+  private
+
+  def initialize_helper(num_vertices, num_edges)
+    counter = 0
+    while counter < num_edges
+      from = rand(num_vertices)
+      to = rand(num_vertices)
+      next if from == to
+      counter = add_edge_helper(to, from, counter)
+    end
+  end
+
+  def add_edge_helper(to, from, counter)
+    return counter if @edges[from][to] != nil
+    @edges[from][to] = generate_edge_weight
+    @edges[to][from] = @edges[from][to] if @type == 'undirected'
+    counter + 1
+  end
+
+  def generate_edge_weight
+    if @weight_limit == 0
+      1
+    else
+      rand(@weight_limit)
+    end
+  end
+
+
+  attr_writer :edges, :type, :weight_limit
+end

data/lib/graphify/graph_matrix_db.rb

@@ -0,0 +1,41 @@
+require 'active_record'
+class GraphMatrixDb < ActiveRecord::Base
+  validates edge_matrix, presence: true
+
+  def get_out_edge_matrix(vertex)
+    return if (vertex < 0 || vertex >= @edge_matrix.length)
+    vertices = []
+    (0..(@edge_matrix.length - 1)).each do |index|
+      vertices << index if @edge_matrix[vertex][index] == 1
+    end
+    vertices
+  end
+
+  def get_in_edge_matrix(vertex)
+    return if (vertex < 0 || vertex >= @edge_matrix)
+    vertices = []
+    (0..(@edge_matrix.length - 1)).each do |index|
+      vertices << index if @edge_matrix[index][vertex] == 1
+    end
+    vertices
+  end
+  
+  def vertices
+    vertices = []
+    (0..(@edge_matrix.length - 1)).each do |index|
+      vertices << index
+    end
+    vertices
+  end
+  
+  def edges
+    result = []
+    (0..(@edge_matrix.length - 1)).each do |index|
+      (0..(@edge_matrix.length - 1)).each do |s_index|
+        result << [index, s_index] if @edge_matrix[index][s_index] == 1
+      end
+    end
+    result
+  end
+  
+end

data/lib/graphify/version.rb

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

metadata

@@ -0,0 +1,183 @@
+--- !ruby/object:Gem::Specification
+name: graphify
+version: !ruby/object:Gem::Version
+  version: 0.1.0
+platform: ruby
+authors:
+- brohan
+autorequire: 
+bindir: exe
+cert_chain: []
+date: 2016-12-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.13'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.13'
+- !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: activerecord
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: 4.2.4
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: 4.2.4
+- !ruby/object:Gem::Dependency
+  name: sqlite3
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: ruby-graphviz
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: pry
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: simplecov
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+description: To generate randomized graphs
+email:
+- brohan@seas.upenn.edu
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- ".gitignore"
+- ".rspec"
+- ".travis.yml"
+- CODE_OF_CONDUCT.md
+- Gemfile
+- LICENSE.txt
+- README.md
+- Rakefile
+- bin/console
+- bin/setup
+- graphify.gemspec
+- graphify.png
+- lib/graphify.rb
+- lib/graphify/graph.rb
+- lib/graphify/graph_list.rb
+- lib/graphify/graph_matrix.rb
+- lib/graphify/graph_matrix_db.rb
+- lib/graphify/version.rb
+- main_test.png
+- main_test_dfs_tree.png
+- main_test_shortest_path_tree.png
+- main_test_strongly_connected_components.png
+- main_test_undirected.png
+- main_test_undirected_dfs_tree.png
+- main_test_undirected_minimum_spanning_tree.png
+- main_test_undirected_shortest_path_tree.png
+homepage: https://www.seas.upenn.edu/~cis196
+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.5.1
+signing_key: 
+specification_version: 4
+summary: To generate random graphs and store it in your database
+test_files: []