mementus 0.5.13 → 0.6.0

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 370fd832daecae6063fc22be3eb5cab1ca2708cb
-  data.tar.gz: 783911cfac6d8d59f3393ff9376957b15610b6e7
+  metadata.gz: c8d7aae1069c6ccb20e101540608915d4c0b157b
+  data.tar.gz: 2b8273eb17e130395902b111c6d2714fd76ee444
 SHA512:
-  metadata.gz: 62ea1f77ad1e71f6b441ff86ac928deccf75a46128dc1fe4090db668d51218c759f1c683a796baa4f85d9f50edc723187600e5bf6f1ebeba6f966a423ee5584b
-  data.tar.gz: be965f81ebe52be72f30a7055518cca83f60d5f51f70ca04f54f966508fcc9f1e18b8e45426164f54ab75d218a18783293aa3c8a96bc93a3833eb4dd059aa37f
+  metadata.gz: e3080d4ed7e24a87065cf575e3df8675d30053f2afc5313f9f321a9a8b4677a04563e810d4168b4b461e8057a6a831d26c622c5983f9ca21fc747768abc61249
+  data.tar.gz: 39cd8b39a4dac486d3c24d9ccc9e0b53665c5406341d89695e82fc87c364c09b431097b8414e582196026c68222e13e02369a34dbc17a48bcc8f4d136f7181a9

data/README.md

@@ -2,19 +2,6 @@
 
 [![Build Status](https://travis-ci.org/maetl/mementus.svg?branch=master)](https://travis-ci.org/maetl/mementus)
 
-## Roadmap
-
-| Version | Summary                                                      |
-|---------|--------------------------------------------------------------|
-| `0.5`   | ~~Support fiber based lazily evaluated pipeline traversals~~ |
-| `0.6`   | Modular graph processing API and query style                 |
-| `0.7`   | Implement basic filter, side effect and transform pipes      |
-| `0.8`   | API support for Dijkstra/A* traversals using edge props      |
-| `0.9`   | Pluggable graph structure representations                    |
-| `0.10`  | API support for tsort and strongly connected components      |
-| `0.11`  | Expand graph library with interesting sample data            |
-| `0.12`  | Import/export via JSON and XML formats                       |
-
 ## License
 
 Provided under the terms of the MIT License. See the `LICENSE` file in the root of this project for more information.

data/lib/mementus/graph.rb

@@ -1,5 +1,3 @@
-require 'set'
-
 module Mementus
   class Graph
     def initialize(is_directed=true, &block)

data/lib/mementus/node_proxy.rb

@@ -41,9 +41,12 @@ module Mementus
       @graph.incoming(@node.id, match)
     end
 
-    # TODO: Fix
     def outgoing_edges(match=nil)
       @graph.outgoing_edges(@node.id, match)
     end
+
+    def incoming_edges(match=nil)
+      @graph.incoming_edges(@node.id, match)
+    end
   end
 end

data/lib/mementus/structure/adjacency_list.rb

@@ -1,3 +1,5 @@
+require 'set'
+
 module Mementus
   module Structure
     class AdjacencyList

data/lib/mementus/structure/incidence_list.rb

@@ -163,6 +163,46 @@ module Mementus
       def incoming_edges(id, match=nil)
         incident_edges(id, match, :in)
       end
+
+      def remove_node(node)
+        if node.is_a?(Mementus::Node) || node.is_a?(Mementus::NodeProxy)
+          node_id = node.id
+        else
+          node_id = node
+        end
+
+        @outgoing_e[node_id].each do |edge_id|
+          @incoming[@edges[edge_id].to.id].delete(node_id)
+          @incoming_e[@edges[edge_id].to.id].delete(edge_id)
+          @edges.delete(edge_id)
+        end
+
+        @incoming_e[node_id].each do |edge_id|
+          @outgoing[@edges[edge_id].from.id].delete(node_id)
+          @outgoing_e[@edges[edge_id].from.id].delete(edge_id)
+          @edges.delete(edge_id)
+        end
+
+        @nodes.delete(node_id)
+      end
+
+      def remove_edge(edge)
+        if edge.is_a?(Mementus::Edge) || edge.is_a?(Mementus::EdgeProxy)
+          edge_id = edge.id
+        else
+          edge_id = edge
+        end
+
+        edge = @edges[edge_id]
+
+        @outgoing[edge.from.id].delete(edge.to.id)
+        @incoming[edge.to.id].delete(edge.from.id)
+
+        @outgoing_e[edge.from.id].delete(edge_id)
+        @incoming_e[edge.to.id].delete(edge_id)
+
+        @edges.delete(edge_id)
+      end
     end
   end
 end

data/lib/mementus/version.rb

@@ -1,3 +1,3 @@
 module Mementus
-  VERSION = '0.5.13'.freeze
+  VERSION = '0.6.0'.freeze
 end

data/spec/structure/incidence_list_spec.rb

@@ -1,6 +1,7 @@
 require_relative 'indexed_graph_example'
 require_relative 'directed_graph_example'
 require_relative 'property_graph_example'
+require_relative 'mutable_graph_example'
 
 describe Mementus::Structure::IncidenceList do
   let(:structure) do
@@ -10,4 +11,5 @@ describe Mementus::Structure::IncidenceList do
   it_behaves_like 'an indexed graph data structure'
   it_behaves_like 'a directed graph data structure'
   it_behaves_like 'a property graph data structure'
+  it_behaves_like 'a mutable graph data structure'
 end

data/spec/structure/mutable_graph_example.rb

@@ -0,0 +1,60 @@
+shared_examples_for 'a mutable graph data structure' do
+  before do
+    structure.set_node(Mementus::Node.new(id: 1))
+    structure.set_node(Mementus::Node.new(id: 2))
+    structure.set_node(Mementus::Node.new(id: 3))
+
+    structure.set_edge(Mementus::Edge.new(id: 10, from: 1, to: 2))
+    structure.set_edge(Mementus::Edge.new(id: 20, from: 2, to: 3))
+    structure.set_edge(Mementus::Edge.new(id: 30, from: 1, to: 3))
+  end
+
+  describe '#remove_node' do
+    it 'removes all references to a given node' do
+      structure.remove_node(Mementus::Node.new(id: 2))
+
+      expect(structure.nodes.count).to eq(2)
+      expect(structure.edges.count).to eq(1)
+      expect(structure.node(1).outgoing.count).to eq(1)
+      expect(structure.node(3).incoming.count).to eq(1)
+      expect(structure.node(1).outgoing_edges.count).to eq(1)
+      expect(structure.node(3).incoming_edges.count).to eq(1)
+    end
+
+    it 'removes all references to a given node id' do
+      structure.remove_node(2)
+
+      expect(structure.nodes.count).to eq(2)
+      expect(structure.edges.count).to eq(1)
+      expect(structure.node(1).outgoing.count).to eq(1)
+      expect(structure.node(3).incoming.count).to eq(1)
+      expect(structure.node(1).outgoing_edges.count).to eq(1)
+      expect(structure.node(3).incoming_edges.count).to eq(1)
+    end
+  end
+
+  describe '#remove_edge' do
+    it 'removes all references to a given edge' do
+      edge = Mementus::Edge.new(id: 10, from: 1, to: 2)
+      structure.remove_edge(edge)
+
+      expect(structure.nodes.count).to eq(3)
+      expect(structure.edges.count).to eq(2)
+      expect(structure.node(1).outgoing.count).to eq(1)
+      expect(structure.node(2).incoming.count).to eq(0)
+      expect(structure.node(1).outgoing_edges.count).to eq(1)
+      expect(structure.node(2).incoming_edges.count).to eq(0)
+    end
+
+    it 'removes all references to a given edge id' do
+      structure.remove_edge(10)
+
+      expect(structure.nodes.count).to eq(3)
+      expect(structure.edges.count).to eq(2)
+      expect(structure.node(1).outgoing.count).to eq(1)
+      expect(structure.node(2).incoming.count).to eq(0)
+      expect(structure.node(1).outgoing_edges.count).to eq(1)
+      expect(structure.node(2).incoming_edges.count).to eq(0)
+    end
+  end
+end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: mementus
 version: !ruby/object:Gem::Version
-  version: 0.5.13
+  version: 0.6.0
 platform: ruby
 authors:
 - maetl
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2017-06-01 00:00:00.000000000 Z
+date: 2017-06-12 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: bundler
@@ -111,6 +111,7 @@ files:
 - spec/structure/directed_graph_example.rb
 - spec/structure/incidence_list_spec.rb
 - spec/structure/indexed_graph_example.rb
+- spec/structure/mutable_graph_example.rb
 - spec/structure/property_graph_example.rb
 - spec/traversal_spec.rb
 homepage: https://github.com/maetl/mementus
@@ -154,6 +155,7 @@ test_files:
 - spec/structure/directed_graph_example.rb
 - spec/structure/incidence_list_spec.rb
 - spec/structure/indexed_graph_example.rb
+- spec/structure/mutable_graph_example.rb
 - spec/structure/property_graph_example.rb
 - spec/traversal_spec.rb
 has_rdoc: