graphs 0.1.3-x86-linux → 0.1.4-x86-linux

data/lib/graph.rb

@@ -3,80 +3,47 @@
 require 'yaml'
 
 # A graph with nodes and edges
+# @!attribute [rw] nodes
+#   @return [NodeArray] array of current Graph's nodes
+# @!attribute [rw] edges
+#   @return [EdgeArray] array of current Graph's edges
+# @!attribute [rw] attrs
+#   @return [Hash] attributes of the current Graph (e.g. author, description, …)
 class Graph
 
-    # Return a new Graph which is the intersection of every given graphs.
+    # Return a new Graph which is the intersection of every given graph.
     # Each node of the intersection is in every given graph (idem for edges).
     # The last argument may be a hash of options.
     # @option options [Boolean] :same_fields use only fields which are in every
-    # graph to perform the intersection
+    # graph to compare nodes/edges to perform the intersection
     # @see Graph#&
+    # @see Graph::union
+    # @see Graph::xor
     def Graph::intersection(*graphs)
-        return nil if graphs.length == 0
-
-        opts = {}
-
-        if graphs[-1].is_a?(Hash)
-            return nil if graphs.length == 1
-            opts.update(graphs.pop)
-        end
-
-        graphs.each {|g|
-            if (!g.is_a?(Graph))
-                return nil
-            end
-        }
-
-        if opts[:same_fields]
-            graphs.map! {|g| g.clone}
-
-            # every first node of every graphs
-            nodes_ref = graphs.map {|g| g.nodes[0] || {}}
-            # every first edge of every graphs
-            edges_ref = graphs.map {|g| g.edges[0] || {}}
-
-            nodes_keys_ref = nodes_ref.map {|n| n.keys}
-            edges_keys_ref = edges_ref.map {|e| e.keys}
-
-            # keep only same keys
-            nodes_keys_uniq = nodes_keys_ref.inject {|i,e| i &= e}
-            edges_keys_uniq = edges_keys_ref.inject {|i,e| i &= e}
-
-            graphs.map! {|g|
-                g.nodes.map! { |n|
-                    
-                    newnode = {}
-
-                    n.each_key { |k|
-                        newnode[k] = n[k] if nodes_keys_uniq.include?(k)
-                    }
-
-                    newnode
-                }
-                g.edges.map! { |n|
-                    
-                    newedge = {}
-
-                    n.each_key { |k|
-                        newedge[k] = n[k] if edges_keys_uniq.include?(k)
-                    }
-
-                    newedge
-                }
-                g
-            }
-
-        elsif graphs.length == 2
-            return graphs[0] & graphs[1]
-        end 
-
-        graph = graphs.shift.clone
+         perform_graphs_group_op(*graphs, &:&)
+    end
 
-        graphs.each { |g|
-            graph &= g
-        }
+    # Return a new Graph which is the union of every given graph.
+    # Each node of the union is in one or more given graph(s) (idem for edges).
+    # The last argument may be a hash of options.
+    # @option options [Boolean] :same_fields use only fields which are in every
+    # graph to compare nodes/edges to perform the union
+    # @see Graph#|
+    # @see Graph::intersection
+    # @see Graph::xor
+    def Graph::union(*graphs)
+        perform_graphs_group_op(*graphs, &:|)
+    end
 
-        return graph
+    # Perform a XOR operation on all given graphs, and returns the result.
+    # The last argument may be a hash of options.
+    # @option options [Boolean] :same_fields use only fields which are in every
+    # graph to compare nodes/edges to perform the XOR operation
+    # @see Graph#^
+    # @see Graph::union
+    # @see Graph::intersection
+    def Graph::xor(*graphs)
+        perform_graphs_group_op(*graphs, &:^)
     end
 
     # An array of nodes, each node is an hash of label/value paires
@@ -96,6 +63,8 @@ class Graph
             self.map! { |e| e.update(@defaults) }
         end
 
+        # Add the given node at the end of the list
+        # @param o [Node]
         def push(o)
             if (!o.is_a?(Hash))
                 raise TypeError.new "#{o.inspect} is not an Hash!"
@@ -110,13 +79,14 @@ class Graph
     class EdgeArray < NodeArray
     end
 
-    attr_accessor :nodes, :edges
+    attr_accessor :nodes, :edges, :attrs
 
     # @param nodes [Array] Nodes of the graph
     # @param edges [Array] Edges of the graph
     def initialize(nodes=nil, edges=nil)
         @nodes = NodeArray.new(nodes || [])
         @edges = EdgeArray.new(edges || [])
+        @attrs = {}
     end
 
     # Test if current graph has same nodes and edges as the other
@@ -126,13 +96,15 @@ class Graph
         if (!other.is_a?(Graph))
             return false
         end
-        (self.nodes === other.nodes) && (self.edges == other.edges)
+        (self.nodes === other.nodes) && (self.edges === other.edges)
     end
 
     # Perform an intersection between the current graph and the other.
     # Returns a new Graph which nodes are both in the current graph and
     # the other (idem for edges).
     # @param other [Graph]
+    # @see Graph#^
+    # @see Graph::intersection
     def &(other)
         if (!other.is_a?(Graph))
             return nil
@@ -144,7 +116,70 @@ class Graph
         Graph.new(nodes, edges)
     end
 
-    # Clone the current graph. All nodes and edges are also cloned.
+    # Perform a XOR operation between the current graph and the other. Returns a
+    # new Graph which nodes are in the current graph or in the other, but not in
+    # both (idem for edges).
+    # @param other [Graph]
+    # @see Graph#&
+    def ^(other)
+        if (!other.is_a?(Graph))
+            return nil
+        end
+
+        nodes = (@nodes + other.nodes) - (@nodes & other.nodes)
+        edges = (@edges + other.edges) - (@edges & other.edges)
+
+        Graph.new(nodes, edges)
+    end
+
+    # Add two graphs, keeping duplicate nodes and edges
+    # @param other [Graph]
+    def +(other)
+        if (!other.is_a?(Graph))
+            return nil
+        end
+
+        nodes = @nodes + other.nodes
+        edges = @edges + other.edges
+
+        Graph.new(nodes, edges)
+    end
+
+    # Perform an OR operation on the current Graph and the given one. Returns a
+    # new graph which every node is in the current Graph and/or the other
+    # (idem for edges).
+    def |(other)
+        if (!other.is_a?(Graph))
+            return nil
+        end
+            
+        nodes = @nodes | other.nodes
+        edges = @edges | other.edges
+
+        Graph.new(nodes, edges)
+    end
+
+    # Returns a new Graph, which is a copy of the current graph without nodes
+    # and edges which are in the given Graph.
+    # @param other [Graph]
+    def -(other)
+        if (!other.is_a?(Graph))
+            return nil
+        end
+
+        nodes = @nodes - other.nodes
+        edges = @edges - other.edges
+
+        Graph.new(nodes, edges)
+    end
+
+    # @see Graph#-
+    def not(other)
+        self - other
+    end
+
+    # Clone the current graph. All nodes and edges are also cloned. A new Graph
+    # is returned.
     def clone()
         g = Graph.new
         g.nodes = self.nodes.clone
@@ -184,4 +219,76 @@ class Graph
         end
 
     end
+
+    # return the provided set of graphs, from which every node/edge label which
+    # is not in all graphs has been removed. So every returned graph has same
+    # node/edge labels than each other
+    def Graph::keep_only_same_fields(*graphs)
+            graphs.map! {|g| g.clone}
+
+            # every first node of every graphs
+            nodes_ref = graphs.map {|g| g.nodes[0] || {}}
+            # every first edge of every graphs
+            edges_ref = graphs.map {|g| g.edges[0] || {}}
+
+            nodes_keys_ref = nodes_ref.map {|n| n.keys}
+            edges_keys_ref = edges_ref.map {|e| e.keys}
+
+            # keep only same keys
+            nodes_keys_uniq = nodes_keys_ref.inject {|i,e| i &= e}
+            edges_keys_uniq = edges_keys_ref.inject {|i,e| i &= e}
+
+            graphs.map {|g|
+                g.nodes.map! { |n|
+                    
+                    newnode = {}
+
+                    n.each_key { |k|
+                        newnode[k] = n[k] if nodes_keys_uniq.include?(k)
+                    }
+
+                    newnode
+                }
+                g.edges.map! { |n|
+                    
+                    newedge = {}
+
+                    n.each_key { |k|
+                        newedge[k] = n[k] if edges_keys_uniq.include?(k)
+                    }
+
+                    newedge
+                }
+                g
+            }
+    end
+
+    # Perform an operation on a graphs group
+    # @param block [Block] operation
+    def Graph::perform_graphs_group_op(*graphs, &block)
+        return nil if graphs.length == 0
+
+        # options
+        opts = {}
+
+        # if the last arg is an hash, use it as a set of options and remove it
+        # from the arguments
+        if graphs[-1].is_a?(Hash)
+            return nil if graphs.length == 1
+            opts.update(graphs.pop)
+        end
+
+        # return nil if one argument is not a graph
+        graphs.each {|g|
+                return nil if (!g.is_a?(Graph))
+        }
+
+        # if :same_fields option is set, call `keep_only_same_fields` function
+        *graphs = keep_only_same_fields(*graphs) if opts[:same_fields]
+
+        # perform an and operation on all graph list
+        graphs.inject(&block)
+    end
+
+    private_class_method :keep_only_same_fields, :perform_graphs_group_op
 end

data/tests/tests_graph.rb

@@ -7,32 +7,49 @@ require 'graph'
 
 class Graph_test < Test::Unit::TestCase
 
-    @@sample_graph = Graph.new(
-        [
-            {'label'=>'foo', 'id'=>2},
-            {'label'=>'bar', 'id'=>1},
-            {'label'=>'chuck', 'id'=>3}
-        ],
-        [
-            {'node1'=>'foo', 'node2'=>'bar'},
-            {'node1'=>'bar', 'node2'=>'foo'},
-            {'node1'=>'bar', 'node2'=>'chuck'},
-            {'node1'=>'foo', 'node2'=>'chuck'}
-        ]
-    )
-
-    @@sample_graph_1 = Graph.new(
-        [
-            {'label'=>'bar', 'num'=>3},
-            {'label'=>'foo', 'num'=>42},
-            {'label'=>'chuck', 'num'=>78}
-        ],
-        [
-            {'node1'=>'foo', 'node2'=>'bar', 'time'=>1.0},
-            {'node1'=>'bar', 'node2'=>'foo', 'time'=>2.5},
-            {'node1'=>'foo', 'node2'=>'chuck', 'time'=>3.1}
-        ]
-    )
+    def setup
+        @@sample_graph = Graph.new(
+            [
+                {'label'=>'foo', 'id'=>2},
+                {'label'=>'bar', 'id'=>1},
+                {'label'=>'chuck', 'id'=>3}
+            ],
+            [
+                {'node1'=>'foo', 'node2'=>'bar'},
+                {'node1'=>'bar', 'node2'=>'foo'},
+                {'node1'=>'bar', 'node2'=>'chuck'},
+                {'node1'=>'foo', 'node2'=>'chuck'}
+            ]
+        )
+
+        @@sample_graph_1 = Graph.new(
+            [
+                {'label'=>'bar', 'num'=>3},
+                {'label'=>'foo', 'num'=>42},
+                {'label'=>'chuck', 'num'=>78}
+            ],
+            [
+                {'node1'=>'foo', 'node2'=>'bar', 'time'=>1.0},
+                {'node1'=>'bar', 'node2'=>'foo', 'time'=>2.5},
+                {'node1'=>'foo', 'node2'=>'chuck', 'time'=>3.1}
+            ]
+        )
+
+        @@empty = Graph.new
+    end
+
+    # == Graph#attrs == #
+
+    def test_graph_attrs
+        g = @@empty
+        assert_equal({}, g.attrs)
+
+        g.attrs['mode'] = 'static'
+        g.attrs['defaultedgetype'] = 'directed'
+
+        assert_equal('static', g.attrs['mode'])
+        assert_equal('directed', g.attrs['defaultedgetype'])
+    end
 
     # == Graph::intersection == #
 
@@ -42,14 +59,14 @@ class Graph_test < Test::Unit::TestCase
     end
 
     def test_intersection_2_empty_graphs
-        g = Graph.new
+        g = @@empty
         h = g.clone
 
         assert_equal(h, Graph::intersection(g, g))
     end
 
     def test_intersection_4_empty_graphs_intersection
-        g = Graph.new
+        g = @@empty
         h = g.clone
 
         assert_equal(h, Graph::intersection(g, g, g, g))
@@ -57,10 +74,8 @@ class Graph_test < Test::Unit::TestCase
 
     def test_intersection_one_node_graph_and_empty_graph
         g = Graph.new([{'label'=>'foo'}])
-        empty = Graph.new
-        empty2 = empty.clone
 
-        assert_equal(empty2, Graph::intersection(g, empty))
+        assert_equal(@@empty, Graph::intersection(g, @@empty))
     end
 
     def test_intersection_sample_graph_and_itself_5_times
@@ -72,18 +87,15 @@ class Graph_test < Test::Unit::TestCase
 
     def test_intersection_sample_graph_and_itself_5_times_and_empty_graph
         g = @@sample_graph
-        empty = Graph.new
-        empty2 = empty.clone
 
-        assert_equal(empty2, Graph::intersection(g, g, empty, g, g, g))
+        assert_equal(@@empty, Graph::intersection(g, g, @@empty, g, g, g))
     end
 
     def test_intersection_one_node_graph_and_one_other_node_graph
         g = Graph.new([{'label'=>'foo'}])
         h = Graph.new([{'label'=>'bar'}])
-        empty = Graph.new
-
-        assert_equal(empty, Graph::intersection(g, h))
+        
+        assert_equal(@@empty, Graph::intersection(g, h))
     end
 
     def test_intersection_sample_graph_and_no_graph
@@ -99,9 +111,8 @@ class Graph_test < Test::Unit::TestCase
     def test_intersection_2_graphs_same_nodes_different_fields
         g1 = @@sample_graph.clone
         g2 = @@sample_graph_1.clone
-        empty = Graph.new
-
-        assert_equal(empty, Graph::intersection(g1, g2))
+        
+        assert_equal(@@empty, Graph::intersection(g1, g2))
         # test for side effects
         assert_equal(@@sample_graph, g1)
         assert_equal(@@sample_graph_1, g2)
@@ -130,11 +141,10 @@ class Graph_test < Test::Unit::TestCase
         assert_equal(@@sample_graph_1, g2)
     end
 
-
     # == Graph#new == #
 
     def test_new_empty_graph
-        g = Graph.new
+        g = @@empty
 
         assert_equal([], g.nodes)
         assert_equal([], g.edges)
@@ -143,7 +153,7 @@ class Graph_test < Test::Unit::TestCase
     # == Graph#clone == #
 
     def test_empty_graph_clone
-        g = Graph.new
+        g = @@empty
         h = g.clone
 
         assert_equal(g, h)
@@ -209,9 +219,8 @@ class Graph_test < Test::Unit::TestCase
     end
 
     def test_edgearray_set_default_existing_property
-        g = Graph.new([],
-                           [{'node1'=>'foo', 'node2'=>'bar', 'directed'=>true},
-                            {'node1'=>'bar', 'node2'=>'foo'}])
+        g = Graph.new([], [{'node1'=>'foo', 'node2'=>'bar', 'directed'=>true},
+                           {'node1'=>'bar', 'node2'=>'foo'}])
         g.edges.set_default 'directed' => false
 
         assert_equal(false, g.edges[0]['directed'])
@@ -238,25 +247,22 @@ class Graph_test < Test::Unit::TestCase
 
     # == Graph#& == #
 
-    def test_empty_graph_AND_empty_graph
-        g1 = Graph.new
-        g2 = Graph.new
+    def test_AND_2_empty_graphs
+        g1 = g2 = @@empty
 
         assert_equal(g1, g1 & g2)
     end
 
     def test_one_node_graph_AND_empty_graph
         g = Graph.new([{'label'=>'foo'}])
-        empty = Graph.new
-
-        assert_equal(empty, g & empty)
+        
+        assert_equal(@@empty, g & @@empty)
     end
 
     def test_empty_graph_AND_one_node_graph
         g = Graph.new([{'label'=>'foo'}])
-        empty = Graph.new
-
-        assert_equal(empty, empty & g)
+        
+        assert_equal(@@empty, @@empty & g)
     end
 
     def test_sample_graph_AND_itself
@@ -268,9 +274,8 @@ class Graph_test < Test::Unit::TestCase
     def test_one_node_graph_AND_one_other_node_graph
         g = Graph.new([{'label'=>'foo'}])
         h = Graph.new([{'label'=>'bar'}])
-        empty = Graph.new
-
-        assert_equal(empty, g & h)
+        
+        assert_equal(@@empty, g & h)
     end
 
     def test_sample_graph_AND_no_graph
@@ -287,9 +292,238 @@ class Graph_test < Test::Unit::TestCase
     def test_AND_2_graphs_same_nodes_different_labels
         g1 = @@sample_graph
         g2 = @@sample_graph_1
-        empty = Graph.new
+        
+        assert_equal(@@empty, g1 & g2)
+    end
+
+    # == Graph#^ == #
+
+    def test_XOR_2_empty_graphs
+        g = @@empty
+        assert_equal(g, g ^ g)
+    end
+
+    def test_one_node_graph_XOR_empty_graph
+        g = Graph.new([{'label'=>'foo'}])
+        
+        assert_equal(g, g ^ @@empty)
+    end
+
+    def test_empty_graph_XOR_one_node_graph
+        g = Graph.new([{'label'=>'foo'}])
+        
+        assert_equal(g, @@empty ^ g)
+    end
+
+    def test_sample_graph_XOR_itself
+        g = @@sample_graph
+        
+        assert_equal(@@empty, g ^ g)
+    end
+
+    def test_one_node_graph_XOR_one_other_node_graph
+        g1 = Graph.new([{'label'=>'foo'}])
+        g2 = Graph.new([{'label'=>'bar'}])
+        g3 = Graph.new(g1.nodes+g2.nodes)
+        g4 = Graph.new(g2.nodes+g1.nodes)
+
+        assert_equal(g3, g1 ^ g2)
+        assert_equal(g4, g2 ^ g1)
+    end
+
+    def test_sample_graph_XOR_no_graph
+        g = @@sample_graph
+
+        assert_equal(nil, g ^ 2)
+        assert_equal(nil, g ^ true)
+        assert_equal(nil, g ^ false)
+        assert_equal(nil, g ^ ['foo', 'bar'])
+        assert_equal(nil, g ^ {'foo'=>'bar'})
+        assert_equal(nil, g ^ 'foo')
+    end
+
+    def test_XOR_2_graphs_same_nodes_different_labels
+        g1 = @@sample_graph
+        g2 = @@sample_graph_1
+        g3 = Graph.new(g1.nodes+g2.nodes, g1.edges+g2.edges)
+
+        assert_equal(g3, g1 ^ g2)
+    end
+
+    # == Graph#+ == #
+    
+    def test_empty_graph_plus_empty_graph
+        assert_equal(@@empty, @@empty+@@empty)
+    end
+    
+    def test_empty_graph_plus_sample_graph
+        g = @@sample_graph
+        
+        assert_equal(g, @@empty+g)
+        assert_equal(g, g+@@empty)
+    end
+    
+    def test_sample_graph_plus_itself
+        g = @@sample_graph
+        g2 = Graph.new(g.nodes+g.nodes, g.edges+g.edges)
+
+        assert_equal(g2, g+g)
+    end
+
+    # == Graph#| == #
+    
+    def test_empty_graph_OR_empty_graph
+        assert_equal(@@empty, @@empty|@@empty)
+    end
+    
+    def test_empty_graph_OR_sample_graph
+        g = @@sample_graph
+        
+        assert_equal(g, @@empty|g)
+        assert_equal(g, g|@@empty)
+    end
+    
+    def test_sample_graph_OR_itself
+        g = @@sample_graph
+
+        assert_equal(g, g|g)
+    end
+    
+    def test_sample_graph_OR_other_sample_graph
+        g1 = @@sample_graph
+        g2 = @@sample_graph_1
+        g3 = Graph.new(g1.nodes|g2.nodes, g1.edges|g2.edges)
+        g4 = Graph.new(g2.nodes|g1.nodes, g2.edges|g1.edges)
+
+        assert_equal(g3, g1|g2)
+        assert_equal(g4, g2|g1)
+    end
+
+    # == Graph#- == #
+    
+    def test_empty_graph_minus_empty_graph
+        assert_equal(@@empty, @@empty-@@empty)
+    end
+    
+    def test_empty_graph_minus_sample_graph
+        g = @@sample_graph
+        
+        assert_equal(@@empty, @@empty-g)
+    end
+    
+    def test_sample_graph_minus_empty_graph
+        g = @@sample_graph
+        
+        assert_equal(g, g-@@empty)
+    end
+    
+    def test_sample_graph_minus_itself
+        g = @@sample_graph
+        
+        assert_equal(@@empty, g-g)
+    end
+
+    # == Graph#not == #
+    
+    def test_empty_graph_NOT_empty_graph
+        assert_equal(@@empty, @@empty.not(@@empty))
+    end
+    
+    def test_empty_graph_NOT_sample_graph
+        g = @@sample_graph
+        
+        assert_equal(@@empty, @@empty.not(g))
+    end
+    
+    def test_sample_graph_NOT_empty_graph
+        g = @@sample_graph
+        
+        assert_equal(g, g.not(@@empty))
+    end
+    
+    def test_sample_graph_NOT_itself
+        g = @@sample_graph
+        
+        assert_equal(@@empty, g.not(g))
+    end
+
+    # == Graph::union == #
+
+    def test_union_one_empty_graph
+        assert_equal(@@empty, Graph::union(@@empty))
+    end
+
+    def test_union_3_empty_graph
+        assert_equal(@@empty, Graph::union(@@empty, @@empty, @@empty))
+    end
+    
+    def test_union_empty_graph_and_sample_graph
+        g = @@sample_graph
+        
+        assert_equal(g, Graph::union(@@empty, g))
+        assert_equal(g, Graph::union(g, @@empty))
+    end
+    
+    def test_union_sample_graph_and_itself
+        g = @@sample_graph
+
+        assert_equal(g, Graph::intersection(g, g))
+        assert_equal(g, Graph::intersection(g, g, g, g))
+    end
+    
+    def test_union_sample_graph_and_other_sample_graph
+        g1 = @@sample_graph
+        g2 = @@sample_graph_1
+        g3 = Graph.new(g1.nodes|g2.nodes, g1.edges|g2.edges)
+        g4 = Graph.new(g2.nodes|g1.nodes, g2.edges|g1.edges)
+
+        assert_equal(g3, Graph::union(g1, g2))
+        assert_equal(g3, Graph::union(g1, g1, g2))
+        assert_equal(g3, Graph::union(g1, g2, g2))
+
+        assert_equal(g4, Graph::union(g2, g1))
+        assert_equal(g4, Graph::union(g2, g2, g1))
+        assert_equal(g4, Graph::union(g2, g1, g1))
+    end
+    
+    # == Graph::xor == #
+
+    def test_xor_one_empty_graph
+        assert_equal(@@empty, Graph::xor(@@empty))
+    end
+
+    def test_xor_3_empty_graph
+        assert_equal(@@empty, Graph::xor(@@empty, @@empty, @@empty))
+    end
+    
+    def test_xor_empty_graph_and_sample_graph
+        g = @@sample_graph
+        
+        assert_equal(g, Graph::xor(@@empty, g))
+        assert_equal(g, Graph::xor(g, @@empty))
+    end
+    
+    def test_xor_sample_graph_and_itself
+        g = @@sample_graph
+
+        assert_equal(@@empty, Graph::xor(g, g))
+        assert_equal(@@empty, Graph::xor(g, g, g, g))
+    end
+    
+    def test_xor_sample_graph_and_other_sample_graph
+        g1 = @@sample_graph
+        g2 = @@sample_graph_1
+
+        def _xor(g,h)
+            [(g.nodes|h.nodes)-(g.nodes&h.nodes),
+             (g.edges|h.edges)-(g.edges&h.edges)]
+        end
+
+        g_1_2 = Graph.new(*_xor(g1,g2))
+        g_2_1 = Graph.new(*_xor(g2,g1))
 
-        assert_equal(empty, g1 & g2)
+        assert_equal(g_1_2, Graph::xor(g1, g2))
+        assert_equal(g_2_1, Graph::xor(g2, g1))
     end
 
     # == Graph#write == #

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: graphs
 version: !ruby/object:Gem::Version
-  version: 0.1.3
+  version: 0.1.4
   prerelease: 
 platform: x86-linux
 authors:
@@ -9,7 +9,7 @@ authors:
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2012-05-03 00:00:00.000000000 Z
+date: 2012-05-06 00:00:00.000000000 Z
 dependencies: []
 description: Provide functions to (un)parse GDF files and generate graphs
 email: batifon@yahoo.fr