topiary 1.0.2 → 1.0.3

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 0741356d352846be28e643f7440a8ba1fb073b087c5157fe7ffcdf15395b6278
-  data.tar.gz: 2719dc88e25e2625817b8c718b6feec9259b65e42733171df82939baa10701ab
+  metadata.gz: 2fa0495670fc22ed0936ec8bacf285e54c1d4f500b252ab4f9baea449f97f2e8
+  data.tar.gz: 32f52665a134b24547f509fd504422e24fe49d25573480aeb0e9e5e4493b01c0
 SHA512:
-  metadata.gz: '05303108e626d064d1b854d9e81ef97ae76748b6882702f09a3757d37f0dc68efd35c91808490be72d265edb0e9a71f545be0fbe48e990548cd8b8955a54f81f'
-  data.tar.gz: 98db335bf595a0f42a081ee010fac7fb33cb01b8790c2cd4fcfd035eeb80aa793a6483aaaa369b498e0e0ba5d87b28f159301b55646f5fef546bb8492453def5
+  metadata.gz: 77f118805255160a9ef603ccf42baba867d3dc7abbbecb6f7c9e2be14c28fc19d78419172bafd958610f534a96142b4bf1d59ff6c8a668079c65f75234f4f93e
+  data.tar.gz: de070cd5fbbaa730233025ad160d308a2d8e8dadc866838335f6530c14de982e4adb6c9408271ab33162638ed0117a1d5a43995c3026ab85446bb15b2fbd4bca

data/.rubocop.yml

@@ -24,13 +24,17 @@ Layout/SpaceInsideHashLiteralBraces:
 Layout/SpaceAroundEqualsInParameterDefault:
   EnforcedStyle: no_space
 
+Layout/ExtraSpacing:
+  Enabled: false
+
 Metrics/BlockLength:
   Exclude:
     - "spec/**/*"
   ExcludedMethods: describe
+  Max: 30
 
 Metrics/AbcSize:
-  Max: 30
+  Max: 40
 
 Metrics/CyclomaticComplexity:
   Max: 7
@@ -41,7 +45,10 @@ Metrics/LineLength:
 Metrics/MethodLength:
   Exclude:
     - "spec/**/*"
-  Max: 30
+  Max: 35
+
+Metrics/ClassLength:
+  Max: 1000
 
 Style/AsciiComments:
   Enabled: false
@@ -53,7 +60,9 @@ Style/StringLiterals:
   Enabled: false
 
 Style/BlockDelimiters:
-  EnforcedStyle: semantic
+  EnforcedStyle: line_count_based
+  Exclude:
+    - "spec/**/*"
 
 Style/Documentation:
   Exclude:
@@ -81,5 +90,14 @@ Style/AndOr:
 Style/IfUnlessModifier:
   Enabled: false
 
+Style/NegatedIf:
+  Enabled: false
+
+Style/TrailingCommaInArrayLiteral:
+  EnforcedStyleForMultiline: comma
+
 Naming/UncommunicativeMethodParamName:
   Enabled: false
+
+Lint/EmptyWhen:
+  Enabled: false

data/Changelog

@@ -1,3 +1,10 @@
+1.0.3
+-----
+
+- Added Graph and DirectedGraph, exceptions, functions to compute all
+possible {acyclic,} digraphs of V vertices
+- Added Edge class and topologically_distinct function
+
 1.0.2
 -----
 

data/lib/topiary.rb

@@ -1,5 +1,9 @@
 require 'topiary/version'
+require 'topiary/exceptions'
 require 'topiary/node'
+require 'topiary/edge'
+require 'topiary/graph'
+require 'topiary/directed_graph'
 require 'set'
 
 # {Topiary} provides a topological sort function for Directed Acyclic Graphs.
@@ -44,7 +48,7 @@ module Topiary
     # Make sure there were no cycles
     node_list.each do |n2|
       if n2.needs.any? or n2.feeds.any?
-        raise "Leftover edges found: this graph has a cycle"
+        raise InvalidGraph, "Leftover edges found: this graph has a cycle"
       end
     end
 

data/lib/topiary/directed_graph.rb

@@ -0,0 +1,193 @@
+# Ruby has no factorial function,
+# but fact(n) == Math.gamma(n + 1)
+def factorial(n)
+  Math.gamma(n + 1)
+end
+
+module Topiary
+
+  # A graph whose edges are directed instead of directionless
+  class DirectedGraph < Graph
+
+    def self.all_from_node_count(node_count)
+      all_from_node_list(1.upto(node_count).map{|i| Node.new i.to_s})
+    end
+
+    # Assumes that all input nodes are edgeless.
+    def self.all_from_node_list(nodes=[])
+      Enumerator.new do |y|
+        if nodes.empty?
+          # There is one graph with zero nodes:
+          y.yield DirectedGraph.new
+        else
+          # Find the number of combinations with replacement,
+          # denoted
+          #    n
+          # ((   ))
+          #    k
+          #
+          # which is
+          #
+          #   n + k - 1
+          # (           )
+          #      k
+          #
+          # and where
+          #
+          #   n          n!
+          # (   ) = ------------
+          #   k      k!(n - k)!
+          node_count = nodes.size
+          n = node_count + 2 - 1
+          pair_count = factorial(n) /
+                       (factorial(2) * factorial(n - 2))
+          # Between every two nodes u & v there are 3 choices:
+          #
+          #   - no edge
+          #   - edge from u to v
+          #   - edge from v to u
+          #
+          # Except if u & v are the same node,
+          # choice 2 & choice 3 are the same, so skip one of them.
+          %w[. < >].repeated_permutation(pair_count).each do |edges|
+            our_nodes = nodes.map(&:clone)
+            pairs = our_nodes.repeated_combination(2).to_a
+            g = DirectedGraph.new our_nodes
+            skip = false
+            edges.each_with_index do |dir, i|
+              case dir
+              when '.'
+                # no edge
+              when '<'
+                pairs[i][0].need! pairs[i][1]
+              when '>'
+                # If the two nodes are the same,
+                # we already did this:
+                if pairs[i][0] == pairs[i][1]
+                  skip = true
+                  break
+                end
+                pairs[i][0].feed! pairs[i][1]
+              end
+            end
+            y.yield g unless skip
+          end
+        end
+      end
+    end
+
+    def self.acyclic_from_node_count(node_count)
+      acyclic_from_node_list(1.upto(node_count).map{|i| Node.new i.to_s})
+    end
+
+    def self.acyclic_from_node_list(nodes=[])
+      all_from_node_list(nodes).reject(&:has_cycles?).each(&:forbid_cycles!)
+    end
+
+    # Returns only those graphs that are topologically distinct
+    def self.topologically_distinct(graphs)
+      already_seen = Set.new
+      Enumerator.new do |y|
+        graphs.each do |g|
+          is_new = true
+          already_seen.each do |g2|
+            if g2.topologically_equivalent? g
+              is_new = false
+              break
+            end
+          end
+          if is_new
+            y.yield g
+            already_seen << g
+          end
+        end
+      end
+    end
+
+    def initialize(nodes=[])
+      super
+      @forbid_cycles = false
+    end
+
+    def add_edge!(from_node, to_node)
+      from_node.feed! to_node
+      maybe_forbid_cycles!
+    end
+
+    def edges
+      Enumerator.new do |y|
+        nodes.each do |n|
+          n.feeds.each do |n2|
+            y.yield Edge.new(n, n2)
+          end
+        end
+      end
+    end
+
+    # Two graphs A and B are topologically equivalent
+    # if there is a bijection phi on the vertices
+    # such that edge phi(u)phi(v) is in B iff uv is in A.
+    def topologically_equivalent?(other)
+      our_nodes = nodes.to_a
+      other_nodes = other.nodes.to_a
+      return false if our_nodes.size != other_nodes.size
+      our_edges = edges.to_a
+      other_edges = other.edges.to_a
+      return false if our_edges.size != other_edges.size
+
+      our_node_numbers = Hash[
+        our_nodes.each_with_index.map{|n, i| [n, i]}
+      ]
+
+      # Since there are no permutations,
+      # we have to special case graphs with 0 or 1 node:
+      case our_nodes.size
+      when 0
+        true
+      when 1
+        true  # since we already know they have the same number of edges
+      else
+        # Now we have to try all permutations of the nodes:
+        0.upto(nodes.size - 1).to_a.permutation.each do |phi|
+          equivalent = true
+          catch :answered do
+            our_nodes.each_with_index do |u, i|
+              phi_u = other_nodes[phi[i]]
+              u.feeds.each do |v|
+                phi_v = other_nodes[phi[our_node_numbers[v]]]
+                if not phi_u.feeds.include?(phi_v)
+                  equivalent = false
+                  throw :answered
+                end
+              end
+            end
+          end
+          return true if equivalent
+        end
+        false
+      end
+    end
+
+    # rubocop:disable Naming/PredicateName
+    def has_cycles?
+      Topiary.sort nodes
+      false
+    rescue InvalidGraph
+      true
+    end
+    # rubocop:enable Naming/PredicateName
+
+    def forbid_cycles!(v=true)
+      @forbid_cycles = v
+      maybe_forbid_cycles! if v
+    end
+
+    private
+
+    def maybe_forbid_cycles!
+      raise InvalidGraph, "Cycles found!" if @forbid_cycles and has_cycles?
+    end
+
+  end
+
+end

data/lib/topiary/edge.rb

@@ -0,0 +1,18 @@
+module Topiary
+  # Represents an edge between two nodes in a graph.
+  class Edge
+    attr_reader :feeder, :needer
+
+    def initialize(feeder, needer)
+      @feeder = feeder
+      @needer = needer
+    end
+
+    def to_s
+      [
+        feeder.name,
+        needer.name,
+      ].join("->")
+    end
+  end
+end

data/lib/topiary/exceptions.rb

@@ -0,0 +1,9 @@
+module Topiary
+
+  class TopiaryError < StandardError
+  end
+
+  class InvalidGraph < TopiaryError
+  end
+
+end

data/lib/topiary/graph.rb

@@ -0,0 +1,21 @@
+module Topiary
+  # Represents a Graph
+  class Graph
+    attr_reader :nodes
+
+    def initialize(nodes=[])
+      @nodes = nodes
+    end
+
+    def to_s
+      ar = nodes.map(&:to_s)
+      if ar.empty?
+        "{ }"
+      else
+        "{ #{ar.join('; ')} }"
+      end
+    end
+
+  end
+
+end

data/lib/topiary/node.rb

@@ -64,7 +64,7 @@ class Topiary::Node
     [
       name,
       "needs:[" + needs.map(&:name).join(",") + "]",
-      "feeds:[" + feeds.map(&:name).join(",") + "]"
+      "feeds:[" + feeds.map(&:name).join(",") + "]",
     ].join(" ")
   end
 
@@ -72,4 +72,8 @@ class Topiary::Node
     to_s
   end
 
+  def clone
+    Topiary::Node.new(data, needs, feeds)
+  end
+
 end

data/lib/topiary/version.rb

@@ -1,3 +1,3 @@
 module Topiary
-  VERSION = '1.0.2'.freeze
+  VERSION = '1.0.3'.freeze
 end

data/spec/directed_graph_spec.rb

@@ -0,0 +1,903 @@
+describe Topiary::DirectedGraph do
+
+  context "when allowing cycles" do
+    context "#add_edge!" do
+      it "adds an edge" do
+        n1 = Topiary::Node.new "n1"
+        n2 = Topiary::Node.new "n2"
+        graph = Topiary::DirectedGraph.new([n1, n2])
+        graph.add_edge!(n1, n2)
+        expect(graph.to_s).to eq "{ n1 needs:[] feeds:[n2]; n2 needs:[n1] feeds:[] }"
+      end
+      it "allows cycles" do
+        n1 = Topiary::Node.new "n1"
+        graph = Topiary::DirectedGraph.new([n1])
+        graph.add_edge!(n1, n1)
+        expect(graph.to_s).to eq "{ n1 needs:[n1] feeds:[n1] }"
+      end
+    end
+  end
+
+  context "when forbidding cycles" do
+    context "#add_edge!" do
+      it "adds an edge" do
+        n1 = Topiary::Node.new "n1"
+        n2 = Topiary::Node.new "n2"
+        graph = Topiary::DirectedGraph.new([n1, n2])
+        graph.forbid_cycles!
+        graph.add_edge!(n1, n2)
+        expect(graph.to_s).to eq "{ n1 needs:[] feeds:[n2]; n2 needs:[n1] feeds:[] }"
+      end
+
+      it "forbids cycles" do
+        n1 = Topiary::Node.new "n1"
+        graph = Topiary::DirectedGraph.new([n1])
+        graph.forbid_cycles!
+        expect {
+          graph.add_edge!(n1, n1)
+        }.to raise_error Topiary::InvalidGraph, "Cycles found!"
+      end
+    end
+  end
+
+  context ".all_from_node_count" do
+
+    it "builds 0-node graphs" do
+      expect(Topiary::DirectedGraph.all_from_node_count(0).map(&:to_s)).to eq [
+        "{ }",
+      ]
+    end
+
+    it "builds 1-node graphs" do
+      expect(Topiary::DirectedGraph.all_from_node_count(1).map(&:to_s)).to eq [
+        "{ 1 needs:[] feeds:[] }",
+        "{ 1 needs:[1] feeds:[1] }",
+      ]
+    end
+
+    it "builds 2-node graphs" do
+      expect(Topiary::DirectedGraph.all_from_node_count(2).map(&:to_s)).to eq [
+        "{ 1 needs:[] feeds:[]; 2 needs:[] feeds:[] }",
+        "{ 1 needs:[] feeds:[]; 2 needs:[2] feeds:[2] }",
+        "{ 1 needs:[2] feeds:[]; 2 needs:[] feeds:[1] }",
+        "{ 1 needs:[2] feeds:[]; 2 needs:[2] feeds:[1,2] }",
+        "{ 1 needs:[] feeds:[2]; 2 needs:[1] feeds:[] }",
+        "{ 1 needs:[] feeds:[2]; 2 needs:[1,2] feeds:[2] }",
+        "{ 1 needs:[1] feeds:[1]; 2 needs:[] feeds:[] }",
+        "{ 1 needs:[1] feeds:[1]; 2 needs:[2] feeds:[2] }",
+        "{ 1 needs:[1,2] feeds:[1]; 2 needs:[] feeds:[1] }",
+        "{ 1 needs:[1,2] feeds:[1]; 2 needs:[2] feeds:[1,2] }",
+        "{ 1 needs:[1] feeds:[1,2]; 2 needs:[1] feeds:[] }",
+        "{ 1 needs:[1] feeds:[1,2]; 2 needs:[1,2] feeds:[2] }",
+      ]
+    end
+
+    it "builds 3-node graphs" do
+      expect(Topiary::DirectedGraph.all_from_node_count(3).map(&:to_s)).to eq [
+        "{ 1 needs:[] feeds:[]; 2 needs:[] feeds:[]; 3 needs:[] feeds:[] }",
+        "{ 1 needs:[] feeds:[]; 2 needs:[] feeds:[]; 3 needs:[3] feeds:[3] }",
+        "{ 1 needs:[] feeds:[]; 2 needs:[3] feeds:[]; 3 needs:[] feeds:[2] }",
+        "{ 1 needs:[] feeds:[]; 2 needs:[3] feeds:[]; 3 needs:[3] feeds:[2,3] }",
+        "{ 1 needs:[] feeds:[]; 2 needs:[] feeds:[3]; 3 needs:[2] feeds:[] }",
+        "{ 1 needs:[] feeds:[]; 2 needs:[] feeds:[3]; 3 needs:[2,3] feeds:[3] }",
+        "{ 1 needs:[] feeds:[]; 2 needs:[2] feeds:[2]; 3 needs:[] feeds:[] }",
+        "{ 1 needs:[] feeds:[]; 2 needs:[2] feeds:[2]; 3 needs:[3] feeds:[3] }",
+        "{ 1 needs:[] feeds:[]; 2 needs:[2,3] feeds:[2]; 3 needs:[] feeds:[2] }",
+        "{ 1 needs:[] feeds:[]; 2 needs:[2,3] feeds:[2]; 3 needs:[3] feeds:[2,3] }",
+        "{ 1 needs:[] feeds:[]; 2 needs:[2] feeds:[2,3]; 3 needs:[2] feeds:[] }",
+        "{ 1 needs:[] feeds:[]; 2 needs:[2] feeds:[2,3]; 3 needs:[2,3] feeds:[3] }",
+        "{ 1 needs:[3] feeds:[]; 2 needs:[] feeds:[]; 3 needs:[] feeds:[1] }",
+        "{ 1 needs:[3] feeds:[]; 2 needs:[] feeds:[]; 3 needs:[3] feeds:[1,3] }",
+        "{ 1 needs:[3] feeds:[]; 2 needs:[3] feeds:[]; 3 needs:[] feeds:[1,2] }",
+        "{ 1 needs:[3] feeds:[]; 2 needs:[3] feeds:[]; 3 needs:[3] feeds:[1,2,3] }",
+        "{ 1 needs:[3] feeds:[]; 2 needs:[] feeds:[3]; 3 needs:[2] feeds:[1] }",
+        "{ 1 needs:[3] feeds:[]; 2 needs:[] feeds:[3]; 3 needs:[2,3] feeds:[1,3] }",
+        "{ 1 needs:[3] feeds:[]; 2 needs:[2] feeds:[2]; 3 needs:[] feeds:[1] }",
+        "{ 1 needs:[3] feeds:[]; 2 needs:[2] feeds:[2]; 3 needs:[3] feeds:[1,3] }",
+        "{ 1 needs:[3] feeds:[]; 2 needs:[2,3] feeds:[2]; 3 needs:[] feeds:[1,2] }",
+        "{ 1 needs:[3] feeds:[]; 2 needs:[2,3] feeds:[2]; 3 needs:[3] feeds:[1,2,3] }",
+        "{ 1 needs:[3] feeds:[]; 2 needs:[2] feeds:[2,3]; 3 needs:[2] feeds:[1] }",
+        "{ 1 needs:[3] feeds:[]; 2 needs:[2] feeds:[2,3]; 3 needs:[2,3] feeds:[1,3] }",
+        "{ 1 needs:[] feeds:[3]; 2 needs:[] feeds:[]; 3 needs:[1] feeds:[] }",
+        "{ 1 needs:[] feeds:[3]; 2 needs:[] feeds:[]; 3 needs:[1,3] feeds:[3] }",
+        "{ 1 needs:[] feeds:[3]; 2 needs:[3] feeds:[]; 3 needs:[1] feeds:[2] }",
+        "{ 1 needs:[] feeds:[3]; 2 needs:[3] feeds:[]; 3 needs:[1,3] feeds:[2,3] }",
+        "{ 1 needs:[] feeds:[3]; 2 needs:[] feeds:[3]; 3 needs:[1,2] feeds:[] }",
+        "{ 1 needs:[] feeds:[3]; 2 needs:[] feeds:[3]; 3 needs:[1,2,3] feeds:[3] }",
+        "{ 1 needs:[] feeds:[3]; 2 needs:[2] feeds:[2]; 3 needs:[1] feeds:[] }",
+        "{ 1 needs:[] feeds:[3]; 2 needs:[2] feeds:[2]; 3 needs:[1,3] feeds:[3] }",
+        "{ 1 needs:[] feeds:[3]; 2 needs:[2,3] feeds:[2]; 3 needs:[1] feeds:[2] }",
+        "{ 1 needs:[] feeds:[3]; 2 needs:[2,3] feeds:[2]; 3 needs:[1,3] feeds:[2,3] }",
+        "{ 1 needs:[] feeds:[3]; 2 needs:[2] feeds:[2,3]; 3 needs:[1,2] feeds:[] }",
+        "{ 1 needs:[] feeds:[3]; 2 needs:[2] feeds:[2,3]; 3 needs:[1,2,3] feeds:[3] }",
+        "{ 1 needs:[2] feeds:[]; 2 needs:[] feeds:[1]; 3 needs:[] feeds:[] }",
+        "{ 1 needs:[2] feeds:[]; 2 needs:[] feeds:[1]; 3 needs:[3] feeds:[3] }",
+        "{ 1 needs:[2] feeds:[]; 2 needs:[3] feeds:[1]; 3 needs:[] feeds:[2] }",
+        "{ 1 needs:[2] feeds:[]; 2 needs:[3] feeds:[1]; 3 needs:[3] feeds:[2,3] }",
+        "{ 1 needs:[2] feeds:[]; 2 needs:[] feeds:[1,3]; 3 needs:[2] feeds:[] }",
+        "{ 1 needs:[2] feeds:[]; 2 needs:[] feeds:[1,3]; 3 needs:[2,3] feeds:[3] }",
+        "{ 1 needs:[2] feeds:[]; 2 needs:[2] feeds:[1,2]; 3 needs:[] feeds:[] }",
+        "{ 1 needs:[2] feeds:[]; 2 needs:[2] feeds:[1,2]; 3 needs:[3] feeds:[3] }",
+        "{ 1 needs:[2] feeds:[]; 2 needs:[2,3] feeds:[1,2]; 3 needs:[] feeds:[2] }",
+        "{ 1 needs:[2] feeds:[]; 2 needs:[2,3] feeds:[1,2]; 3 needs:[3] feeds:[2,3] }",
+        "{ 1 needs:[2] feeds:[]; 2 needs:[2] feeds:[1,2,3]; 3 needs:[2] feeds:[] }",
+        "{ 1 needs:[2] feeds:[]; 2 needs:[2] feeds:[1,2,3]; 3 needs:[2,3] feeds:[3] }",
+        "{ 1 needs:[2,3] feeds:[]; 2 needs:[] feeds:[1]; 3 needs:[] feeds:[1] }",
+        "{ 1 needs:[2,3] feeds:[]; 2 needs:[] feeds:[1]; 3 needs:[3] feeds:[1,3] }",
+        "{ 1 needs:[2,3] feeds:[]; 2 needs:[3] feeds:[1]; 3 needs:[] feeds:[1,2] }",
+        "{ 1 needs:[2,3] feeds:[]; 2 needs:[3] feeds:[1]; 3 needs:[3] feeds:[1,2,3] }",
+        "{ 1 needs:[2,3] feeds:[]; 2 needs:[] feeds:[1,3]; 3 needs:[2] feeds:[1] }",
+        "{ 1 needs:[2,3] feeds:[]; 2 needs:[] feeds:[1,3]; 3 needs:[2,3] feeds:[1,3] }",
+        "{ 1 needs:[2,3] feeds:[]; 2 needs:[2] feeds:[1,2]; 3 needs:[] feeds:[1] }",
+        "{ 1 needs:[2,3] feeds:[]; 2 needs:[2] feeds:[1,2]; 3 needs:[3] feeds:[1,3] }",
+        "{ 1 needs:[2,3] feeds:[]; 2 needs:[2,3] feeds:[1,2]; 3 needs:[] feeds:[1,2] }",
+        "{ 1 needs:[2,3] feeds:[]; 2 needs:[2,3] feeds:[1,2]; 3 needs:[3] feeds:[1,2,3] }",
+        "{ 1 needs:[2,3] feeds:[]; 2 needs:[2] feeds:[1,2,3]; 3 needs:[2] feeds:[1] }",
+        "{ 1 needs:[2,3] feeds:[]; 2 needs:[2] feeds:[1,2,3]; 3 needs:[2,3] feeds:[1,3] }",
+        "{ 1 needs:[2] feeds:[3]; 2 needs:[] feeds:[1]; 3 needs:[1] feeds:[] }",
+        "{ 1 needs:[2] feeds:[3]; 2 needs:[] feeds:[1]; 3 needs:[1,3] feeds:[3] }",
+        "{ 1 needs:[2] feeds:[3]; 2 needs:[3] feeds:[1]; 3 needs:[1] feeds:[2] }",
+        "{ 1 needs:[2] feeds:[3]; 2 needs:[3] feeds:[1]; 3 needs:[1,3] feeds:[2,3] }",
+        "{ 1 needs:[2] feeds:[3]; 2 needs:[] feeds:[1,3]; 3 needs:[1,2] feeds:[] }",
+        "{ 1 needs:[2] feeds:[3]; 2 needs:[] feeds:[1,3]; 3 needs:[1,2,3] feeds:[3] }",
+        "{ 1 needs:[2] feeds:[3]; 2 needs:[2] feeds:[1,2]; 3 needs:[1] feeds:[] }",
+        "{ 1 needs:[2] feeds:[3]; 2 needs:[2] feeds:[1,2]; 3 needs:[1,3] feeds:[3] }",
+        "{ 1 needs:[2] feeds:[3]; 2 needs:[2,3] feeds:[1,2]; 3 needs:[1] feeds:[2] }",
+        "{ 1 needs:[2] feeds:[3]; 2 needs:[2,3] feeds:[1,2]; 3 needs:[1,3] feeds:[2,3] }",
+        "{ 1 needs:[2] feeds:[3]; 2 needs:[2] feeds:[1,2,3]; 3 needs:[1,2] feeds:[] }",
+        "{ 1 needs:[2] feeds:[3]; 2 needs:[2] feeds:[1,2,3]; 3 needs:[1,2,3] feeds:[3] }",
+        "{ 1 needs:[] feeds:[2]; 2 needs:[1] feeds:[]; 3 needs:[] feeds:[] }",
+        "{ 1 needs:[] feeds:[2]; 2 needs:[1] feeds:[]; 3 needs:[3] feeds:[3] }",
+        "{ 1 needs:[] feeds:[2]; 2 needs:[1,3] feeds:[]; 3 needs:[] feeds:[2] }",
+        "{ 1 needs:[] feeds:[2]; 2 needs:[1,3] feeds:[]; 3 needs:[3] feeds:[2,3] }",
+        "{ 1 needs:[] feeds:[2]; 2 needs:[1] feeds:[3]; 3 needs:[2] feeds:[] }",
+        "{ 1 needs:[] feeds:[2]; 2 needs:[1] feeds:[3]; 3 needs:[2,3] feeds:[3] }",
+        "{ 1 needs:[] feeds:[2]; 2 needs:[1,2] feeds:[2]; 3 needs:[] feeds:[] }",
+        "{ 1 needs:[] feeds:[2]; 2 needs:[1,2] feeds:[2]; 3 needs:[3] feeds:[3] }",
+        "{ 1 needs:[] feeds:[2]; 2 needs:[1,2,3] feeds:[2]; 3 needs:[] feeds:[2] }",
+        "{ 1 needs:[] feeds:[2]; 2 needs:[1,2,3] feeds:[2]; 3 needs:[3] feeds:[2,3] }",
+        "{ 1 needs:[] feeds:[2]; 2 needs:[1,2] feeds:[2,3]; 3 needs:[2] feeds:[] }",
+        "{ 1 needs:[] feeds:[2]; 2 needs:[1,2] feeds:[2,3]; 3 needs:[2,3] feeds:[3] }",
+        "{ 1 needs:[3] feeds:[2]; 2 needs:[1] feeds:[]; 3 needs:[] feeds:[1] }",
+        "{ 1 needs:[3] feeds:[2]; 2 needs:[1] feeds:[]; 3 needs:[3] feeds:[1,3] }",
+        "{ 1 needs:[3] feeds:[2]; 2 needs:[1,3] feeds:[]; 3 needs:[] feeds:[1,2] }",
+        "{ 1 needs:[3] feeds:[2]; 2 needs:[1,3] feeds:[]; 3 needs:[3] feeds:[1,2,3] }",
+        "{ 1 needs:[3] feeds:[2]; 2 needs:[1] feeds:[3]; 3 needs:[2] feeds:[1] }",
+        "{ 1 needs:[3] feeds:[2]; 2 needs:[1] feeds:[3]; 3 needs:[2,3] feeds:[1,3] }",
+        "{ 1 needs:[3] feeds:[2]; 2 needs:[1,2] feeds:[2]; 3 needs:[] feeds:[1] }",
+        "{ 1 needs:[3] feeds:[2]; 2 needs:[1,2] feeds:[2]; 3 needs:[3] feeds:[1,3] }",
+        "{ 1 needs:[3] feeds:[2]; 2 needs:[1,2,3] feeds:[2]; 3 needs:[] feeds:[1,2] }",
+        "{ 1 needs:[3] feeds:[2]; 2 needs:[1,2,3] feeds:[2]; 3 needs:[3] feeds:[1,2,3] }",
+        "{ 1 needs:[3] feeds:[2]; 2 needs:[1,2] feeds:[2,3]; 3 needs:[2] feeds:[1] }",
+        "{ 1 needs:[3] feeds:[2]; 2 needs:[1,2] feeds:[2,3]; 3 needs:[2,3] feeds:[1,3] }",
+        "{ 1 needs:[] feeds:[2,3]; 2 needs:[1] feeds:[]; 3 needs:[1] feeds:[] }",
+        "{ 1 needs:[] feeds:[2,3]; 2 needs:[1] feeds:[]; 3 needs:[1,3] feeds:[3] }",
+        "{ 1 needs:[] feeds:[2,3]; 2 needs:[1,3] feeds:[]; 3 needs:[1] feeds:[2] }",
+        "{ 1 needs:[] feeds:[2,3]; 2 needs:[1,3] feeds:[]; 3 needs:[1,3] feeds:[2,3] }",
+        "{ 1 needs:[] feeds:[2,3]; 2 needs:[1] feeds:[3]; 3 needs:[1,2] feeds:[] }",
+        "{ 1 needs:[] feeds:[2,3]; 2 needs:[1] feeds:[3]; 3 needs:[1,2,3] feeds:[3] }",
+        "{ 1 needs:[] feeds:[2,3]; 2 needs:[1,2] feeds:[2]; 3 needs:[1] feeds:[] }",
+        "{ 1 needs:[] feeds:[2,3]; 2 needs:[1,2] feeds:[2]; 3 needs:[1,3] feeds:[3] }",
+        "{ 1 needs:[] feeds:[2,3]; 2 needs:[1,2,3] feeds:[2]; 3 needs:[1] feeds:[2] }",
+        "{ 1 needs:[] feeds:[2,3]; 2 needs:[1,2,3] feeds:[2]; 3 needs:[1,3] feeds:[2,3] }",
+        "{ 1 needs:[] feeds:[2,3]; 2 needs:[1,2] feeds:[2,3]; 3 needs:[1,2] feeds:[] }",
+        "{ 1 needs:[] feeds:[2,3]; 2 needs:[1,2] feeds:[2,3]; 3 needs:[1,2,3] feeds:[3] }",
+        "{ 1 needs:[1] feeds:[1]; 2 needs:[] feeds:[]; 3 needs:[] feeds:[] }",
+        "{ 1 needs:[1] feeds:[1]; 2 needs:[] feeds:[]; 3 needs:[3] feeds:[3] }",
+        "{ 1 needs:[1] feeds:[1]; 2 needs:[3] feeds:[]; 3 needs:[] feeds:[2] }",
+        "{ 1 needs:[1] feeds:[1]; 2 needs:[3] feeds:[]; 3 needs:[3] feeds:[2,3] }",
+        "{ 1 needs:[1] feeds:[1]; 2 needs:[] feeds:[3]; 3 needs:[2] feeds:[] }",
+        "{ 1 needs:[1] feeds:[1]; 2 needs:[] feeds:[3]; 3 needs:[2,3] feeds:[3] }",
+        "{ 1 needs:[1] feeds:[1]; 2 needs:[2] feeds:[2]; 3 needs:[] feeds:[] }",
+        "{ 1 needs:[1] feeds:[1]; 2 needs:[2] feeds:[2]; 3 needs:[3] feeds:[3] }",
+        "{ 1 needs:[1] feeds:[1]; 2 needs:[2,3] feeds:[2]; 3 needs:[] feeds:[2] }",
+        "{ 1 needs:[1] feeds:[1]; 2 needs:[2,3] feeds:[2]; 3 needs:[3] feeds:[2,3] }",
+        "{ 1 needs:[1] feeds:[1]; 2 needs:[2] feeds:[2,3]; 3 needs:[2] feeds:[] }",
+        "{ 1 needs:[1] feeds:[1]; 2 needs:[2] feeds:[2,3]; 3 needs:[2,3] feeds:[3] }",
+        "{ 1 needs:[1,3] feeds:[1]; 2 needs:[] feeds:[]; 3 needs:[] feeds:[1] }",
+        "{ 1 needs:[1,3] feeds:[1]; 2 needs:[] feeds:[]; 3 needs:[3] feeds:[1,3] }",
+        "{ 1 needs:[1,3] feeds:[1]; 2 needs:[3] feeds:[]; 3 needs:[] feeds:[1,2] }",
+        "{ 1 needs:[1,3] feeds:[1]; 2 needs:[3] feeds:[]; 3 needs:[3] feeds:[1,2,3] }",
+        "{ 1 needs:[1,3] feeds:[1]; 2 needs:[] feeds:[3]; 3 needs:[2] feeds:[1] }",
+        "{ 1 needs:[1,3] feeds:[1]; 2 needs:[] feeds:[3]; 3 needs:[2,3] feeds:[1,3] }",
+        "{ 1 needs:[1,3] feeds:[1]; 2 needs:[2] feeds:[2]; 3 needs:[] feeds:[1] }",
+        "{ 1 needs:[1,3] feeds:[1]; 2 needs:[2] feeds:[2]; 3 needs:[3] feeds:[1,3] }",
+        "{ 1 needs:[1,3] feeds:[1]; 2 needs:[2,3] feeds:[2]; 3 needs:[] feeds:[1,2] }",
+        "{ 1 needs:[1,3] feeds:[1]; 2 needs:[2,3] feeds:[2]; 3 needs:[3] feeds:[1,2,3] }",
+        "{ 1 needs:[1,3] feeds:[1]; 2 needs:[2] feeds:[2,3]; 3 needs:[2] feeds:[1] }",
+        "{ 1 needs:[1,3] feeds:[1]; 2 needs:[2] feeds:[2,3]; 3 needs:[2,3] feeds:[1,3] }",
+        "{ 1 needs:[1] feeds:[1,3]; 2 needs:[] feeds:[]; 3 needs:[1] feeds:[] }",
+        "{ 1 needs:[1] feeds:[1,3]; 2 needs:[] feeds:[]; 3 needs:[1,3] feeds:[3] }",
+        "{ 1 needs:[1] feeds:[1,3]; 2 needs:[3] feeds:[]; 3 needs:[1] feeds:[2] }",
+        "{ 1 needs:[1] feeds:[1,3]; 2 needs:[3] feeds:[]; 3 needs:[1,3] feeds:[2,3] }",
+        "{ 1 needs:[1] feeds:[1,3]; 2 needs:[] feeds:[3]; 3 needs:[1,2] feeds:[] }",
+        "{ 1 needs:[1] feeds:[1,3]; 2 needs:[] feeds:[3]; 3 needs:[1,2,3] feeds:[3] }",
+        "{ 1 needs:[1] feeds:[1,3]; 2 needs:[2] feeds:[2]; 3 needs:[1] feeds:[] }",
+        "{ 1 needs:[1] feeds:[1,3]; 2 needs:[2] feeds:[2]; 3 needs:[1,3] feeds:[3] }",
+        "{ 1 needs:[1] feeds:[1,3]; 2 needs:[2,3] feeds:[2]; 3 needs:[1] feeds:[2] }",
+        "{ 1 needs:[1] feeds:[1,3]; 2 needs:[2,3] feeds:[2]; 3 needs:[1,3] feeds:[2,3] }",
+        "{ 1 needs:[1] feeds:[1,3]; 2 needs:[2] feeds:[2,3]; 3 needs:[1,2] feeds:[] }",
+        "{ 1 needs:[1] feeds:[1,3]; 2 needs:[2] feeds:[2,3]; 3 needs:[1,2,3] feeds:[3] }",
+        "{ 1 needs:[1,2] feeds:[1]; 2 needs:[] feeds:[1]; 3 needs:[] feeds:[] }",
+        "{ 1 needs:[1,2] feeds:[1]; 2 needs:[] feeds:[1]; 3 needs:[3] feeds:[3] }",
+        "{ 1 needs:[1,2] feeds:[1]; 2 needs:[3] feeds:[1]; 3 needs:[] feeds:[2] }",
+        "{ 1 needs:[1,2] feeds:[1]; 2 needs:[3] feeds:[1]; 3 needs:[3] feeds:[2,3] }",
+        "{ 1 needs:[1,2] feeds:[1]; 2 needs:[] feeds:[1,3]; 3 needs:[2] feeds:[] }",
+        "{ 1 needs:[1,2] feeds:[1]; 2 needs:[] feeds:[1,3]; 3 needs:[2,3] feeds:[3] }",
+        "{ 1 needs:[1,2] feeds:[1]; 2 needs:[2] feeds:[1,2]; 3 needs:[] feeds:[] }",
+        "{ 1 needs:[1,2] feeds:[1]; 2 needs:[2] feeds:[1,2]; 3 needs:[3] feeds:[3] }",
+        "{ 1 needs:[1,2] feeds:[1]; 2 needs:[2,3] feeds:[1,2]; 3 needs:[] feeds:[2] }",
+        "{ 1 needs:[1,2] feeds:[1]; 2 needs:[2,3] feeds:[1,2]; 3 needs:[3] feeds:[2,3] }",
+        "{ 1 needs:[1,2] feeds:[1]; 2 needs:[2] feeds:[1,2,3]; 3 needs:[2] feeds:[] }",
+        "{ 1 needs:[1,2] feeds:[1]; 2 needs:[2] feeds:[1,2,3]; 3 needs:[2,3] feeds:[3] }",
+        "{ 1 needs:[1,2,3] feeds:[1]; 2 needs:[] feeds:[1]; 3 needs:[] feeds:[1] }",
+        "{ 1 needs:[1,2,3] feeds:[1]; 2 needs:[] feeds:[1]; 3 needs:[3] feeds:[1,3] }",
+        "{ 1 needs:[1,2,3] feeds:[1]; 2 needs:[3] feeds:[1]; 3 needs:[] feeds:[1,2] }",
+        "{ 1 needs:[1,2,3] feeds:[1]; 2 needs:[3] feeds:[1]; 3 needs:[3] feeds:[1,2,3] }",
+        "{ 1 needs:[1,2,3] feeds:[1]; 2 needs:[] feeds:[1,3]; 3 needs:[2] feeds:[1] }",
+        "{ 1 needs:[1,2,3] feeds:[1]; 2 needs:[] feeds:[1,3]; 3 needs:[2,3] feeds:[1,3] }",
+        "{ 1 needs:[1,2,3] feeds:[1]; 2 needs:[2] feeds:[1,2]; 3 needs:[] feeds:[1] }",
+        "{ 1 needs:[1,2,3] feeds:[1]; 2 needs:[2] feeds:[1,2]; 3 needs:[3] feeds:[1,3] }",
+        "{ 1 needs:[1,2,3] feeds:[1]; 2 needs:[2,3] feeds:[1,2]; 3 needs:[] feeds:[1,2] }",
+        "{ 1 needs:[1,2,3] feeds:[1]; 2 needs:[2,3] feeds:[1,2]; 3 needs:[3] feeds:[1,2,3] }",
+        "{ 1 needs:[1,2,3] feeds:[1]; 2 needs:[2] feeds:[1,2,3]; 3 needs:[2] feeds:[1] }",
+        "{ 1 needs:[1,2,3] feeds:[1]; 2 needs:[2] feeds:[1,2,3]; 3 needs:[2,3] feeds:[1,3] }",
+        "{ 1 needs:[1,2] feeds:[1,3]; 2 needs:[] feeds:[1]; 3 needs:[1] feeds:[] }",
+        "{ 1 needs:[1,2] feeds:[1,3]; 2 needs:[] feeds:[1]; 3 needs:[1,3] feeds:[3] }",
+        "{ 1 needs:[1,2] feeds:[1,3]; 2 needs:[3] feeds:[1]; 3 needs:[1] feeds:[2] }",
+        "{ 1 needs:[1,2] feeds:[1,3]; 2 needs:[3] feeds:[1]; 3 needs:[1,3] feeds:[2,3] }",
+        "{ 1 needs:[1,2] feeds:[1,3]; 2 needs:[] feeds:[1,3]; 3 needs:[1,2] feeds:[] }",
+        "{ 1 needs:[1,2] feeds:[1,3]; 2 needs:[] feeds:[1,3]; 3 needs:[1,2,3] feeds:[3] }",
+        "{ 1 needs:[1,2] feeds:[1,3]; 2 needs:[2] feeds:[1,2]; 3 needs:[1] feeds:[] }",
+        "{ 1 needs:[1,2] feeds:[1,3]; 2 needs:[2] feeds:[1,2]; 3 needs:[1,3] feeds:[3] }",
+        "{ 1 needs:[1,2] feeds:[1,3]; 2 needs:[2,3] feeds:[1,2]; 3 needs:[1] feeds:[2] }",
+        "{ 1 needs:[1,2] feeds:[1,3]; 2 needs:[2,3] feeds:[1,2]; 3 needs:[1,3] feeds:[2,3] }",
+        "{ 1 needs:[1,2] feeds:[1,3]; 2 needs:[2] feeds:[1,2,3]; 3 needs:[1,2] feeds:[] }",
+        "{ 1 needs:[1,2] feeds:[1,3]; 2 needs:[2] feeds:[1,2,3]; 3 needs:[1,2,3] feeds:[3] }",
+        "{ 1 needs:[1] feeds:[1,2]; 2 needs:[1] feeds:[]; 3 needs:[] feeds:[] }",
+        "{ 1 needs:[1] feeds:[1,2]; 2 needs:[1] feeds:[]; 3 needs:[3] feeds:[3] }",
+        "{ 1 needs:[1] feeds:[1,2]; 2 needs:[1,3] feeds:[]; 3 needs:[] feeds:[2] }",
+        "{ 1 needs:[1] feeds:[1,2]; 2 needs:[1,3] feeds:[]; 3 needs:[3] feeds:[2,3] }",
+        "{ 1 needs:[1] feeds:[1,2]; 2 needs:[1] feeds:[3]; 3 needs:[2] feeds:[] }",
+        "{ 1 needs:[1] feeds:[1,2]; 2 needs:[1] feeds:[3]; 3 needs:[2,3] feeds:[3] }",
+        "{ 1 needs:[1] feeds:[1,2]; 2 needs:[1,2] feeds:[2]; 3 needs:[] feeds:[] }",
+        "{ 1 needs:[1] feeds:[1,2]; 2 needs:[1,2] feeds:[2]; 3 needs:[3] feeds:[3] }",
+        "{ 1 needs:[1] feeds:[1,2]; 2 needs:[1,2,3] feeds:[2]; 3 needs:[] feeds:[2] }",
+        "{ 1 needs:[1] feeds:[1,2]; 2 needs:[1,2,3] feeds:[2]; 3 needs:[3] feeds:[2,3] }",
+        "{ 1 needs:[1] feeds:[1,2]; 2 needs:[1,2] feeds:[2,3]; 3 needs:[2] feeds:[] }",
+        "{ 1 needs:[1] feeds:[1,2]; 2 needs:[1,2] feeds:[2,3]; 3 needs:[2,3] feeds:[3] }",
+        "{ 1 needs:[1,3] feeds:[1,2]; 2 needs:[1] feeds:[]; 3 needs:[] feeds:[1] }",
+        "{ 1 needs:[1,3] feeds:[1,2]; 2 needs:[1] feeds:[]; 3 needs:[3] feeds:[1,3] }",
+        "{ 1 needs:[1,3] feeds:[1,2]; 2 needs:[1,3] feeds:[]; 3 needs:[] feeds:[1,2] }",
+        "{ 1 needs:[1,3] feeds:[1,2]; 2 needs:[1,3] feeds:[]; 3 needs:[3] feeds:[1,2,3] }",
+        "{ 1 needs:[1,3] feeds:[1,2]; 2 needs:[1] feeds:[3]; 3 needs:[2] feeds:[1] }",
+        "{ 1 needs:[1,3] feeds:[1,2]; 2 needs:[1] feeds:[3]; 3 needs:[2,3] feeds:[1,3] }",
+        "{ 1 needs:[1,3] feeds:[1,2]; 2 needs:[1,2] feeds:[2]; 3 needs:[] feeds:[1] }",
+        "{ 1 needs:[1,3] feeds:[1,2]; 2 needs:[1,2] feeds:[2]; 3 needs:[3] feeds:[1,3] }",
+        "{ 1 needs:[1,3] feeds:[1,2]; 2 needs:[1,2,3] feeds:[2]; 3 needs:[] feeds:[1,2] }",
+        "{ 1 needs:[1,3] feeds:[1,2]; 2 needs:[1,2,3] feeds:[2]; 3 needs:[3] feeds:[1,2,3] }",
+        "{ 1 needs:[1,3] feeds:[1,2]; 2 needs:[1,2] feeds:[2,3]; 3 needs:[2] feeds:[1] }",
+        "{ 1 needs:[1,3] feeds:[1,2]; 2 needs:[1,2] feeds:[2,3]; 3 needs:[2,3] feeds:[1,3] }",
+        "{ 1 needs:[1] feeds:[1,2,3]; 2 needs:[1] feeds:[]; 3 needs:[1] feeds:[] }",
+        "{ 1 needs:[1] feeds:[1,2,3]; 2 needs:[1] feeds:[]; 3 needs:[1,3] feeds:[3] }",
+        "{ 1 needs:[1] feeds:[1,2,3]; 2 needs:[1,3] feeds:[]; 3 needs:[1] feeds:[2] }",
+        "{ 1 needs:[1] feeds:[1,2,3]; 2 needs:[1,3] feeds:[]; 3 needs:[1,3] feeds:[2,3] }",
+        "{ 1 needs:[1] feeds:[1,2,3]; 2 needs:[1] feeds:[3]; 3 needs:[1,2] feeds:[] }",
+        "{ 1 needs:[1] feeds:[1,2,3]; 2 needs:[1] feeds:[3]; 3 needs:[1,2,3] feeds:[3] }",
+        "{ 1 needs:[1] feeds:[1,2,3]; 2 needs:[1,2] feeds:[2]; 3 needs:[1] feeds:[] }",
+        "{ 1 needs:[1] feeds:[1,2,3]; 2 needs:[1,2] feeds:[2]; 3 needs:[1,3] feeds:[3] }",
+        "{ 1 needs:[1] feeds:[1,2,3]; 2 needs:[1,2,3] feeds:[2]; 3 needs:[1] feeds:[2] }",
+        "{ 1 needs:[1] feeds:[1,2,3]; 2 needs:[1,2,3] feeds:[2]; 3 needs:[1,3] feeds:[2,3] }",
+        "{ 1 needs:[1] feeds:[1,2,3]; 2 needs:[1,2] feeds:[2,3]; 3 needs:[1,2] feeds:[] }",
+        "{ 1 needs:[1] feeds:[1,2,3]; 2 needs:[1,2] feeds:[2,3]; 3 needs:[1,2,3] feeds:[3] }",
+      ]
+    end
+
+  end
+
+  context ".acyclic_from_node_count" do
+
+    it "builds 0-node graphs" do
+      expect(Topiary::DirectedGraph.acyclic_from_node_count(0).map(&:to_s)).to eq [
+        "{ }",
+      ]
+    end
+
+    it "builds 1-node graphs" do
+      expect(Topiary::DirectedGraph.acyclic_from_node_count(1).map(&:to_s)).to eq [
+        "{ 1 needs:[] feeds:[] }",
+      ]
+    end
+
+    it "builds 2-node graphs" do
+      expect(Topiary::DirectedGraph.acyclic_from_node_count(2).map(&:to_s)).to eq [
+        "{ 1 needs:[] feeds:[]; 2 needs:[] feeds:[] }",
+        "{ 1 needs:[2] feeds:[]; 2 needs:[] feeds:[1] }",
+        "{ 1 needs:[] feeds:[2]; 2 needs:[1] feeds:[] }",
+      ]
+    end
+
+    it "builds 3-node graphs" do
+      expect(Topiary::DirectedGraph.acyclic_from_node_count(3).map(&:to_s)).to eq [
+        "{ 1 needs:[] feeds:[]; 2 needs:[] feeds:[]; 3 needs:[] feeds:[] }",
+        "{ 1 needs:[] feeds:[]; 2 needs:[3] feeds:[]; 3 needs:[] feeds:[2] }",
+        "{ 1 needs:[] feeds:[]; 2 needs:[] feeds:[3]; 3 needs:[2] feeds:[] }",
+        "{ 1 needs:[3] feeds:[]; 2 needs:[] feeds:[]; 3 needs:[] feeds:[1] }",
+        "{ 1 needs:[3] feeds:[]; 2 needs:[3] feeds:[]; 3 needs:[] feeds:[1,2] }",
+        "{ 1 needs:[3] feeds:[]; 2 needs:[] feeds:[3]; 3 needs:[2] feeds:[1] }",
+        "{ 1 needs:[] feeds:[3]; 2 needs:[] feeds:[]; 3 needs:[1] feeds:[] }",
+        "{ 1 needs:[] feeds:[3]; 2 needs:[3] feeds:[]; 3 needs:[1] feeds:[2] }",
+        "{ 1 needs:[] feeds:[3]; 2 needs:[] feeds:[3]; 3 needs:[1,2] feeds:[] }",
+        "{ 1 needs:[2] feeds:[]; 2 needs:[] feeds:[1]; 3 needs:[] feeds:[] }",
+        "{ 1 needs:[2] feeds:[]; 2 needs:[3] feeds:[1]; 3 needs:[] feeds:[2] }",
+        "{ 1 needs:[2] feeds:[]; 2 needs:[] feeds:[1,3]; 3 needs:[2] feeds:[] }",
+        "{ 1 needs:[2,3] feeds:[]; 2 needs:[] feeds:[1]; 3 needs:[] feeds:[1] }",
+        "{ 1 needs:[2,3] feeds:[]; 2 needs:[3] feeds:[1]; 3 needs:[] feeds:[1,2] }",
+        "{ 1 needs:[2,3] feeds:[]; 2 needs:[] feeds:[1,3]; 3 needs:[2] feeds:[1] }",
+        "{ 1 needs:[2] feeds:[3]; 2 needs:[] feeds:[1]; 3 needs:[1] feeds:[] }",
+        "{ 1 needs:[2] feeds:[3]; 2 needs:[] feeds:[1,3]; 3 needs:[1,2] feeds:[] }",
+        "{ 1 needs:[] feeds:[2]; 2 needs:[1] feeds:[]; 3 needs:[] feeds:[] }",
+        "{ 1 needs:[] feeds:[2]; 2 needs:[1,3] feeds:[]; 3 needs:[] feeds:[2] }",
+        "{ 1 needs:[] feeds:[2]; 2 needs:[1] feeds:[3]; 3 needs:[2] feeds:[] }",
+        "{ 1 needs:[3] feeds:[2]; 2 needs:[1] feeds:[]; 3 needs:[] feeds:[1] }",
+        "{ 1 needs:[3] feeds:[2]; 2 needs:[1,3] feeds:[]; 3 needs:[] feeds:[1,2] }",
+        "{ 1 needs:[] feeds:[2,3]; 2 needs:[1] feeds:[]; 3 needs:[1] feeds:[] }",
+        "{ 1 needs:[] feeds:[2,3]; 2 needs:[1,3] feeds:[]; 3 needs:[1] feeds:[2] }",
+        "{ 1 needs:[] feeds:[2,3]; 2 needs:[1] feeds:[3]; 3 needs:[1,2] feeds:[] }",
+      ]
+    end
+
+  end
+
+  context "#edges" do
+    it "gives edges for a 0-node graph" do
+      expect(Topiary::DirectedGraph.new.edges.to_a).to eq []
+    end
+
+    it "gives edges for a 1-node graph" do
+      n1 = Topiary::Node.new "n1"
+      g = Topiary::DirectedGraph.new [n1]
+      expect(g.edges.map(&:to_s)).to eq []
+      g.add_edge! n1, n1
+      expect(g.edges.map(&:to_s)).to eq ["n1->n1"]
+    end
+
+    it "gives edges for a 2-node graph" do
+      n1 = Topiary::Node.new "n1"
+      n2 = Topiary::Node.new "n2"
+      g = Topiary::DirectedGraph.new [n1, n2]
+      expect(g.edges.map(&:to_s)).to eq []
+      g.add_edge! n1, n1
+      g.add_edge! n1, n2
+      expect(g.edges.map(&:to_s)).to eq ["n1->n1", "n1->n2"]
+      g.add_edge! n2, n1
+      expect(g.edges.map(&:to_s)).to eq ["n1->n1", "n1->n2", "n2->n1"]
+    end
+  end
+
+  context "#topologically_equivalent?" do
+    it "is false for graphs with different node counts" do
+      g1 = Topiary::DirectedGraph.new
+      n1 = Topiary::Node.new "n1"
+      g2 = Topiary::DirectedGraph.new [n1]
+      expect(g1).not_to be_topologically_equivalent(g2)
+      expect(g2).not_to be_topologically_equivalent(g1)
+    end
+
+    it "is false for graphs with different edge counts" do
+      n1 = Topiary::Node.new "n1"
+      g1 = Topiary::DirectedGraph.new [n1]
+      g1.add_edge! n1, n1
+      n2 = Topiary::Node.new "n2"
+      g2 = Topiary::DirectedGraph.new [n2]
+      expect(g1).not_to be_topologically_equivalent(g2)
+      expect(g2).not_to be_topologically_equivalent(g1)
+    end
+
+    it "is true for graphs with 0 nodes" do
+      g1 = Topiary::DirectedGraph.new
+      g2 = Topiary::DirectedGraph.new
+      expect(g1).to be_topologically_equivalent(g1)
+      expect(g1).to be_topologically_equivalent(g2)
+      expect(g2).to be_topologically_equivalent(g1)
+    end
+
+    it "is true for graphs with 1 node and 0 edges" do
+      n1 = Topiary::Node.new "n1"
+      g1 = Topiary::DirectedGraph.new [n1]
+      n2 = Topiary::Node.new "n2"
+      g2 = Topiary::DirectedGraph.new [n2]
+      expect(g1).to be_topologically_equivalent(g1)
+      expect(g1).to be_topologically_equivalent(g2)
+      expect(g2).to be_topologically_equivalent(g1)
+    end
+
+    it "is true for graphs with 1 node and 1 edge" do
+      n1 = Topiary::Node.new "n1"
+      g1 = Topiary::DirectedGraph.new [n1]
+      g1.add_edge! n1, n1
+      n2 = Topiary::Node.new "n2"
+      g2 = Topiary::DirectedGraph.new [n2]
+      g2.add_edge! n2, n2
+      expect(g1).to be_topologically_equivalent(g1)
+      expect(g1).to be_topologically_equivalent(g2)
+      expect(g2).to be_topologically_equivalent(g1)
+    end
+
+    it "is true for graphs with 2 nodes and 0 edges" do
+      n1 = Topiary::Node.new "n1"
+      n2 = Topiary::Node.new "n2"
+      g1 = Topiary::DirectedGraph.new [n1, n2]
+      n3 = Topiary::Node.new "n3"
+      n4 = Topiary::Node.new "n4"
+      g2 = Topiary::DirectedGraph.new [n3, n4]
+      expect(g1).to be_topologically_equivalent(g1)
+      expect(g1).to be_topologically_equivalent(g2)
+      expect(g2).to be_topologically_equivalent(g1)
+    end
+
+    it "is true for some graphs with 2 nodes and 1 edge" do
+      n1 = Topiary::Node.new "n1"
+      n2 = Topiary::Node.new "n2"
+      g1 = Topiary::DirectedGraph.new [n1, n2]
+      g1.add_edge! n1, n1
+      n3 = Topiary::Node.new "n3"
+      n4 = Topiary::Node.new "n4"
+      g2 = Topiary::DirectedGraph.new [n3, n4]
+      g2.add_edge! n3, n3
+      expect(g1).to be_topologically_equivalent(g1)
+      expect(g1).to be_topologically_equivalent(g2)
+      expect(g2).to be_topologically_equivalent(g1)
+
+      n1 = Topiary::Node.new "n1"
+      n2 = Topiary::Node.new "n2"
+      g1 = Topiary::DirectedGraph.new [n1, n2]
+      g1.add_edge! n1, n2
+      n3 = Topiary::Node.new "n3"
+      n4 = Topiary::Node.new "n4"
+      g2 = Topiary::DirectedGraph.new [n3, n4]
+      g2.add_edge! n3, n4
+      expect(g1).to be_topologically_equivalent(g1)
+      expect(g1).to be_topologically_equivalent(g2)
+      expect(g2).to be_topologically_equivalent(g1)
+    end
+
+    it "is false for some graphs with 2 nodes and 1 edge" do
+      n1 = Topiary::Node.new "n1"
+      n2 = Topiary::Node.new "n2"
+      g1 = Topiary::DirectedGraph.new [n1, n2]
+      g1.add_edge! n1, n1
+      n3 = Topiary::Node.new "n3"
+      n4 = Topiary::Node.new "n4"
+      g2 = Topiary::DirectedGraph.new [n3, n4]
+      g2.add_edge! n3, n4
+      expect(g1).not_to be_topologically_equivalent(g2)
+      expect(g2).not_to be_topologically_equivalent(g1)
+    end
+
+    it "is true for some graphs with 2 nodes and 2 edges" do
+      n1 = Topiary::Node.new "n1"
+      n2 = Topiary::Node.new "n2"
+      g1 = Topiary::DirectedGraph.new [n1, n2]
+      g1.add_edge! n1, n1
+      g1.add_edge! n2, n2
+      n3 = Topiary::Node.new "n3"
+      n4 = Topiary::Node.new "n4"
+      g2 = Topiary::DirectedGraph.new [n3, n4]
+      g2.add_edge! n3, n3
+      g2.add_edge! n4, n4
+      expect(g1).to be_topologically_equivalent(g1)
+      expect(g1).to be_topologically_equivalent(g2)
+      expect(g2).to be_topologically_equivalent(g1)
+
+      n1 = Topiary::Node.new "n1"
+      n2 = Topiary::Node.new "n2"
+      g1 = Topiary::DirectedGraph.new [n1, n2]
+      g1.add_edge! n1, n1
+      g1.add_edge! n1, n2
+      n3 = Topiary::Node.new "n3"
+      n4 = Topiary::Node.new "n4"
+      g2 = Topiary::DirectedGraph.new [n3, n4]
+      g2.add_edge! n3, n3
+      g2.add_edge! n3, n4
+      expect(g1).to be_topologically_equivalent(g1)
+      expect(g1).to be_topologically_equivalent(g2)
+      expect(g2).to be_topologically_equivalent(g1)
+
+      n1 = Topiary::Node.new "n1"
+      n2 = Topiary::Node.new "n2"
+      g1 = Topiary::DirectedGraph.new [n1, n2]
+      g1.add_edge! n1, n2
+      g1.add_edge! n2, n1
+      n3 = Topiary::Node.new "n3"
+      n4 = Topiary::Node.new "n4"
+      g2 = Topiary::DirectedGraph.new [n3, n4]
+      g2.add_edge! n3, n4
+      g2.add_edge! n4, n3
+      expect(g1).to be_topologically_equivalent(g1)
+      expect(g1).to be_topologically_equivalent(g2)
+      expect(g2).to be_topologically_equivalent(g1)
+    end
+
+    it "is false for some graphs with 2 nodes and 2 edges" do
+      n1 = Topiary::Node.new "n1"
+      n2 = Topiary::Node.new "n2"
+      g1 = Topiary::DirectedGraph.new [n1, n2]
+      g1.add_edge! n1, n1
+      g1.add_edge! n1, n2
+      n3 = Topiary::Node.new "n3"
+      n4 = Topiary::Node.new "n4"
+      g2 = Topiary::DirectedGraph.new [n3, n4]
+      g2.add_edge! n3, n4
+      g2.add_edge! n4, n3
+      expect(g1).not_to be_topologically_equivalent(g2)
+      expect(g2).not_to be_topologically_equivalent(g1)
+    end
+
+    it "is true for graphs with 3 nodes and 0 edges" do
+      n1 = Topiary::Node.new "n1"
+      n2 = Topiary::Node.new "n2"
+      n3 = Topiary::Node.new "n3"
+      g1 = Topiary::DirectedGraph.new [n1, n2, n3]
+      n4 = Topiary::Node.new "n4"
+      n5 = Topiary::Node.new "n5"
+      n6 = Topiary::Node.new "n6"
+      g2 = Topiary::DirectedGraph.new [n4, n5, n6]
+      expect(g1).to be_topologically_equivalent(g1)
+      expect(g1).to be_topologically_equivalent(g2)
+      expect(g2).to be_topologically_equivalent(g1)
+    end
+
+    it "is true for some graphs with 3 nodes and 1 edge" do
+      n1 = Topiary::Node.new "n1"
+      n2 = Topiary::Node.new "n2"
+      n3 = Topiary::Node.new "n3"
+      g1 = Topiary::DirectedGraph.new [n1, n2, n3]
+      g1.add_edge! n1, n1
+      n4 = Topiary::Node.new "n4"
+      n5 = Topiary::Node.new "n5"
+      n6 = Topiary::Node.new "n6"
+      g2 = Topiary::DirectedGraph.new [n4, n5, n6]
+      g1.add_edge! n5, n5
+      expect(g1).to be_topologically_equivalent(g1)
+      expect(g1).to be_topologically_equivalent(g2)
+      expect(g2).to be_topologically_equivalent(g1)
+
+      n1 = Topiary::Node.new "n1"
+      n2 = Topiary::Node.new "n2"
+      n3 = Topiary::Node.new "n3"
+      g1 = Topiary::DirectedGraph.new [n1, n2, n3]
+      g1.add_edge! n1, n3
+      n4 = Topiary::Node.new "n4"
+      n5 = Topiary::Node.new "n5"
+      n6 = Topiary::Node.new "n6"
+      g2 = Topiary::DirectedGraph.new [n4, n5, n6]
+      g1.add_edge! n6, n5
+      expect(g1).to be_topologically_equivalent(g1)
+      expect(g1).to be_topologically_equivalent(g2)
+      expect(g2).to be_topologically_equivalent(g1)
+    end
+
+    it "is false for some graphs with 3 nodes and 1 edge" do
+      n1 = Topiary::Node.new "n1"
+      n2 = Topiary::Node.new "n2"
+      n3 = Topiary::Node.new "n3"
+      g1 = Topiary::DirectedGraph.new [n1, n2, n3]
+      g1.add_edge! n1, n1
+      n4 = Topiary::Node.new "n4"
+      n5 = Topiary::Node.new "n5"
+      n6 = Topiary::Node.new "n6"
+      g2 = Topiary::DirectedGraph.new [n4, n5, n6]
+      g1.add_edge! n6, n5
+      expect(g1).not_to be_topologically_equivalent(g2)
+      expect(g2).not_to be_topologically_equivalent(g1)
+    end
+
+    it "is true for some graphs with 3 nodes and 2 edges" do
+      n1 = Topiary::Node.new "n1"
+      n2 = Topiary::Node.new "n2"
+      n3 = Topiary::Node.new "n3"
+      g1 = Topiary::DirectedGraph.new [n1, n2, n3]
+      g1.add_edge! n1, n1
+      g1.add_edge! n2, n2
+      n4 = Topiary::Node.new "n4"
+      n5 = Topiary::Node.new "n5"
+      n6 = Topiary::Node.new "n6"
+      g2 = Topiary::DirectedGraph.new [n4, n5, n6]
+      g1.add_edge! n4, n4
+      g1.add_edge! n6, n6
+      expect(g1).to be_topologically_equivalent(g1)
+      expect(g1).to be_topologically_equivalent(g2)
+      expect(g2).to be_topologically_equivalent(g1)
+
+      n1 = Topiary::Node.new "n1"
+      n2 = Topiary::Node.new "n2"
+      n3 = Topiary::Node.new "n3"
+      g1 = Topiary::DirectedGraph.new [n1, n2, n3]
+      g1.add_edge! n1, n1
+      g1.add_edge! n1, n3
+      n4 = Topiary::Node.new "n4"
+      n5 = Topiary::Node.new "n5"
+      n6 = Topiary::Node.new "n6"
+      g2 = Topiary::DirectedGraph.new [n4, n5, n6]
+      g1.add_edge! n6, n6
+      g1.add_edge! n6, n5
+      expect(g1).to be_topologically_equivalent(g1)
+      expect(g1).to be_topologically_equivalent(g2)
+      expect(g2).to be_topologically_equivalent(g1)
+
+      n1 = Topiary::Node.new "n1"
+      n2 = Topiary::Node.new "n2"
+      n3 = Topiary::Node.new "n3"
+      g1 = Topiary::DirectedGraph.new [n1, n2, n3]
+      g1.add_edge! n1, n1
+      g1.add_edge! n3, n1
+      n4 = Topiary::Node.new "n4"
+      n5 = Topiary::Node.new "n5"
+      n6 = Topiary::Node.new "n6"
+      g2 = Topiary::DirectedGraph.new [n4, n5, n6]
+      g1.add_edge! n4, n4
+      g1.add_edge! n5, n4
+      expect(g1).to be_topologically_equivalent(g1)
+      expect(g1).to be_topologically_equivalent(g2)
+      expect(g2).to be_topologically_equivalent(g1)
+
+      n1 = Topiary::Node.new "n1"
+      n2 = Topiary::Node.new "n2"
+      n3 = Topiary::Node.new "n3"
+      g1 = Topiary::DirectedGraph.new [n1, n2, n3]
+      g1.add_edge! n1, n1
+      g1.add_edge! n2, n3
+      n4 = Topiary::Node.new "n4"
+      n5 = Topiary::Node.new "n5"
+      n6 = Topiary::Node.new "n6"
+      g2 = Topiary::DirectedGraph.new [n4, n5, n6]
+      g1.add_edge! n6, n6
+      g1.add_edge! n4, n5
+      expect(g1).to be_topologically_equivalent(g1)
+      expect(g1).to be_topologically_equivalent(g2)
+      expect(g2).to be_topologically_equivalent(g1)
+
+      n1 = Topiary::Node.new "n1"
+      n2 = Topiary::Node.new "n2"
+      n3 = Topiary::Node.new "n3"
+      g1 = Topiary::DirectedGraph.new [n1, n2, n3]
+      g1.add_edge! n1, n2
+      g1.add_edge! n1, n3
+      n4 = Topiary::Node.new "n4"
+      n5 = Topiary::Node.new "n5"
+      n6 = Topiary::Node.new "n6"
+      g2 = Topiary::DirectedGraph.new [n4, n5, n6]
+      g1.add_edge! n5, n6
+      g1.add_edge! n5, n4
+      expect(g1).to be_topologically_equivalent(g1)
+      expect(g1).to be_topologically_equivalent(g2)
+      expect(g2).to be_topologically_equivalent(g1)
+
+      n1 = Topiary::Node.new "n1"
+      n2 = Topiary::Node.new "n2"
+      n3 = Topiary::Node.new "n3"
+      g1 = Topiary::DirectedGraph.new [n1, n2, n3]
+      g1.add_edge! n2, n1
+      g1.add_edge! n3, n1
+      n4 = Topiary::Node.new "n4"
+      n5 = Topiary::Node.new "n5"
+      n6 = Topiary::Node.new "n6"
+      g2 = Topiary::DirectedGraph.new [n4, n5, n6]
+      g1.add_edge! n5, n4
+      g1.add_edge! n6, n4
+      expect(g1).to be_topologically_equivalent(g1)
+      expect(g1).to be_topologically_equivalent(g2)
+      expect(g2).to be_topologically_equivalent(g1)
+
+      n1 = Topiary::Node.new "n1"
+      n2 = Topiary::Node.new "n2"
+      n3 = Topiary::Node.new "n3"
+      g1 = Topiary::DirectedGraph.new [n1, n2, n3]
+      g1.add_edge! n1, n2
+      g1.add_edge! n2, n3
+      n4 = Topiary::Node.new "n4"
+      n5 = Topiary::Node.new "n5"
+      n6 = Topiary::Node.new "n6"
+      g2 = Topiary::DirectedGraph.new [n4, n5, n6]
+      g1.add_edge! n5, n6
+      g1.add_edge! n6, n4
+      expect(g1).to be_topologically_equivalent(g1)
+      expect(g1).to be_topologically_equivalent(g2)
+      expect(g2).to be_topologically_equivalent(g1)
+    end
+
+    it "is false for some graphs with 3 nodes and 2 edges" do
+      n1 = Topiary::Node.new "n1"
+      n2 = Topiary::Node.new "n2"
+      n3 = Topiary::Node.new "n3"
+      g1 = Topiary::DirectedGraph.new [n1, n2, n3]
+      g1.add_edge! n1, n1
+      g1.add_edge! n2, n1
+      n4 = Topiary::Node.new "n4"
+      n5 = Topiary::Node.new "n5"
+      n6 = Topiary::Node.new "n6"
+      g2 = Topiary::DirectedGraph.new [n4, n5, n6]
+      g1.add_edge! n5, n4
+      g1.add_edge! n6, n4
+      expect(g1).not_to be_topologically_equivalent(g2)
+      expect(g2).not_to be_topologically_equivalent(g1)
+
+      n1 = Topiary::Node.new "n1"
+      n2 = Topiary::Node.new "n2"
+      n3 = Topiary::Node.new "n3"
+      g1 = Topiary::DirectedGraph.new [n1, n2, n3]
+      g1.add_edge! n1, n1
+      g1.add_edge! n1, n2
+      n4 = Topiary::Node.new "n4"
+      n5 = Topiary::Node.new "n5"
+      n6 = Topiary::Node.new "n6"
+      g2 = Topiary::DirectedGraph.new [n4, n5, n6]
+      g1.add_edge! n5, n4
+      g1.add_edge! n6, n4
+      expect(g1).not_to be_topologically_equivalent(g2)
+      expect(g2).not_to be_topologically_equivalent(g1)
+
+      # not exhaustive...
+    end
+
+    it "is true for some graphs with 3 nodes and 3 edges" do
+      n1 = Topiary::Node.new "n1"
+      n2 = Topiary::Node.new "n2"
+      n3 = Topiary::Node.new "n3"
+      g1 = Topiary::DirectedGraph.new [n1, n2, n3]
+      g1.add_edge! n1, n2
+      g1.add_edge! n2, n3
+      g1.add_edge! n3, n1
+      n4 = Topiary::Node.new "n4"
+      n5 = Topiary::Node.new "n5"
+      n6 = Topiary::Node.new "n6"
+      g2 = Topiary::DirectedGraph.new [n4, n5, n6]
+      g1.add_edge! n5, n6
+      g1.add_edge! n6, n4
+      g1.add_edge! n4, n5
+      expect(g1).to be_topologically_equivalent(g1)
+      expect(g1).to be_topologically_equivalent(g2)
+      expect(g2).to be_topologically_equivalent(g1)
+
+      # not exhaustive...
+    end
+
+    it "is false for some graphs with 3 nodes and 3 edges" do
+      n1 = Topiary::Node.new "n1"
+      n2 = Topiary::Node.new "n2"
+      n3 = Topiary::Node.new "n3"
+      g1 = Topiary::DirectedGraph.new [n1, n2, n3]
+      g1.add_edge! n1, n2
+      g1.add_edge! n2, n3
+      g1.add_edge! n3, n1
+      n4 = Topiary::Node.new "n4"
+      n5 = Topiary::Node.new "n5"
+      n6 = Topiary::Node.new "n6"
+      g2 = Topiary::DirectedGraph.new [n4, n5, n6]
+      g1.add_edge! n4, n5
+      g1.add_edge! n5, n6
+      g1.add_edge! n4, n6
+      expect(g1).not_to be_topologically_equivalent(g2)
+      expect(g2).not_to be_topologically_equivalent(g1)
+
+      # not exhaustive...
+    end
+  end
+
+  context ".topologically_distinct" do
+    it "find all graphs with 3 nodes and 2 edges" do
+      graphs = Topiary::DirectedGraph.topologically_distinct(
+        Topiary::DirectedGraph.all_from_node_count(3).select{|g| g.edges.count == 2}
+      ).map(&:to_s)
+      expect(graphs).to eq [
+        "{ 1 needs:[] feeds:[]; 2 needs:[3] feeds:[]; 3 needs:[3] feeds:[2,3] }",
+        "{ 1 needs:[] feeds:[]; 2 needs:[] feeds:[3]; 3 needs:[2,3] feeds:[3] }",
+        "{ 1 needs:[] feeds:[]; 2 needs:[2] feeds:[2]; 3 needs:[3] feeds:[3] }",
+        "{ 1 needs:[3] feeds:[]; 2 needs:[3] feeds:[]; 3 needs:[] feeds:[1,2] }",
+        "{ 1 needs:[3] feeds:[]; 2 needs:[] feeds:[3]; 3 needs:[2] feeds:[1] }",
+        "{ 1 needs:[3] feeds:[]; 2 needs:[2] feeds:[2]; 3 needs:[] feeds:[1] }",
+        "{ 1 needs:[] feeds:[3]; 2 needs:[] feeds:[3]; 3 needs:[1,2] feeds:[] }",
+      ]
+    end
+
+    it "find acyclic graphs with 4 nodes and 0 edges" do
+      graphs = Topiary::DirectedGraph.topologically_distinct(
+        Topiary::DirectedGraph.acyclic_from_node_count(4).select{|g| g.edges.count == 0}
+      ).map(&:to_s)
+      expect(graphs).to eq [
+        "{ 1 needs:[] feeds:[]; 2 needs:[] feeds:[]; 3 needs:[] feeds:[]; 4 needs:[] feeds:[] }",
+      ]
+    end
+    it "find acyclic graphs with 4 nodes and 1 edge" do
+      graphs = Topiary::DirectedGraph.topologically_distinct(
+        Topiary::DirectedGraph.acyclic_from_node_count(4).select{|g| g.edges.count == 1}
+      ).map(&:to_s)
+      expect(graphs).to eq [
+        "{ 1 needs:[] feeds:[]; 2 needs:[] feeds:[]; 3 needs:[4] feeds:[]; 4 needs:[] feeds:[3] }",
+      ]
+    end
+
+    it "find acyclic graphs with 4 nodes and 2 edges" do
+      graphs = Topiary::DirectedGraph.topologically_distinct(
+        Topiary::DirectedGraph.acyclic_from_node_count(4).select{|g| g.edges.count == 2}
+      ).map(&:to_s)
+      expect(graphs).to eq [
+        "{ 1 needs:[] feeds:[]; 2 needs:[4] feeds:[]; 3 needs:[4] feeds:[]; 4 needs:[] feeds:[2,3] }",
+        "{ 1 needs:[] feeds:[]; 2 needs:[4] feeds:[]; 3 needs:[] feeds:[4]; 4 needs:[3] feeds:[2] }",
+        "{ 1 needs:[] feeds:[]; 2 needs:[] feeds:[4]; 3 needs:[] feeds:[4]; 4 needs:[2,3] feeds:[] }",
+        "{ 1 needs:[4] feeds:[]; 2 needs:[3] feeds:[]; 3 needs:[] feeds:[2]; 4 needs:[] feeds:[1] }",
+      ]
+    end
+
+    it "find acyclic graphs with 4 nodes and 3 edges" do
+      graphs = Topiary::DirectedGraph.topologically_distinct(
+        Topiary::DirectedGraph.acyclic_from_node_count(4).select{|g| g.edges.count == 3}
+      ).map(&:to_s)
+      expect(graphs).to eq [
+        "{ 1 needs:[] feeds:[]; 2 needs:[3,4] feeds:[]; 3 needs:[4] feeds:[2]; 4 needs:[] feeds:[2,3] }",
+        "{ 1 needs:[4] feeds:[]; 2 needs:[4] feeds:[]; 3 needs:[4] feeds:[]; 4 needs:[] feeds:[1,2,3] }",
+        "{ 1 needs:[4] feeds:[]; 2 needs:[4] feeds:[]; 3 needs:[] feeds:[4]; 4 needs:[3] feeds:[1,2] }",
+
+        "{ 1 needs:[4] feeds:[]; 2 needs:[] feeds:[4]; 3 needs:[] feeds:[4]; 4 needs:[2,3] feeds:[1] }",
+        "{ 1 needs:[4] feeds:[]; 2 needs:[3] feeds:[]; 3 needs:[4] feeds:[2]; 4 needs:[] feeds:[1,3] }",
+        "{ 1 needs:[4] feeds:[]; 2 needs:[3,4] feeds:[]; 3 needs:[] feeds:[2]; 4 needs:[] feeds:[1,2] }",
+
+        "{ 1 needs:[4] feeds:[]; 2 needs:[3] feeds:[4]; 3 needs:[] feeds:[2]; 4 needs:[2] feeds:[1] }",
+        "{ 1 needs:[] feeds:[4]; 2 needs:[] feeds:[4]; 3 needs:[] feeds:[4]; 4 needs:[1,2,3] feeds:[] }",
+        "{ 1 needs:[] feeds:[4]; 2 needs:[3,4] feeds:[]; 3 needs:[] feeds:[2]; 4 needs:[1] feeds:[2] }",
+      ]
+    end
+
+    it "find acyclic graphs with 4 nodes and 4 edges" do
+      graphs = Topiary::DirectedGraph.topologically_distinct(
+        Topiary::DirectedGraph.acyclic_from_node_count(4).select{|g| g.edges.count == 4}
+      ).map(&:to_s)
+      expect(graphs).to eq [
+        "{ 1 needs:[4] feeds:[]; 2 needs:[3,4] feeds:[]; 3 needs:[4] feeds:[2]; 4 needs:[] feeds:[1,2,3] }",
+        "{ 1 needs:[4] feeds:[]; 2 needs:[3,4] feeds:[]; 3 needs:[] feeds:[2,4]; 4 needs:[3] feeds:[1,2] }",
+        "{ 1 needs:[4] feeds:[]; 2 needs:[3] feeds:[4]; 3 needs:[] feeds:[2,4]; 4 needs:[2,3] feeds:[1] }",
+
+        "{ 1 needs:[] feeds:[4]; 2 needs:[3,4] feeds:[]; 3 needs:[4] feeds:[2]; 4 needs:[1] feeds:[2,3] }",
+        "{ 1 needs:[] feeds:[4]; 2 needs:[3,4] feeds:[]; 3 needs:[] feeds:[2,4]; 4 needs:[1,3] feeds:[2] }",
+        "{ 1 needs:[] feeds:[4]; 2 needs:[3] feeds:[4]; 3 needs:[] feeds:[2,4]; 4 needs:[1,2,3] feeds:[] }",
+
+        "{ 1 needs:[3,4] feeds:[]; 2 needs:[3,4] feeds:[]; 3 needs:[] feeds:[1,2]; 4 needs:[] feeds:[1,2] }",
+        "{ 1 needs:[3,4] feeds:[]; 2 needs:[3] feeds:[4]; 3 needs:[] feeds:[1,2]; 4 needs:[2] feeds:[1] }",
+        "{ 1 needs:[3,4] feeds:[]; 2 needs:[] feeds:[3,4]; 3 needs:[2] feeds:[1]; 4 needs:[2] feeds:[1] }",
+      ]
+    end
+
+    it "find acyclic graphs with 4 nodes and 5 edges" do
+      graphs = Topiary::DirectedGraph.topologically_distinct(
+        Topiary::DirectedGraph.acyclic_from_node_count(4).select{|g| g.edges.count == 5}
+      ).map(&:to_s)
+      expect(graphs).to eq [
+        "{ 1 needs:[3,4] feeds:[]; 2 needs:[3,4] feeds:[]; 3 needs:[4] feeds:[1,2]; 4 needs:[] feeds:[1,2,3] }",
+        "{ 1 needs:[3,4] feeds:[]; 2 needs:[3] feeds:[4]; 3 needs:[] feeds:[1,2,4]; 4 needs:[2,3] feeds:[1] }",
+        "{ 1 needs:[3,4] feeds:[]; 2 needs:[] feeds:[3,4]; 3 needs:[2,4] feeds:[1]; 4 needs:[2] feeds:[1,3] }",
+
+        "{ 1 needs:[3] feeds:[4]; 2 needs:[3] feeds:[4]; 3 needs:[] feeds:[1,2,4]; 4 needs:[1,2,3] feeds:[] }",
+        "{ 1 needs:[3] feeds:[4]; 2 needs:[] feeds:[3,4]; 3 needs:[2] feeds:[1,4]; 4 needs:[1,2,3] feeds:[] }",
+        "{ 1 needs:[] feeds:[3,4]; 2 needs:[] feeds:[3,4]; 3 needs:[1,2,4] feeds:[]; 4 needs:[1,2] feeds:[3] }",
+      ]
+    end
+
+    it "find acyclic graphs with 4 nodes and 6 edges" do
+      graphs = Topiary::DirectedGraph.topologically_distinct(
+        Topiary::DirectedGraph.acyclic_from_node_count(4).select{|g| g.edges.count == 6}
+      ).map(&:to_s)
+      expect(graphs).to eq [
+        "{ 1 needs:[2,3,4] feeds:[]; 2 needs:[3,4] feeds:[1]; 3 needs:[4] feeds:[1,2]; 4 needs:[] feeds:[1,2,3] }",
+      ]
+    end
+
+    it "find acyclic graphs with 4 nodes and 7 edges" do
+      graphs = Topiary::DirectedGraph.topologically_distinct(
+        Topiary::DirectedGraph.acyclic_from_node_count(4).select{|g| g.edges.count == 7}
+      ).map(&:to_s)
+      expect(graphs).to eq []
+    end
+  end
+
+end