louvian_ruby 0.0.3 → 0.0.4

data/lib/louvian/graph.rb

@@ -0,0 +1,159 @@
+class Louvian::Graph
+
+  attr_accessor :adj_list, :nodes, :communities, :directed, :n2c, :total_weight
+  def initialize edges_list, directed, level
+    # Adjacency list
+    @adj_list = Louvian::Graph.make_adj edges_list, directed
+
+    # List of all nodes
+    # TODO remove sort
+    @nodes = @adj_list.keys.sort
+
+    # List of all communities (meta_nodes)
+    @communities = []
+
+    # whether the graph is diercted or not
+    @directed = false
+
+    # node_id => community_id
+    @n2c = {}
+
+    @level = level
+    # TODO remove sort
+    @adj_list.sort.each do |k, v|
+      @communities << Louvian::Community.new({k => v}, @level)
+      @n2c[k] = @communities.last.id
+    end
+
+    # Sum of all links half edges (double the number of edges)
+    @total_weight = @adj_list.inject(0) {|r,(k,v)| r+v.count}
+  end
+
+  # This method builds the adjacency list from list of edges
+  # @param list [Array] in the form of [src dest] (edge per cell)
+  # @param directed, whether the edge list is directed or not
+  def self.make_adj edges_list, directed
+    adj = {}
+    edges_list.each do |edge|
+      adj[edge[0]] ||= []
+      adj[edge[1]] ||= []
+
+      adj[edge[0]] << edge[1]
+      if not directed
+        adj[edge[1]] << edge[0]
+      end
+    end
+    adj
+  end
+
+  def get_neighbour_nodes node
+    neighbours = adj_list[node]
+  end
+
+  def get_neighbour_comms node
+    node_to_comms_links = get_node_to_comms_links node
+
+    neighbour_communities = @communities.find_all {|comm| node_to_comms_links.include? comm.id}
+  end
+
+  def get_community node
+    @communities.find {|comm| comm.id == @n2c[node]}
+  end
+
+  # This method gets all neighbour communities and the number of links from node
+  # to all neighbou communities
+  # @param node to be considered
+  # @return node_to_comms_links [Hash] {community => number_of_links from node
+  # to community}
+  def get_node_to_comms_links node
+    neighbour_nodes = get_neighbour_nodes node
+    node_to_comms_links = {}
+    neighbour_nodes.each do |n|
+      node_to_comms_links[@n2c[n]] = (node_to_comms_links[@n2c[n]] || 0) + 1
+    end
+    node_to_comms_links[@n2c[node]] ||= 0
+    return node_to_comms_links
+  end
+
+  # OPTIMIZE
+  def get_number_of_links from_node, to_comm
+    get_node_to_comms_links(from_node)[to_comm.id]
+  end
+
+  # This method calcualtes the current modularity of the communities
+  # @returns q [Float] which is the modularity
+  def modularity
+    q = 0.0
+    m2 = @total_weight
+
+    @communities.each do |m_node|
+      q += m_node.in.to_f/m2 - (m_node.tot.to_f/m2 * m_node.tot.to_f/m2)
+    end
+    q
+  end
+
+  # This method calcualtes the modularity gain for moving +node+ to community
+  # @param node this is the node to be moved
+  # @param community this is the destination community
+  # @param nb_links_to_comm is the number of links from +node+ to community
+  # @returns delta_q (the gain of modularity)
+  def modularity_gain node, community
+    nb_links_to_comm = get_number_of_links node, community
+    tot = community.tot
+    deg = @adj_list[node].count
+    m2 = @total_weight
+
+    #puts "\t\t\tcomm #{community.id} #{[tot, deg, m2, nb_links_to_comm]}"
+    # what makes sense
+    #return (nb_links_to_comm.to_f/m2) - (tot * deg.to_f/m2**2/2)
+
+    # copied from the cpp code
+    return nb_links_to_comm.to_f - tot*deg.to_f/m2
+  end
+
+  # This method outputs information about communities
+  def display_communities
+    @communities.each do |m|
+      puts "#{m.id} => #{m.nodes_ids} in=#{m.in} tot=#{m.tot}"
+    end
+    nil
+  end
+
+  def insert_node node, comm
+    comm.insert node, @adj_list[node]
+    @n2c[node] = comm.id
+  end
+
+  def remove_node node, comm
+    comm.remove node, @adj_list[node]
+    @n2c[node] = -1
+  end
+
+  def garbage_collect community
+    if  community.nodes_ids.empty?
+      @communities.delete community
+    end
+  end
+
+  def build_graph_from_comms
+
+    comm_edges = []
+
+    count = @communities.count
+    if not directed # iterate only on one half of communities
+      count % 2 == 0 ?  count : count + 1
+      count /=2
+    end
+
+    @communities[0,count].each do |comm|
+      comm.nodes_ids.each do |node|
+        @adj_list[node].each do |linked_node|
+          if not comm.nodes_ids.include? linked_node
+            comm_edges << [comm.id, @n2c[linked_node]]
+          end
+        end
+      end
+    end
+    return Louvian::Graph.new comm_edges, directed, @level+1
+  end
+end

data/lib/louvian.rb

@@ -25,7 +25,7 @@ module Louvian
   def self.run
     l = 0
     mod = @@graph.modularity
-    begin 
+    begin
       puts "Level #{l}: Comms #{@@graph.communities.size}"
       @@levels << @@graph
       @@graph = @@graph.build_graph_from_comms

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: louvian_ruby
 version: !ruby/object:Gem::Version
-  version: 0.0.3
+  version: 0.0.4
   prerelease: 
 platform: ruby
 authors:
@@ -19,6 +19,7 @@ extra_rdoc_files: []
 files:
 - lib/louvian.rb
 - lib/louvian/community.rb
+- lib/louvian/graph.rb
 homepage: http://rubygems.org/gems/louvian_ruby
 licenses: []
 post_install_message: