networkx 0.1.0 → 0.1.1

data/lib/networkx/to_matrix.rb

@@ -0,0 +1,52 @@
+module NetworkX
+  # TODO: Reduce condition branches and method length
+  def self.to_matrix(graph, val, multigraph_weight='sum')
+    is_undirected = !graph.directed?
+    is_multigraph = graph.multigraph?
+    nodelen = graph.nodes.length
+
+    m = NMatrix.new(nodelen, val)
+    index = {}
+    inv_index = {}
+    ind = 0
+
+    graph.nodes.each do |u, _|
+      index[u] = ind
+      inv_index[ind] = u
+      ind += 1
+    end
+
+    if is_multigraph
+      graph.adj.each do |u, edge_hash|
+        edge_hash.each do |v, keys|
+          all_weights = []
+          keys.each do |_key, attrs|
+            all_weights << attrs[:weight]
+          end
+
+          edge_attr = 0
+
+          case multigraph_weight
+          when 'sum'
+            edge_attr = all_weights.inject(0, :+)
+          when 'max'
+            edge_attr = all_weights.max
+          when 'min'
+            edge_attr = all_weights.min
+          end
+
+          m[index[u], index[v]] = edge_attr
+          m[index[v], index[u]] = edge_attr || 1 if is_undirected
+        end
+      end
+    else
+      graph.adj.each do |u, edge_hash|
+        edge_hash.each do |v, attrs|
+          m[index[u], index[v]] = (attrs[:weight] || 1)
+          m[index[v], index[u]] = (attrs[:weight] || 1) if is_undirected
+        end
+      end
+    end
+    [m, inv_index]
+  end
+end

data/lib/networkx/traversals/bfs.rb

@@ -0,0 +1,58 @@
+module NetworkX
+  # TODO: Reduce method length
+
+  # Returns edges of the graph travelled in breadth first fashion
+  #
+  # @example
+  #   NetworkX.bfs_edges(graph, source)
+  #
+  # @param graph [Graph, DiGraph, MultiGraph, MultiDiGraph] a graph
+  # @param source [Object] node to start bfs from
+  def self.bfs_edges(graph, source)
+    raise KeyError, "There exists no node names #{source} in the given graph." unless graph.node?(source)
+    bfs_edges = []
+    visited = [source]
+    queue = Queue.new.push([source, graph.neighbours(source)])
+    until queue.empty?
+      parent, children = queue.pop
+      children.each_key do |child|
+        next if visited.include?(child)
+        bfs_edges << [parent, child]
+        visited << child
+        queue.push([child, graph.neighbours(child)])
+      end
+    end
+    bfs_edges
+  end
+
+  # Returns parent successor pair of the graph travelled in breadth first fashion
+  #
+  # @example
+  #   NetworkX.bfs_successors(graph, source)
+  #
+  # @param graph [Graph, DiGraph, MultiGraph, MultiDiGraph] a graph
+  # @param source [Object] node to start bfs from
+  def self.bfs_successors(graph, source)
+    bfs_edges = bfs_edges(graph, source)
+    successors = {}
+    bfs_edges.each do |u, v|
+      successors[u] = [] if successors[u].nil?
+      successors[u] << v
+    end
+    successors
+  end
+
+  # Returns predecessor child pair of the graph travelled in breadth first fashion
+  #
+  # @example
+  #   NetworkX.bfs_predecessors(graph, source)
+  #
+  # @param graph [Graph, DiGraph, MultiGraph, MultiDiGraph] a graph
+  # @param source [Object] node to start bfs from
+  def self.bfs_predecessors(graph, source)
+    bfs_edges = bfs_edges(graph, source)
+    predecessors = {}
+    bfs_edges.each { |u, v| predecessors[v] = u }
+    predecessors
+  end
+end

data/lib/networkx/traversals/dfs.rb

@@ -0,0 +1,79 @@
+module NetworkX
+  # TODO: Reduce method complexity and method length
+
+  # Returns edges of the graph travelled in depth first fashion
+  #
+  # @example
+  #   NetworkX.dfs_edges(graph, source)
+  #
+  # @param graph [Graph, DiGraph, MultiGraph, MultiDiGraph] a graph
+  # @param source [Object] node to start dfs from
+  # @param depth_limit [Integer, nil] the depth limit of dfs
+  def self.dfs_edges(graph, source, depth_limit=nil)
+    raise KeyError, "There exists no node names #{source} in the given graph." unless graph.node?(source)
+    depth_limit = graph.nodes.length if depth_limit.nil?
+    dfs_edges = []
+    visited = [source]
+    stack = [[-1, source, depth_limit, graph.neighbours(source)]]
+    until stack.empty?
+      earlier_node, parent, depth_now, children = stack.pop
+      dfs_edges << [earlier_node, parent]
+      children.each_key do |child|
+        unless visited.include?(child)
+          visited << child
+          stack.push([parent, child, depth_now - 1, graph.neighbours(child)]) if depth_now > 1
+        end
+      end
+    end
+    dfs_edges.shift
+    dfs_edges
+  end
+
+  # Returns dfs tree of the graph
+  #
+  # @example
+  #   NetworkX.dfs_tree(graph, source)
+  #
+  # @param graph [Graph, DiGraph, MultiGraph, MultiDiGraph] a graph
+  # @param source [Object] node to start dfs from
+  # @param depth_limit [Integer, nil] the depth limit of dfs
+  def self.dfs_tree(graph, source, depth_limit=nil)
+    t = NetworkX::DiGraph.new
+    t.add_node(source)
+    t.add_edges_from(dfs_edges(graph, source, depth_limit))
+    t
+  end
+
+  # Returns parent successor pair of the graph travelled in depth first fashion
+  #
+  # @example
+  #   NetworkX.dfs_successors(graph, source)
+  #
+  # @param graph [Graph, DiGraph, MultiGraph, MultiDiGraph] a graph
+  # @param source [Object] node to start dfs from
+  # @param depth_limit [Integer, nil] the depth limit of dfs
+  def self.dfs_successors(graph, source, depth_limit=nil)
+    dfs_edges = dfs_edges(graph, source, depth_limit)
+    successors = {}
+    dfs_edges.each do |u, v|
+      successors[u] = [] if successors[u].nil?
+      successors[u] << v
+    end
+    successors
+  end
+
+  # Returns predecessor child pair of the graph travelled in depth first fashion
+  #
+  # @example
+  #   NetworkX.dfs_predecessors(graph, source)
+  #
+  # @param graph [Graph, DiGraph, MultiGraph, MultiDiGraph] a graph
+  # @param source [Object] node to start dfs from
+  # @param depth_limit [Integer, nil] the depth limit of dfs
+  def self.dfs_predecessors(graph, source, depth_limit=nil)
+    dfs_edges = dfs_edges(graph, source, depth_limit)
+    predecessors = {}
+    dfs_edges.each { |u, v| predecessors[v] = u }
+    predecessors
+  end
+end

data/lib/networkx/traversals/edge_dfs.rb

@@ -0,0 +1,90 @@
+module NetworkX
+  # TODO: Reduce method complexity and method length
+
+  # Helper function for edge_dfs
+  #
+  # @param graph [Graph, DiGraph, MultiGraph, MultiDiGraph] a graph
+  # @param node [Object] a node in the graph
+  def self.out_edges(graph, node)
+    edges = []
+    visited = {}
+    case graph.class.name
+    when 'NetworkX::Graph', 'NetworkX::DiGraph'
+      graph.adj[node].each do |v, _|
+        if graph.class.name == 'NetworkX::DiGraph' || visited[[v, node]].nil?
+          visited[[node, v]] = true
+          edges << [node, v]
+        end
+      end
+    else
+      graph.adj[node].each do |v, uv_keys|
+        uv_keys.each_key do |k|
+          if graph.class.name == 'NetworkX::MultiDiGraph' || visited[[v, node, k]].nil?
+            visited[[node, v, k]] = true
+            edges << [node, v, k]
+          end
+        end
+      end
+    end
+    edges
+  end
+
+  # Helper function of edge_dfs
+  def self.edge_id(graph, edge)
+    return edge if graph.directed?
+    return Set.new([edge, (edge[0..1].reverse + edge[2])]) if graph.multigraph?
+    Set.new([edge, edge.reverse])
+  end
+
+  # TODO: Reduce method complexity and method length
+
+  # Performs edge dfs on the graph
+  # Orientation :ignore, directed edges can be
+  #                     travelled in both fashions
+  # Orientation reverse, directed edges can be travelled
+  #                      in reverse fashion
+  # Orientation :nil, the graph is not meddled with
+  #
+  # @example
+  #   NetworkX.edge_dfs(graph, source, 'ignore')
+  #
+  # @param graph [Graph, DiGraph, MultiGraph, MultiDiGraph] a graph
+  # @param source [Object] node to start dfs from
+  # @param orientation [:ignore, :reverse', nil] the orientation of edges of graph
+  def self.edge_dfs(graph, start, orientation=nil)
+    case orientation
+    when :reverse
+      graph = graph.reverse if graph.class.name == 'NetworkX::DiGraph' || graph.class.name == 'NetworkX::MultiDiGraph'
+    when :ignore
+      graph = graph.to_undirected if graph.class.name == 'NetworkX::DiGraph'
+      graph = graph.to_multigraph if graph.class.name == 'NetworkX::MultiDiGraph'
+    end
+
+    visited_edges = []
+    visited_nodes = []
+    stack = [start]
+    current_edges = {}
+
+    e = Enumerator.new do |yield_var|
+      until stack.empty?
+        current = stack.last
+        unless visited_nodes.include?(current)
+          current_edges[current] = out_edges(graph, current)
+          visited_nodes << current
+        end
+
+        edge = current_edges[current].shift
+        if edge.nil?
+          stack.pop
+        else
+          unless visited_edges.include?(edge_id(graph, edge))
+            visited_edges << edge_id(graph, edge)
+            stack << edge[1]
+            yield_var.yield edge
+          end
+        end
+      end
+    end
+    e.take(graph.number_of_edges)
+  end
+end

data/lib/networkx/version.rb

@@ -1,3 +1,3 @@
 module NetworkX
-  VERSION = '0.1.0'.freeze
+  VERSION = '0.1.1'.freeze
 end

data/networkx.gemspec

@@ -1,4 +1,4 @@
-lib = File.expand_path('../lib', __FILE__)
+lib = File.expand_path('lib', __dir__)
 $LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
 require 'networkx/version'
 
@@ -31,5 +31,8 @@ Gem::Specification.new do |spec|
   spec.add_development_dependency 'saharspec'
   spec.add_development_dependency 'simplecov'
   spec.add_development_dependency 'yard'
+  spec.add_runtime_dependency 'nmatrix'
+  spec.add_runtime_dependency 'rb_heap'
+
   spec.add_development_dependency 'guard-rspec' if RUBY_VERSION >= '2.2.5'
 end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: networkx
 version: !ruby/object:Gem::Version
-  version: 0.1.0
+  version: 0.1.1
 platform: ruby
 authors:
 - Athitya Kumar
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2017-11-14 00:00:00.000000000 Z
+date: 2019-02-12 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: bundler
@@ -164,6 +164,34 @@ dependencies:
     - - ">="
       - !ruby/object:Gem::Version
         version: '0'
+- !ruby/object:Gem::Dependency
+  name: nmatrix
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: rb_heap
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
 - !ruby/object:Gem::Dependency
   name: guard-rspec
   requirement: !ruby/object:Gem::Requirement
@@ -178,8 +206,9 @@ dependencies:
     - - ">="
       - !ruby/object:Gem::Version
         version: '0'
-description: |2
-    A Ruby implemenation of the well-known graph library called "networkx".
+description: '  A Ruby implemenation of the well-known graph library called "networkx".
+
+'
 email:
 - athityakumar@gmail.com
 executables: []
@@ -196,10 +225,47 @@ files:
 - CONTRIBUTING.md
 - Gemfile
 - Guardfile
+- ISSUE_TEMPLATE.md
 - LICENSE.md
+- PULL_REQUEST_TEMPLATE.md
 - README.md
+- RELEASE_POLICY.md
 - Rakefile
 - lib/networkx.rb
+- lib/networkx/auxillary_functions/cliques.rb
+- lib/networkx/auxillary_functions/cycles.rb
+- lib/networkx/auxillary_functions/dag.rb
+- lib/networkx/auxillary_functions/eccentricity.rb
+- lib/networkx/auxillary_functions/mis.rb
+- lib/networkx/auxillary_functions/mst.rb
+- lib/networkx/auxillary_functions/union_find.rb
+- lib/networkx/auxillary_functions/vitality.rb
+- lib/networkx/auxillary_functions/wiener.rb
+- lib/networkx/converters/to_csv.rb
+- lib/networkx/converters/to_json.rb
+- lib/networkx/digraph.rb
+- lib/networkx/flow/capacityscaling.rb
+- lib/networkx/flow/edmondskarp.rb
+- lib/networkx/flow/preflowpush.rb
+- lib/networkx/flow/shortestaugmentingpath.rb
+- lib/networkx/flow/utils.rb
+- lib/networkx/graph.rb
+- lib/networkx/link_analysis/hits.rb
+- lib/networkx/link_analysis/pagerank.rb
+- lib/networkx/multidigraph.rb
+- lib/networkx/multigraph.rb
+- lib/networkx/operators/all.rb
+- lib/networkx/operators/binary.rb
+- lib/networkx/operators/product.rb
+- lib/networkx/operators/unary.rb
+- lib/networkx/shortest_path/astar.rb
+- lib/networkx/shortest_path/dense.rb
+- lib/networkx/shortest_path/unweighted.rb
+- lib/networkx/shortest_path/weighted.rb
+- lib/networkx/to_matrix.rb
+- lib/networkx/traversals/bfs.rb
+- lib/networkx/traversals/dfs.rb
+- lib/networkx/traversals/edge_dfs.rb
 - lib/networkx/version.rb
 - networkx.gemspec
 homepage: https://github.com/athityakumar/networkx.rb