topiary 1.0.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA256:
+  metadata.gz: 5f468a68d5866179f012c34af264fbaae48a26f7d342073f91a748ba9c2f0501
+  data.tar.gz: 8ac19a37751a99c69682c978d67eea2bd8c7251b8bc9785be12ee1b49dd26222
+SHA512:
+  metadata.gz: 8990579e8db6bb3e92e56d2000a4c952117c8a1dd33fc93398fa3ed507853208e9daf6339ee6f13b8d83813532d2ef7132629cd246d256b83479f22d6e06f5da
+  data.tar.gz: 35203e65a873d24fa8a70b1666c493b38a302f1c4202847a29f1b0e970104c03f10ce8aadcb1b649f1afb69a3360028ddb24e9a0d036c2b4d61cbad6d26270a1

data/.gitignore

@@ -0,0 +1,8 @@
+.*.swp
+.*.swo
+/.ruby-version
+/.ruby-gemset
+/pkg
+/tmp
+/README.html
+/coverage

data/.rspec

@@ -0,0 +1,2 @@
+--color
+--require spec_helper

data/.rubocop.yml

@@ -0,0 +1,85 @@
+AllCops:
+  Exclude:
+    - "topiary.gemspec"
+    - "vendor/**/*"
+
+Layout/EmptyLinesAroundModuleBody:
+  Enabled: false
+
+Layout/EmptyLinesAroundClassBody:
+  Enabled: false
+
+Layout/EmptyLinesAroundBlockBody:
+  Enabled: false
+
+Layout/SpaceBeforeBlockBraces:
+  Enabled: false
+
+Layout/SpaceInsideBlockBraces:
+  Enabled: false
+
+Layout/SpaceInsideHashLiteralBraces:
+  EnforcedStyle: no_space
+
+Layout/SpaceAroundEqualsInParameterDefault:
+  EnforcedStyle: no_space
+
+Metrics/BlockLength:
+  Exclude:
+    - "spec/**/*"
+  ExcludedMethods: describe
+
+Metrics/AbcSize:
+  Max: 30
+
+Metrics/CyclomaticComplexity:
+  Max: 7
+
+Metrics/LineLength:
+  Max: 120
+
+Metrics/MethodLength:
+  Exclude:
+    - "spec/**/*"
+  Max: 30
+
+Style/AsciiComments:
+  Enabled: false
+
+Style/ClassAndModuleChildren:
+  Enabled: false
+
+Style/StringLiterals:
+  Enabled: false
+
+Style/BlockDelimiters:
+  EnforcedStyle: semantic
+
+Style/Documentation:
+  Exclude:
+    - "spec/**/*"
+
+Style/SafeNavigation:
+  Enabled: false
+
+Style/FrozenStringLiteralComment:
+  Enabled: false
+
+Style/PercentLiteralDelimiters:
+  PreferredDelimiters:
+    "%w": "[]"
+
+Style/NegatedWhile:
+  Enabled: false
+
+Style/Not:
+  Enabled: false
+
+Style/AndOr:
+  Enabled: false
+
+Style/IfUnlessModifier:
+  Enabled: false
+
+Naming/UncommunicativeMethodParamName:
+  Enabled: false

data/.travis.yml

@@ -0,0 +1,9 @@
+language: ruby
+rvm:
+  - 1.9
+  - 2.0
+  - 2.1
+  - 2.2
+  - 2.3
+  - 2.4
+  - jruby

data/.yardopts

@@ -0,0 +1 @@
+--markup markdown

data/Changelog

@@ -0,0 +1,7 @@
+1.0.0
+-----
+
+- Initial release. Lets you construct a DAG and get a topological sort of the
+nodes.
+
+

data/Gemfile

@@ -0,0 +1,3 @@
+source "https://rubygems.org"
+
+gemspec

data/LICENSE.txt

@@ -0,0 +1,20 @@
+Copyright (c) 2018 Paul A. Jungwirth
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+"Software"), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
+LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
+WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

data/README.md

@@ -0,0 +1,60 @@
+topiary
+=======
+
+[![Build Status](https://travis-ci.org/pjungwir/topiary.svg?branch=master)](https://travis-ci.org/pjungwir/topiary)
+
+Topiary provides a topological sort function for a Directed Acyclic Graph (DAG), in Ruby.
+It uses [Kahn's Algorithm](https://en.wikipedia.org/wiki/Directed_acyclic_graph#Topological_sorting_and_recognition)
+which is linear on the number of nodes.
+Ruby 1.9 and up are supported.
+
+![Topologically distinct directed acyclic graphs with four vertices](/marshmallows.jpg)
+
+
+Usage
+-----
+
+First create some nodes as `Topiary::Node` objects,
+including a custom `data` attribute on each node if you want.
+Set up edges by calling `n1.feeds! n2` or `n2.needs! n1`.
+Then when you're ready, pass a list of all the nodes to `Topiary.sort`.
+You'll get back an array containing every node in topological order.
+If you have any questions about using it, take a look at the tests.
+
+
+Tests
+-----
+
+There are lots of RSpec tests.
+Say `rake` to run them plus Rubocop,
+or `rspec spec` to run just the tests.
+
+I tried to test all possible DAGs up to four nodes,
+although since I couldn't find a comprehensive list I just did my best with toothpicks and marshmallows.
+If you find that I skipped something, let me know!
+Anyway, after all these marshmallows I'm pretty sure the sort works. :-)
+
+
+Contributing to topiary
+-----------------------
+ 
+* Check out the latest master to make sure the feature hasn't been implemented or the bug hasn't been fixed yet.
+* Check out the issue tracker to make sure someone hasn't already requested and/or contributed it.
+* Fork the project.
+* Start a feature/bugfix branch.
+* Commit and push until you are happy with your contribution.
+* Make be sure to add tests for it. This is important so I don't break it in a future version unintentionally.
+* Please try not to mess with the Rakefile, version, or history. If you want to have your own version, that is fine, but please isolate that change to its own commit so I can cherry-pick around it.
+
+Commands for building/releasing/installing:
+
+* `rake build`
+* `rake install`
+* `rake release`
+
+Copyright
+---------
+
+Copyright (c) 2018 Paul A. Jungwirth.
+See LICENSE.txt for further details.
+

data/Rakefile

@@ -0,0 +1,13 @@
+require 'bundler/gem_tasks'
+require 'rspec/core/rake_task'
+require 'rubocop/rake_task'
+
+RSpec::Core::RakeTask.new(:spec)
+RuboCop::RakeTask.new
+
+task default: :test
+task test: %w[spec rubocop]
+
+task readme: [] do
+  `markdown README.md >README.html`
+end

data/lib/topiary.rb

@@ -0,0 +1,56 @@
+require 'topiary/version'
+require 'topiary/node'
+require 'set'
+
+# {Topiary} provides a topological sort function for Directed Acyclic Graphs.
+module Topiary
+
+  # Sorts node_list according to Kahn's Algorithm
+  # ([from Wikipedia](https://en.wikipedia.org/wiki/Topological_sorting))
+  # which runs in linear time:
+  #
+  #     L ← Empty list that will contain the sorted elements
+  #     S ← Set of all nodes with no incoming edge
+  #     while S is non-empty do
+  #         remove a node n from S
+  #         add n to tail of L
+  #         for each node m with an edge e from n to m do
+  #             remove edge e from the graph
+  #             if m has no other incoming edges then
+  #                 insert m into S
+  #     if graph has edges then
+  #         return error (graph has at least one cycle)
+  #     else
+  #         return L (a topologically sorted order)
+  def self.sort(node_list)
+    l = []
+    s = Set.new(node_list.select{|n| n.needs.empty?})
+
+    node_list.each(&:begin!)
+
+    while not s.empty?
+      n = s.first
+      s.delete n
+      l << n
+      n.feeds.to_a.each do |m|
+        n.feeds.delete m
+        m.needs.delete n
+        if m.needs.empty?
+          s << m
+        end
+      end
+    end
+
+    # 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"
+      end
+    end
+
+    l
+  ensure
+    node_list.each(&:restore!)
+  end
+
+end

data/lib/topiary/node.rb

@@ -0,0 +1,76 @@
+# Represents one vertex or node in your graph.
+#
+# Each node may hold some user-defined data,
+# so you can track what they represent.
+#
+# Nodes also contain a list of "needs" (incoming edges)
+# and "feeds" (outgoing edges).
+# You may pass a list of connected nodes when you instantiate one,
+# but usually you'll need to make your objects first
+# and then add their needs/feeds.
+# (If you didn't have to do that you probably wouldn't need this library, right?)
+#
+# There are mutator methods you can use like this:
+#
+#     n1 = Node.new "n1"
+#     n2 = Node.new "n2"
+#     n1.need! n2
+#
+# That will create an edge pointing from `n2` to `n1`.
+#
+# Once your graph is ready, you can pass the list of nodes to `Topiary.sort`.
+class Topiary::Node
+  attr_reader :data, :needs, :feeds
+
+  def initialize(data=nil, needs=[], feeds=[])
+    @data = data
+    @needs = Set.new needs
+    @feeds = Set.new feeds
+  end
+
+  def begin!
+    @original_needs = @needs
+    @original_feeds = @feeds
+    @needs = @needs.clone
+    @feeds = @feeds.clone
+  end
+
+  # Since the sorting algorithm mutates the edges,
+  # you can call this to restore everything to its original state.
+  # The graph still isn't re-entrant,
+  # but at least it comes back from sorting the same as it entered.
+  def restore!
+    @needs = @original_needs
+    @feeds = @original_feeds
+  end
+
+  def need!(n)
+    @original_needs << n
+    needs << n
+    n.feeds << self
+  end
+
+  def feed!(n)
+    feeds << n
+    n.needs << self
+  end
+
+  def name
+    data && data.to_s || object_id.to_s
+  end
+
+  def to_s
+    [
+      name,
+      "needs:",
+      "[" + needs.map(&:name).join(", ") + "]",
+      "feeds:",
+      "[" + feeds.map(&:name).join(", ") + "]"
+    ].join(" ")
+  end
+
+  def inspect
+    to_s
+  end
+
+end

data/lib/topiary/version.rb

@@ -0,0 +1,3 @@
+module Topiary
+  VERSION = '1.0.0'.freeze
+end

data/spec/spec_helper.rb

@@ -0,0 +1,12 @@
+require 'simplecov'
+SimpleCov.start
+
+$LOAD_PATH.unshift(File.join(File.dirname(__FILE__), '..', 'lib'))
+$LOAD_PATH.unshift(File.dirname(__FILE__))
+require 'rspec'
+require 'rspec/matchers'
+require 'topiary'
+
+RSpec.configure do |config|
+
+end

data/spec/topological_sort_spec.rb

@@ -0,0 +1,1247 @@
+describe Topiary do
+
+  it "sorts an empty graph" do
+    expect(Topiary.sort([])).to eq []
+  end
+
+  it "raises on a one-node cycle" do
+    n = Topiary::Node.new
+    n.feed! n
+    expect {
+      Topiary.sort([n])
+    }.to raise_error "Leftover edges found: this graph has a cycle"
+  end
+
+  it "raises on a two-node cycle" do
+    n1 = Topiary::Node.new
+    n2 = Topiary::Node.new
+    n1.feed! n2
+    n2.feed! n1
+    expect {
+      Topiary.sort([n1, n2])
+    }.to raise_error "Leftover edges found: this graph has a cycle"
+  end
+
+  it "raises on a three-node cycle" do
+    n1 = Topiary::Node.new
+    n2 = Topiary::Node.new
+    n3 = Topiary::Node.new
+    n1.feed! n2
+    n2.feed! n3
+    n3.feed! n1
+    expect {
+      Topiary.sort([n1, n2, n3])
+    }.to raise_error "Leftover edges found: this graph has a cycle"
+  end
+
+  it "sorts a graph of one node" do
+    n = Topiary::Node.new
+    expect(Topiary.sort([n])).to eq [n]
+  end
+
+  it "sorts a graph of two connected nodes" do
+    n1 = Topiary::Node.new "n1"
+    n2 = Topiary::Node.new "n2"
+    n1.feed! n2
+    expect(Topiary.sort([n1, n2])).to eq [n1, n2]
+    expect(Topiary.sort([n2, n1])).to eq [n1, n2]
+  end
+
+  it "sorts a graph of two disconnected nodes" do
+    n1 = Topiary::Node.new "n1"
+    n2 = Topiary::Node.new "n2"
+    expect(Topiary.sort([n1, n2])).to eq [n1, n2]
+    expect(Topiary.sort([n2, n1])).to eq [n2, n1]
+  end
+
+  context "with 3 nodes" do
+    context "and 0 edges" do
+      it "sorts 1 2 3" do
+        n1 = Topiary::Node.new "n1"
+        n2 = Topiary::Node.new "n2"
+        n3 = Topiary::Node.new "n3"
+        expect(Topiary.sort([n1, n2, n3])).to eq [n1, n2, n3]
+        expect(Topiary.sort([n1, n3, n2])).to eq [n1, n3, n2]
+        expect(Topiary.sort([n2, n1, n3])).to eq [n2, n1, n3]
+        expect(Topiary.sort([n2, n3, n1])).to eq [n2, n3, n1]
+        expect(Topiary.sort([n3, n1, n2])).to eq [n3, n1, n2]
+        expect(Topiary.sort([n3, n2, n1])).to eq [n3, n2, n1]
+      end
+    end
+    context "and 1 edge" do
+      it "sorts 1->2 3" do
+        n1 = Topiary::Node.new "n1"
+        n2 = Topiary::Node.new "n2"
+        n3 = Topiary::Node.new "n3"
+        n1.feed! n2
+        expect(Topiary.sort([n1, n2, n3])).to eq [n1, n3, n2]
+        expect(Topiary.sort([n1, n3, n2])).to eq [n1, n3, n2]
+        expect(Topiary.sort([n2, n1, n3])).to eq [n1, n3, n2]
+        expect(Topiary.sort([n2, n3, n1])).to eq [n3, n1, n2]
+        expect(Topiary.sort([n3, n1, n2])).to eq [n3, n1, n2]
+        expect(Topiary.sort([n3, n2, n1])).to eq [n3, n1, n2]
+      end
+    end
+    context "and 2 edges" do
+      it "sorts 1->2->3" do
+        n1 = Topiary::Node.new "n1"
+        n2 = Topiary::Node.new "n2"
+        n3 = Topiary::Node.new "n3"
+        n1.feed! n2
+        n2.feed! n3
+        expect(Topiary.sort([n1, n2, n3])).to eq [n1, n2, n3]
+        expect(Topiary.sort([n1, n3, n2])).to eq [n1, n2, n3]
+        expect(Topiary.sort([n2, n1, n3])).to eq [n1, n2, n3]
+        expect(Topiary.sort([n2, n3, n1])).to eq [n1, n2, n3]
+        expect(Topiary.sort([n3, n1, n2])).to eq [n1, n2, n3]
+        expect(Topiary.sort([n3, n2, n1])).to eq [n1, n2, n3]
+      end
+      it "sorts 1->2<-3" do
+        n1 = Topiary::Node.new "n1"
+        n2 = Topiary::Node.new "n2"
+        n3 = Topiary::Node.new "n3"
+        n1.feed! n2
+        n3.feed! n2
+        expect(Topiary.sort([n1, n2, n3])).to eq [n1, n3, n2]
+        expect(Topiary.sort([n1, n3, n2])).to eq [n1, n3, n2]
+        expect(Topiary.sort([n2, n1, n3])).to eq [n1, n3, n2]
+        expect(Topiary.sort([n2, n3, n1])).to eq [n3, n1, n2]
+        expect(Topiary.sort([n3, n1, n2])).to eq [n3, n1, n2]
+        expect(Topiary.sort([n3, n2, n1])).to eq [n3, n1, n2]
+      end
+      it "sorts 1<-2->3" do
+        n1 = Topiary::Node.new "n1"
+        n2 = Topiary::Node.new "n2"
+        n3 = Topiary::Node.new "n3"
+        n2.feed! n1
+        n2.feed! n3
+        expect(Topiary.sort([n1, n2, n3])).to eq [n2, n1, n3]
+        expect(Topiary.sort([n1, n3, n2])).to eq [n2, n1, n3]
+        expect(Topiary.sort([n2, n1, n3])).to eq [n2, n1, n3]
+        expect(Topiary.sort([n2, n3, n1])).to eq [n2, n1, n3]
+        expect(Topiary.sort([n3, n1, n2])).to eq [n2, n1, n3]
+        expect(Topiary.sort([n3, n2, n1])).to eq [n2, n1, n3]
+      end
+    end
+    context "and 3 edges" do
+      it "sorts 1<-2->3 and 1->3" do
+        n1 = Topiary::Node.new "n1"
+        n2 = Topiary::Node.new "n2"
+        n3 = Topiary::Node.new "n3"
+        n2.feed! n1
+        n2.feed! n3
+        n1.feed! n3
+        expect(Topiary.sort([n1, n2, n3])).to eq [n2, n1, n3]
+        expect(Topiary.sort([n1, n3, n2])).to eq [n2, n1, n3]
+        expect(Topiary.sort([n2, n1, n3])).to eq [n2, n1, n3]
+        expect(Topiary.sort([n2, n3, n1])).to eq [n2, n1, n3]
+        expect(Topiary.sort([n3, n1, n2])).to eq [n2, n1, n3]
+        expect(Topiary.sort([n3, n2, n1])).to eq [n2, n1, n3]
+      end
+    end
+  end
+
+  context "with 4 nodes" do
+    context "and 0 edges" do
+      it "sorts 1 2 3 4" do
+        n1 = Topiary::Node.new "n1"
+        n2 = Topiary::Node.new "n2"
+        n3 = Topiary::Node.new "n3"
+        n4 = Topiary::Node.new "n4"
+        expect(Topiary.sort([n1, n2, n3, n4])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n1, n2, n4, n3])).to eq [n1, n2, n4, n3]
+        expect(Topiary.sort([n1, n3, n2, n4])).to eq [n1, n3, n2, n4]
+        expect(Topiary.sort([n1, n3, n4, n2])).to eq [n1, n3, n4, n2]
+        expect(Topiary.sort([n1, n4, n2, n3])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n1, n4, n3, n2])).to eq [n1, n4, n3, n2]
+        expect(Topiary.sort([n2, n1, n3, n4])).to eq [n2, n1, n3, n4]
+        expect(Topiary.sort([n2, n1, n4, n3])).to eq [n2, n1, n4, n3]
+        expect(Topiary.sort([n2, n3, n1, n4])).to eq [n2, n3, n1, n4]
+        expect(Topiary.sort([n2, n3, n4, n1])).to eq [n2, n3, n4, n1]
+        expect(Topiary.sort([n2, n4, n1, n3])).to eq [n2, n4, n1, n3]
+        expect(Topiary.sort([n2, n4, n3, n1])).to eq [n2, n4, n3, n1]
+        expect(Topiary.sort([n3, n1, n2, n4])).to eq [n3, n1, n2, n4]
+        expect(Topiary.sort([n3, n1, n4, n2])).to eq [n3, n1, n4, n2]
+        expect(Topiary.sort([n3, n2, n1, n4])).to eq [n3, n2, n1, n4]
+        expect(Topiary.sort([n3, n2, n4, n1])).to eq [n3, n2, n4, n1]
+        expect(Topiary.sort([n3, n4, n1, n2])).to eq [n3, n4, n1, n2]
+        expect(Topiary.sort([n3, n4, n2, n1])).to eq [n3, n4, n2, n1]
+        expect(Topiary.sort([n4, n1, n2, n3])).to eq [n4, n1, n2, n3]
+        expect(Topiary.sort([n4, n1, n3, n2])).to eq [n4, n1, n3, n2]
+        expect(Topiary.sort([n4, n2, n1, n3])).to eq [n4, n2, n1, n3]
+        expect(Topiary.sort([n4, n2, n3, n1])).to eq [n4, n2, n3, n1]
+        expect(Topiary.sort([n4, n3, n1, n2])).to eq [n4, n3, n1, n2]
+        expect(Topiary.sort([n4, n3, n2, n1])).to eq [n4, n3, n2, n1]
+      end
+    end
+
+    context "and 1 edge" do
+      it "sorts 1->2  3  4" do
+        n1 = Topiary::Node.new "n1"
+        n2 = Topiary::Node.new "n2"
+        n3 = Topiary::Node.new "n3"
+        n4 = Topiary::Node.new "n4"
+        n1.feed! n2
+        expect(Topiary.sort([n1, n2, n3, n4])).to eq [n1, n3, n4, n2]
+        expect(Topiary.sort([n1, n2, n4, n3])).to eq [n1, n4, n3, n2]
+        expect(Topiary.sort([n1, n3, n2, n4])).to eq [n1, n3, n4, n2]
+        expect(Topiary.sort([n1, n3, n4, n2])).to eq [n1, n3, n4, n2]
+        expect(Topiary.sort([n1, n4, n2, n3])).to eq [n1, n4, n3, n2]
+        expect(Topiary.sort([n1, n4, n3, n2])).to eq [n1, n4, n3, n2]
+        expect(Topiary.sort([n2, n1, n3, n4])).to eq [n1, n3, n4, n2]
+        expect(Topiary.sort([n2, n1, n4, n3])).to eq [n1, n4, n3, n2]
+        expect(Topiary.sort([n2, n3, n1, n4])).to eq [n3, n1, n4, n2]
+        expect(Topiary.sort([n2, n3, n4, n1])).to eq [n3, n4, n1, n2]
+        expect(Topiary.sort([n2, n4, n1, n3])).to eq [n4, n1, n3, n2]
+        expect(Topiary.sort([n2, n4, n3, n1])).to eq [n4, n3, n1, n2]
+        expect(Topiary.sort([n3, n1, n2, n4])).to eq [n3, n1, n4, n2]
+        expect(Topiary.sort([n3, n1, n4, n2])).to eq [n3, n1, n4, n2]
+        expect(Topiary.sort([n3, n2, n1, n4])).to eq [n3, n1, n4, n2]
+        expect(Topiary.sort([n3, n2, n4, n1])).to eq [n3, n4, n1, n2]
+        expect(Topiary.sort([n3, n4, n1, n2])).to eq [n3, n4, n1, n2]
+        expect(Topiary.sort([n3, n4, n2, n1])).to eq [n3, n4, n1, n2]
+        expect(Topiary.sort([n4, n1, n2, n3])).to eq [n4, n1, n3, n2]
+        expect(Topiary.sort([n4, n1, n3, n2])).to eq [n4, n1, n3, n2]
+        expect(Topiary.sort([n4, n2, n1, n3])).to eq [n4, n1, n3, n2]
+        expect(Topiary.sort([n4, n2, n3, n1])).to eq [n4, n3, n1, n2]
+        expect(Topiary.sort([n4, n3, n1, n2])).to eq [n4, n3, n1, n2]
+        expect(Topiary.sort([n4, n3, n2, n1])).to eq [n4, n3, n1, n2]
+      end
+    end
+
+    context "and 2 edges" do
+      it "sorts 1->2  3->4" do
+        n1 = Topiary::Node.new "n1"
+        n2 = Topiary::Node.new "n2"
+        n3 = Topiary::Node.new "n3"
+        n4 = Topiary::Node.new "n4"
+        n1.feed! n2
+        n3.feed! n4
+        expect(Topiary.sort([n1, n2, n3, n4])).to eq [n1, n3, n2, n4]
+        expect(Topiary.sort([n1, n2, n4, n3])).to eq [n1, n3, n2, n4]
+        expect(Topiary.sort([n1, n3, n2, n4])).to eq [n1, n3, n2, n4]
+        expect(Topiary.sort([n1, n3, n4, n2])).to eq [n1, n3, n2, n4]
+        expect(Topiary.sort([n1, n4, n2, n3])).to eq [n1, n3, n2, n4]
+        expect(Topiary.sort([n1, n4, n3, n2])).to eq [n1, n3, n2, n4]
+        expect(Topiary.sort([n2, n1, n3, n4])).to eq [n1, n3, n2, n4]
+        expect(Topiary.sort([n2, n1, n4, n3])).to eq [n1, n3, n2, n4]
+        expect(Topiary.sort([n2, n3, n1, n4])).to eq [n3, n1, n4, n2]
+        expect(Topiary.sort([n2, n3, n4, n1])).to eq [n3, n1, n4, n2]
+        expect(Topiary.sort([n2, n4, n1, n3])).to eq [n1, n3, n2, n4]
+        expect(Topiary.sort([n2, n4, n3, n1])).to eq [n3, n1, n4, n2]
+        expect(Topiary.sort([n3, n1, n2, n4])).to eq [n3, n1, n4, n2]
+        expect(Topiary.sort([n3, n1, n4, n2])).to eq [n3, n1, n4, n2]
+        expect(Topiary.sort([n3, n2, n1, n4])).to eq [n3, n1, n4, n2]
+        expect(Topiary.sort([n3, n2, n4, n1])).to eq [n3, n1, n4, n2]
+        expect(Topiary.sort([n3, n4, n1, n2])).to eq [n3, n1, n4, n2]
+        expect(Topiary.sort([n3, n4, n2, n1])).to eq [n3, n1, n4, n2]
+        expect(Topiary.sort([n4, n1, n2, n3])).to eq [n1, n3, n2, n4]
+        expect(Topiary.sort([n4, n1, n3, n2])).to eq [n1, n3, n2, n4]
+        expect(Topiary.sort([n4, n2, n1, n3])).to eq [n1, n3, n2, n4]
+        expect(Topiary.sort([n4, n2, n3, n1])).to eq [n3, n1, n4, n2]
+        expect(Topiary.sort([n4, n3, n1, n2])).to eq [n3, n1, n4, n2]
+        expect(Topiary.sort([n4, n3, n2, n1])).to eq [n3, n1, n4, n2]
+      end
+      it "sorts 1->2->3  4" do
+        n1 = Topiary::Node.new "n1"
+        n2 = Topiary::Node.new "n2"
+        n3 = Topiary::Node.new "n3"
+        n4 = Topiary::Node.new "n4"
+        n1.feed! n2
+        n2.feed! n3
+        expect(Topiary.sort([n1, n2, n3, n4])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n1, n2, n4, n3])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n1, n3, n2, n4])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n1, n3, n4, n2])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n1, n4, n2, n3])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n1, n4, n3, n2])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n2, n1, n3, n4])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n2, n1, n4, n3])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n2, n3, n1, n4])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n2, n3, n4, n1])).to eq [n4, n1, n2, n3]
+        expect(Topiary.sort([n2, n4, n1, n3])).to eq [n4, n1, n2, n3]
+        expect(Topiary.sort([n2, n4, n3, n1])).to eq [n4, n1, n2, n3]
+        expect(Topiary.sort([n3, n1, n2, n4])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n3, n1, n4, n2])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n3, n2, n1, n4])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n3, n2, n4, n1])).to eq [n4, n1, n2, n3]
+        expect(Topiary.sort([n3, n4, n1, n2])).to eq [n4, n1, n2, n3]
+        expect(Topiary.sort([n3, n4, n2, n1])).to eq [n4, n1, n2, n3]
+        expect(Topiary.sort([n4, n1, n2, n3])).to eq [n4, n1, n2, n3]
+        expect(Topiary.sort([n4, n1, n3, n2])).to eq [n4, n1, n2, n3]
+        expect(Topiary.sort([n4, n2, n1, n3])).to eq [n4, n1, n2, n3]
+        expect(Topiary.sort([n4, n2, n3, n1])).to eq [n4, n1, n2, n3]
+        expect(Topiary.sort([n4, n3, n1, n2])).to eq [n4, n1, n2, n3]
+        expect(Topiary.sort([n4, n3, n2, n1])).to eq [n4, n1, n2, n3]
+      end
+      it "sorts 1->2<-3  4" do
+        n1 = Topiary::Node.new "n1"
+        n2 = Topiary::Node.new "n2"
+        n3 = Topiary::Node.new "n3"
+        n4 = Topiary::Node.new "n4"
+        n1.feed! n2
+        n3.feed! n2
+        expect(Topiary.sort([n1, n2, n3, n4])).to eq [n1, n3, n4, n2]
+        expect(Topiary.sort([n1, n2, n4, n3])).to eq [n1, n4, n3, n2]
+        expect(Topiary.sort([n1, n3, n2, n4])).to eq [n1, n3, n4, n2]
+        expect(Topiary.sort([n1, n3, n4, n2])).to eq [n1, n3, n4, n2]
+        expect(Topiary.sort([n1, n4, n2, n3])).to eq [n1, n4, n3, n2]
+        expect(Topiary.sort([n1, n4, n3, n2])).to eq [n1, n4, n3, n2]
+        expect(Topiary.sort([n2, n1, n3, n4])).to eq [n1, n3, n4, n2]
+        expect(Topiary.sort([n2, n1, n4, n3])).to eq [n1, n4, n3, n2]
+        expect(Topiary.sort([n2, n3, n1, n4])).to eq [n3, n1, n4, n2]
+        expect(Topiary.sort([n2, n3, n4, n1])).to eq [n3, n4, n1, n2]
+        expect(Topiary.sort([n2, n4, n1, n3])).to eq [n4, n1, n3, n2]
+        expect(Topiary.sort([n2, n4, n3, n1])).to eq [n4, n3, n1, n2]
+        expect(Topiary.sort([n3, n1, n2, n4])).to eq [n3, n1, n4, n2]
+        expect(Topiary.sort([n3, n1, n4, n2])).to eq [n3, n1, n4, n2]
+        expect(Topiary.sort([n3, n2, n1, n4])).to eq [n3, n1, n4, n2]
+        expect(Topiary.sort([n3, n2, n4, n1])).to eq [n3, n4, n1, n2]
+        expect(Topiary.sort([n3, n4, n1, n2])).to eq [n3, n4, n1, n2]
+        expect(Topiary.sort([n3, n4, n2, n1])).to eq [n3, n4, n1, n2]
+        expect(Topiary.sort([n4, n1, n2, n3])).to eq [n4, n1, n3, n2]
+        expect(Topiary.sort([n4, n1, n3, n2])).to eq [n4, n1, n3, n2]
+        expect(Topiary.sort([n4, n2, n1, n3])).to eq [n4, n1, n3, n2]
+        expect(Topiary.sort([n4, n2, n3, n1])).to eq [n4, n3, n1, n2]
+        expect(Topiary.sort([n4, n3, n1, n2])).to eq [n4, n3, n1, n2]
+        expect(Topiary.sort([n4, n3, n2, n1])).to eq [n4, n3, n1, n2]
+      end
+      it "sorts 1<-2->3  4" do
+        n1 = Topiary::Node.new "n1"
+        n2 = Topiary::Node.new "n2"
+        n3 = Topiary::Node.new "n3"
+        n4 = Topiary::Node.new "n4"
+        n2.feed! n1
+        n2.feed! n3
+        expect(Topiary.sort([n1, n2, n3, n4])).to eq [n2, n4, n1, n3]
+        expect(Topiary.sort([n1, n2, n4, n3])).to eq [n2, n4, n1, n3]
+        expect(Topiary.sort([n1, n3, n2, n4])).to eq [n2, n4, n1, n3]
+        expect(Topiary.sort([n1, n3, n4, n2])).to eq [n4, n2, n1, n3]
+        expect(Topiary.sort([n1, n4, n2, n3])).to eq [n4, n2, n1, n3]
+        expect(Topiary.sort([n1, n4, n3, n2])).to eq [n4, n2, n1, n3]
+        expect(Topiary.sort([n2, n1, n3, n4])).to eq [n2, n4, n1, n3]
+        expect(Topiary.sort([n2, n1, n4, n3])).to eq [n2, n4, n1, n3]
+        expect(Topiary.sort([n2, n3, n1, n4])).to eq [n2, n4, n1, n3]
+        expect(Topiary.sort([n2, n3, n4, n1])).to eq [n2, n4, n1, n3]
+        expect(Topiary.sort([n2, n4, n1, n3])).to eq [n2, n4, n1, n3]
+        expect(Topiary.sort([n2, n4, n3, n1])).to eq [n2, n4, n1, n3]
+        expect(Topiary.sort([n3, n1, n2, n4])).to eq [n2, n4, n1, n3]
+        expect(Topiary.sort([n3, n1, n4, n2])).to eq [n4, n2, n1, n3]
+        expect(Topiary.sort([n3, n2, n1, n4])).to eq [n2, n4, n1, n3]
+        expect(Topiary.sort([n3, n2, n4, n1])).to eq [n2, n4, n1, n3]
+        expect(Topiary.sort([n3, n4, n1, n2])).to eq [n4, n2, n1, n3]
+        expect(Topiary.sort([n3, n4, n2, n1])).to eq [n4, n2, n1, n3]
+        expect(Topiary.sort([n4, n1, n2, n3])).to eq [n4, n2, n1, n3]
+        expect(Topiary.sort([n4, n1, n3, n2])).to eq [n4, n2, n1, n3]
+        expect(Topiary.sort([n4, n2, n1, n3])).to eq [n4, n2, n1, n3]
+        expect(Topiary.sort([n4, n2, n3, n1])).to eq [n4, n2, n1, n3]
+        expect(Topiary.sort([n4, n3, n1, n2])).to eq [n4, n2, n1, n3]
+        expect(Topiary.sort([n4, n3, n2, n1])).to eq [n4, n2, n1, n3]
+      end
+    end
+
+    context "and 3 edges" do
+      # four-in-a-row:
+      it "sorts 1->2->3->4" do
+        n1 = Topiary::Node.new "n1"
+        n2 = Topiary::Node.new "n2"
+        n3 = Topiary::Node.new "n3"
+        n4 = Topiary::Node.new "n4"
+        n1.feed! n2
+        n2.feed! n3
+        n3.feed! n4
+        expect(Topiary.sort([n1, n2, n3, n4])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n1, n2, n4, n3])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n1, n3, n2, n4])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n1, n3, n4, n2])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n1, n4, n2, n3])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n1, n4, n3, n2])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n2, n1, n3, n4])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n2, n1, n4, n3])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n2, n3, n1, n4])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n2, n3, n4, n1])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n2, n4, n1, n3])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n2, n4, n3, n1])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n3, n1, n2, n4])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n3, n1, n4, n2])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n3, n2, n1, n4])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n3, n2, n4, n1])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n3, n4, n1, n2])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n3, n4, n2, n1])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n4, n1, n2, n3])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n4, n1, n3, n2])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n4, n2, n1, n3])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n4, n2, n3, n1])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n4, n3, n1, n2])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n4, n3, n2, n1])).to eq [n1, n2, n3, n4]
+      end
+      it "sorts 1->2->3<-4" do
+        n1 = Topiary::Node.new "n1"
+        n2 = Topiary::Node.new "n2"
+        n3 = Topiary::Node.new "n3"
+        n4 = Topiary::Node.new "n4"
+        n1.feed! n2
+        n2.feed! n3
+        n4.feed! n3
+        expect(Topiary.sort([n1, n2, n3, n4])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n1, n2, n4, n3])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n1, n3, n2, n4])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n1, n3, n4, n2])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n1, n4, n2, n3])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n1, n4, n3, n2])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n2, n1, n3, n4])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n2, n1, n4, n3])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n2, n3, n1, n4])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n2, n3, n4, n1])).to eq [n4, n1, n2, n3]
+        expect(Topiary.sort([n2, n4, n1, n3])).to eq [n4, n1, n2, n3]
+        expect(Topiary.sort([n2, n4, n3, n1])).to eq [n4, n1, n2, n3]
+        expect(Topiary.sort([n3, n1, n2, n4])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n3, n1, n4, n2])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n3, n2, n1, n4])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n3, n2, n4, n1])).to eq [n4, n1, n2, n3]
+        expect(Topiary.sort([n3, n4, n1, n2])).to eq [n4, n1, n2, n3]
+        expect(Topiary.sort([n3, n4, n2, n1])).to eq [n4, n1, n2, n3]
+        expect(Topiary.sort([n4, n1, n2, n3])).to eq [n4, n1, n2, n3]
+        expect(Topiary.sort([n4, n1, n3, n2])).to eq [n4, n1, n2, n3]
+        expect(Topiary.sort([n4, n2, n1, n3])).to eq [n4, n1, n2, n3]
+        expect(Topiary.sort([n4, n2, n3, n1])).to eq [n4, n1, n2, n3]
+        expect(Topiary.sort([n4, n3, n1, n2])).to eq [n4, n1, n2, n3]
+        expect(Topiary.sort([n4, n3, n2, n1])).to eq [n4, n1, n2, n3]
+      end
+      it "sorts 1->2<-3->4" do
+        n1 = Topiary::Node.new "n1"
+        n2 = Topiary::Node.new "n2"
+        n3 = Topiary::Node.new "n3"
+        n4 = Topiary::Node.new "n4"
+        n1.feed! n2
+        n3.feed! n2
+        n3.feed! n4
+        expect(Topiary.sort([n1, n2, n3, n4])).to eq [n1, n3, n2, n4]
+        expect(Topiary.sort([n1, n2, n4, n3])).to eq [n1, n3, n2, n4]
+        expect(Topiary.sort([n1, n3, n2, n4])).to eq [n1, n3, n2, n4]
+        expect(Topiary.sort([n1, n3, n4, n2])).to eq [n1, n3, n2, n4]
+        expect(Topiary.sort([n1, n4, n2, n3])).to eq [n1, n3, n2, n4]
+        expect(Topiary.sort([n1, n4, n3, n2])).to eq [n1, n3, n2, n4]
+        expect(Topiary.sort([n2, n1, n3, n4])).to eq [n1, n3, n2, n4]
+        expect(Topiary.sort([n2, n1, n4, n3])).to eq [n1, n3, n2, n4]
+        expect(Topiary.sort([n2, n3, n1, n4])).to eq [n3, n1, n4, n2]
+        expect(Topiary.sort([n2, n3, n4, n1])).to eq [n3, n1, n4, n2]
+        expect(Topiary.sort([n2, n4, n1, n3])).to eq [n1, n3, n2, n4]
+        expect(Topiary.sort([n2, n4, n3, n1])).to eq [n3, n1, n4, n2]
+        expect(Topiary.sort([n3, n1, n2, n4])).to eq [n3, n1, n4, n2]
+        expect(Topiary.sort([n3, n1, n4, n2])).to eq [n3, n1, n4, n2]
+        expect(Topiary.sort([n3, n2, n1, n4])).to eq [n3, n1, n4, n2]
+        expect(Topiary.sort([n3, n2, n4, n1])).to eq [n3, n1, n4, n2]
+        expect(Topiary.sort([n3, n4, n1, n2])).to eq [n3, n1, n4, n2]
+        expect(Topiary.sort([n3, n4, n2, n1])).to eq [n3, n1, n4, n2]
+        expect(Topiary.sort([n4, n1, n2, n3])).to eq [n1, n3, n2, n4]
+        expect(Topiary.sort([n4, n1, n3, n2])).to eq [n1, n3, n2, n4]
+        expect(Topiary.sort([n4, n2, n1, n3])).to eq [n1, n3, n2, n4]
+        expect(Topiary.sort([n4, n2, n3, n1])).to eq [n3, n1, n4, n2]
+        expect(Topiary.sort([n4, n3, n1, n2])).to eq [n3, n1, n4, n2]
+        expect(Topiary.sort([n4, n3, n2, n1])).to eq [n3, n1, n4, n2]
+      end
+      it "sorts 1<-2->3->4" do
+        n1 = Topiary::Node.new "n1"
+        n2 = Topiary::Node.new "n2"
+        n3 = Topiary::Node.new "n3"
+        n4 = Topiary::Node.new "n4"
+        n2.feed! n1
+        n2.feed! n3
+        n3.feed! n4
+        expect(Topiary.sort([n1, n2, n3, n4])).to eq [n2, n1, n3, n4]
+        expect(Topiary.sort([n1, n2, n4, n3])).to eq [n2, n1, n3, n4]
+        expect(Topiary.sort([n1, n3, n2, n4])).to eq [n2, n1, n3, n4]
+        expect(Topiary.sort([n1, n3, n4, n2])).to eq [n2, n1, n3, n4]
+        expect(Topiary.sort([n1, n4, n2, n3])).to eq [n2, n1, n3, n4]
+        expect(Topiary.sort([n1, n4, n3, n2])).to eq [n2, n1, n3, n4]
+        expect(Topiary.sort([n2, n1, n3, n4])).to eq [n2, n1, n3, n4]
+        expect(Topiary.sort([n2, n1, n4, n3])).to eq [n2, n1, n3, n4]
+        expect(Topiary.sort([n2, n3, n1, n4])).to eq [n2, n1, n3, n4]
+        expect(Topiary.sort([n2, n3, n4, n1])).to eq [n2, n1, n3, n4]
+        expect(Topiary.sort([n2, n4, n1, n3])).to eq [n2, n1, n3, n4]
+        expect(Topiary.sort([n2, n4, n3, n1])).to eq [n2, n1, n3, n4]
+        expect(Topiary.sort([n3, n1, n2, n4])).to eq [n2, n1, n3, n4]
+        expect(Topiary.sort([n3, n1, n4, n2])).to eq [n2, n1, n3, n4]
+        expect(Topiary.sort([n3, n2, n1, n4])).to eq [n2, n1, n3, n4]
+        expect(Topiary.sort([n3, n2, n4, n1])).to eq [n2, n1, n3, n4]
+        expect(Topiary.sort([n3, n4, n1, n2])).to eq [n2, n1, n3, n4]
+        expect(Topiary.sort([n3, n4, n2, n1])).to eq [n2, n1, n3, n4]
+        expect(Topiary.sort([n4, n1, n2, n3])).to eq [n2, n1, n3, n4]
+        expect(Topiary.sort([n4, n1, n3, n2])).to eq [n2, n1, n3, n4]
+        expect(Topiary.sort([n4, n2, n1, n3])).to eq [n2, n1, n3, n4]
+        expect(Topiary.sort([n4, n2, n3, n1])).to eq [n2, n1, n3, n4]
+        expect(Topiary.sort([n4, n3, n1, n2])).to eq [n2, n1, n3, n4]
+        expect(Topiary.sort([n4, n3, n2, n1])).to eq [n2, n1, n3, n4]
+      end
+      # triangle:
+      it "sorts 1->2->3  1->3  4" do
+        n1 = Topiary::Node.new "n1"
+        n2 = Topiary::Node.new "n2"
+        n3 = Topiary::Node.new "n3"
+        n4 = Topiary::Node.new "n4"
+        n1.feed! n2
+        n2.feed! n3
+        n1.feed! n3
+        expect(Topiary.sort([n1, n2, n3, n4])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n1, n2, n4, n3])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n1, n3, n2, n4])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n1, n3, n4, n2])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n1, n4, n2, n3])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n1, n4, n3, n2])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n2, n1, n3, n4])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n2, n1, n4, n3])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n2, n3, n1, n4])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n2, n3, n4, n1])).to eq [n4, n1, n2, n3]
+        expect(Topiary.sort([n2, n4, n1, n3])).to eq [n4, n1, n2, n3]
+        expect(Topiary.sort([n2, n4, n3, n1])).to eq [n4, n1, n2, n3]
+        expect(Topiary.sort([n3, n1, n2, n4])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n3, n1, n4, n2])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n3, n2, n1, n4])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n3, n2, n4, n1])).to eq [n4, n1, n2, n3]
+        expect(Topiary.sort([n3, n4, n1, n2])).to eq [n4, n1, n2, n3]
+        expect(Topiary.sort([n3, n4, n2, n1])).to eq [n4, n1, n2, n3]
+        expect(Topiary.sort([n4, n1, n2, n3])).to eq [n4, n1, n2, n3]
+        expect(Topiary.sort([n4, n1, n3, n2])).to eq [n4, n1, n2, n3]
+        expect(Topiary.sort([n4, n2, n1, n3])).to eq [n4, n1, n2, n3]
+        expect(Topiary.sort([n4, n2, n3, n1])).to eq [n4, n1, n2, n3]
+        expect(Topiary.sort([n4, n3, n1, n2])).to eq [n4, n1, n2, n3]
+        expect(Topiary.sort([n4, n3, n2, n1])).to eq [n4, n1, n2, n3]
+      end
+      # stars:
+      it "sorts 1->2->3  4->2" do
+        n1 = Topiary::Node.new "n1"
+        n2 = Topiary::Node.new "n2"
+        n3 = Topiary::Node.new "n3"
+        n4 = Topiary::Node.new "n4"
+        n1.feed! n2
+        n2.feed! n3
+        n1.feed! n2
+        expect(Topiary.sort([n1, n2, n3, n4])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n1, n2, n4, n3])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n1, n3, n2, n4])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n1, n3, n4, n2])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n1, n4, n2, n3])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n1, n4, n3, n2])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n2, n1, n3, n4])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n2, n1, n4, n3])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n2, n3, n1, n4])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n2, n3, n4, n1])).to eq [n4, n1, n2, n3]
+        expect(Topiary.sort([n2, n4, n1, n3])).to eq [n4, n1, n2, n3]
+        expect(Topiary.sort([n2, n4, n3, n1])).to eq [n4, n1, n2, n3]
+        expect(Topiary.sort([n3, n1, n2, n4])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n3, n1, n4, n2])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n3, n2, n1, n4])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n3, n2, n4, n1])).to eq [n4, n1, n2, n3]
+        expect(Topiary.sort([n3, n4, n1, n2])).to eq [n4, n1, n2, n3]
+        expect(Topiary.sort([n3, n4, n2, n1])).to eq [n4, n1, n2, n3]
+        expect(Topiary.sort([n4, n1, n2, n3])).to eq [n4, n1, n2, n3]
+        expect(Topiary.sort([n4, n1, n3, n2])).to eq [n4, n1, n2, n3]
+        expect(Topiary.sort([n4, n2, n1, n3])).to eq [n4, n1, n2, n3]
+        expect(Topiary.sort([n4, n2, n3, n1])).to eq [n4, n1, n2, n3]
+        expect(Topiary.sort([n4, n3, n1, n2])).to eq [n4, n1, n2, n3]
+        expect(Topiary.sort([n4, n3, n2, n1])).to eq [n4, n1, n2, n3]
+      end
+      it "sorts 1->2->3  2->4" do
+        n1 = Topiary::Node.new "n1"
+        n2 = Topiary::Node.new "n2"
+        n3 = Topiary::Node.new "n3"
+        n4 = Topiary::Node.new "n4"
+        n1.feed! n2
+        n2.feed! n3
+        n2.feed! n4
+        expect(Topiary.sort([n1, n2, n3, n4])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n1, n2, n4, n3])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n1, n3, n2, n4])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n1, n3, n4, n2])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n1, n4, n2, n3])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n1, n4, n3, n2])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n2, n1, n3, n4])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n2, n1, n4, n3])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n2, n3, n1, n4])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n2, n3, n4, n1])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n2, n4, n1, n3])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n2, n4, n3, n1])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n3, n1, n2, n4])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n3, n1, n4, n2])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n3, n2, n1, n4])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n3, n2, n4, n1])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n3, n4, n1, n2])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n3, n4, n2, n1])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n4, n1, n2, n3])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n4, n1, n3, n2])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n4, n2, n1, n3])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n4, n2, n3, n1])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n4, n3, n1, n2])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n4, n3, n2, n1])).to eq [n1, n2, n3, n4]
+      end
+      it "sorts 1->2,3,4" do
+        n1 = Topiary::Node.new "n1"
+        n2 = Topiary::Node.new "n2"
+        n3 = Topiary::Node.new "n3"
+        n4 = Topiary::Node.new "n4"
+        n1.feed! n2
+        n1.feed! n3
+        n1.feed! n4
+        expect(Topiary.sort([n1, n2, n3, n4])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n1, n2, n4, n3])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n1, n3, n2, n4])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n1, n3, n4, n2])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n1, n4, n2, n3])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n1, n4, n3, n2])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n2, n1, n3, n4])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n2, n1, n4, n3])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n2, n3, n1, n4])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n2, n3, n4, n1])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n2, n4, n1, n3])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n2, n4, n3, n1])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n3, n1, n2, n4])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n3, n1, n4, n2])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n3, n2, n1, n4])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n3, n2, n4, n1])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n3, n4, n1, n2])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n3, n4, n2, n1])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n4, n1, n2, n3])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n4, n1, n3, n2])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n4, n2, n1, n3])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n4, n2, n3, n1])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n4, n3, n1, n2])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n4, n3, n2, n1])).to eq [n1, n2, n3, n4]
+      end
+      it "sorts 1,2,3->4" do
+        n1 = Topiary::Node.new "n1"
+        n2 = Topiary::Node.new "n2"
+        n3 = Topiary::Node.new "n3"
+        n4 = Topiary::Node.new "n4"
+        n1.feed! n4
+        n2.feed! n4
+        n3.feed! n4
+        expect(Topiary.sort([n1, n2, n3, n4])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n1, n2, n4, n3])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n1, n3, n2, n4])).to eq [n1, n3, n2, n4]
+        expect(Topiary.sort([n1, n3, n4, n2])).to eq [n1, n3, n2, n4]
+        expect(Topiary.sort([n1, n4, n2, n3])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n1, n4, n3, n2])).to eq [n1, n3, n2, n4]
+        expect(Topiary.sort([n2, n1, n3, n4])).to eq [n2, n1, n3, n4]
+        expect(Topiary.sort([n2, n1, n4, n3])).to eq [n2, n1, n3, n4]
+        expect(Topiary.sort([n2, n3, n1, n4])).to eq [n2, n3, n1, n4]
+        expect(Topiary.sort([n2, n3, n4, n1])).to eq [n2, n3, n1, n4]
+        expect(Topiary.sort([n2, n4, n1, n3])).to eq [n2, n1, n3, n4]
+        expect(Topiary.sort([n2, n4, n3, n1])).to eq [n2, n3, n1, n4]
+        expect(Topiary.sort([n3, n1, n2, n4])).to eq [n3, n1, n2, n4]
+        expect(Topiary.sort([n3, n1, n4, n2])).to eq [n3, n1, n2, n4]
+        expect(Topiary.sort([n3, n2, n1, n4])).to eq [n3, n2, n1, n4]
+        expect(Topiary.sort([n3, n2, n4, n1])).to eq [n3, n2, n1, n4]
+        expect(Topiary.sort([n3, n4, n1, n2])).to eq [n3, n1, n2, n4]
+        expect(Topiary.sort([n3, n4, n2, n1])).to eq [n3, n2, n1, n4]
+        expect(Topiary.sort([n4, n1, n2, n3])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n4, n1, n3, n2])).to eq [n1, n3, n2, n4]
+        expect(Topiary.sort([n4, n2, n1, n3])).to eq [n2, n1, n3, n4]
+        expect(Topiary.sort([n4, n2, n3, n1])).to eq [n2, n3, n1, n4]
+        expect(Topiary.sort([n4, n3, n1, n2])).to eq [n3, n1, n2, n4]
+        expect(Topiary.sort([n4, n3, n2, n1])).to eq [n3, n2, n1, n4]
+      end
+    end
+
+    context "and 4 edges" do
+      # into a triangle
+      it "sorts 1->2  2->3,4  3->4" do
+        n1 = Topiary::Node.new "n1"
+        n2 = Topiary::Node.new "n2"
+        n3 = Topiary::Node.new "n3"
+        n4 = Topiary::Node.new "n4"
+        n1.feed! n2
+        n2.feed! n3
+        n2.feed! n4
+        n3.feed! n4
+        expect(Topiary.sort([n1, n2, n3, n4])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n1, n2, n4, n3])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n1, n3, n2, n4])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n1, n3, n4, n2])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n1, n4, n2, n3])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n1, n4, n3, n2])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n2, n1, n3, n4])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n2, n1, n4, n3])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n2, n3, n1, n4])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n2, n3, n4, n1])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n2, n4, n1, n3])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n2, n4, n3, n1])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n3, n1, n2, n4])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n3, n1, n4, n2])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n3, n2, n1, n4])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n3, n2, n4, n1])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n3, n4, n1, n2])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n3, n4, n2, n1])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n4, n1, n2, n3])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n4, n1, n3, n2])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n4, n2, n1, n3])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n4, n2, n3, n1])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n4, n3, n1, n2])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n4, n3, n2, n1])).to eq [n1, n2, n3, n4]
+      end
+      it "sorts 1->2  2->3  4->2,3" do
+        n1 = Topiary::Node.new "n1"
+        n2 = Topiary::Node.new "n2"
+        n3 = Topiary::Node.new "n3"
+        n4 = Topiary::Node.new "n4"
+        n1.feed! n2
+        n2.feed! n3
+        n4.feed! n2
+        n4.feed! n3
+        expect(Topiary.sort([n1, n2, n3, n4])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n1, n2, n4, n3])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n1, n3, n2, n4])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n1, n3, n4, n2])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n1, n4, n2, n3])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n1, n4, n3, n2])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n2, n1, n3, n4])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n2, n1, n4, n3])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n2, n3, n1, n4])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n2, n3, n4, n1])).to eq [n4, n1, n2, n3]
+        expect(Topiary.sort([n2, n4, n1, n3])).to eq [n4, n1, n2, n3]
+        expect(Topiary.sort([n2, n4, n3, n1])).to eq [n4, n1, n2, n3]
+        expect(Topiary.sort([n3, n1, n2, n4])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n3, n1, n4, n2])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n3, n2, n1, n4])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n3, n2, n4, n1])).to eq [n4, n1, n2, n3]
+        expect(Topiary.sort([n3, n4, n1, n2])).to eq [n4, n1, n2, n3]
+        expect(Topiary.sort([n3, n4, n2, n1])).to eq [n4, n1, n2, n3]
+        expect(Topiary.sort([n4, n1, n2, n3])).to eq [n4, n1, n2, n3]
+        expect(Topiary.sort([n4, n1, n3, n2])).to eq [n4, n1, n2, n3]
+        expect(Topiary.sort([n4, n2, n1, n3])).to eq [n4, n1, n2, n3]
+        expect(Topiary.sort([n4, n2, n3, n1])).to eq [n4, n1, n2, n3]
+        expect(Topiary.sort([n4, n3, n1, n2])).to eq [n4, n1, n2, n3]
+        expect(Topiary.sort([n4, n3, n2, n1])).to eq [n4, n1, n2, n3]
+      end
+      it "sorts 1->2  3,4->2  3->4" do
+        n1 = Topiary::Node.new "n1"
+        n2 = Topiary::Node.new "n2"
+        n3 = Topiary::Node.new "n3"
+        n4 = Topiary::Node.new "n4"
+        n1.feed! n2
+        n3.feed! n2
+        n3.feed! n4
+        n4.feed! n2
+        expect(Topiary.sort([n1, n2, n3, n4])).to eq [n1, n3, n4, n2]
+        expect(Topiary.sort([n1, n2, n4, n3])).to eq [n1, n3, n4, n2]
+        expect(Topiary.sort([n1, n3, n2, n4])).to eq [n1, n3, n4, n2]
+        expect(Topiary.sort([n1, n3, n4, n2])).to eq [n1, n3, n4, n2]
+        expect(Topiary.sort([n1, n4, n2, n3])).to eq [n1, n3, n4, n2]
+        expect(Topiary.sort([n1, n4, n3, n2])).to eq [n1, n3, n4, n2]
+        expect(Topiary.sort([n2, n1, n3, n4])).to eq [n1, n3, n4, n2]
+        expect(Topiary.sort([n2, n1, n4, n3])).to eq [n1, n3, n4, n2]
+        expect(Topiary.sort([n2, n3, n1, n4])).to eq [n3, n1, n4, n2]
+        expect(Topiary.sort([n2, n3, n4, n1])).to eq [n3, n1, n4, n2]
+        expect(Topiary.sort([n2, n4, n1, n3])).to eq [n1, n3, n4, n2]
+        expect(Topiary.sort([n2, n4, n3, n1])).to eq [n3, n1, n4, n2]
+        expect(Topiary.sort([n3, n1, n2, n4])).to eq [n3, n1, n4, n2]
+        expect(Topiary.sort([n3, n1, n4, n2])).to eq [n3, n1, n4, n2]
+        expect(Topiary.sort([n3, n2, n1, n4])).to eq [n3, n1, n4, n2]
+        expect(Topiary.sort([n3, n2, n4, n1])).to eq [n3, n1, n4, n2]
+        expect(Topiary.sort([n3, n4, n1, n2])).to eq [n3, n1, n4, n2]
+        expect(Topiary.sort([n3, n4, n2, n1])).to eq [n3, n1, n4, n2]
+        expect(Topiary.sort([n4, n1, n2, n3])).to eq [n1, n3, n4, n2]
+        expect(Topiary.sort([n4, n1, n3, n2])).to eq [n1, n3, n4, n2]
+        expect(Topiary.sort([n4, n2, n1, n3])).to eq [n1, n3, n4, n2]
+        expect(Topiary.sort([n4, n2, n3, n1])).to eq [n3, n1, n4, n2]
+        expect(Topiary.sort([n4, n3, n1, n2])).to eq [n3, n1, n4, n2]
+        expect(Topiary.sort([n4, n3, n2, n1])).to eq [n3, n1, n4, n2]
+      end
+      # out of a triangle
+      it "sorts 1->2  3->1,2  3->4" do
+        n1 = Topiary::Node.new "n1"
+        n2 = Topiary::Node.new "n2"
+        n3 = Topiary::Node.new "n3"
+        n4 = Topiary::Node.new "n4"
+        n1.feed! n2
+        n3.feed! n1
+        n3.feed! n2
+        n3.feed! n4
+        expect(Topiary.sort([n1, n2, n3, n4])).to eq [n3, n1, n4, n2]
+        expect(Topiary.sort([n1, n2, n4, n3])).to eq [n3, n1, n4, n2]
+        expect(Topiary.sort([n1, n3, n2, n4])).to eq [n3, n1, n4, n2]
+        expect(Topiary.sort([n1, n3, n4, n2])).to eq [n3, n1, n4, n2]
+        expect(Topiary.sort([n1, n4, n2, n3])).to eq [n3, n1, n4, n2]
+        expect(Topiary.sort([n1, n4, n3, n2])).to eq [n3, n1, n4, n2]
+        expect(Topiary.sort([n2, n1, n3, n4])).to eq [n3, n1, n4, n2]
+        expect(Topiary.sort([n2, n1, n4, n3])).to eq [n3, n1, n4, n2]
+        expect(Topiary.sort([n2, n3, n1, n4])).to eq [n3, n1, n4, n2]
+        expect(Topiary.sort([n2, n3, n4, n1])).to eq [n3, n1, n4, n2]
+        expect(Topiary.sort([n2, n4, n1, n3])).to eq [n3, n1, n4, n2]
+        expect(Topiary.sort([n2, n4, n3, n1])).to eq [n3, n1, n4, n2]
+        expect(Topiary.sort([n3, n1, n2, n4])).to eq [n3, n1, n4, n2]
+        expect(Topiary.sort([n3, n1, n4, n2])).to eq [n3, n1, n4, n2]
+        expect(Topiary.sort([n3, n2, n1, n4])).to eq [n3, n1, n4, n2]
+        expect(Topiary.sort([n3, n2, n4, n1])).to eq [n3, n1, n4, n2]
+        expect(Topiary.sort([n3, n4, n1, n2])).to eq [n3, n1, n4, n2]
+        expect(Topiary.sort([n3, n4, n2, n1])).to eq [n3, n1, n4, n2]
+        expect(Topiary.sort([n4, n1, n2, n3])).to eq [n3, n1, n4, n2]
+        expect(Topiary.sort([n4, n1, n3, n2])).to eq [n3, n1, n4, n2]
+        expect(Topiary.sort([n4, n2, n1, n3])).to eq [n3, n1, n4, n2]
+        expect(Topiary.sort([n4, n2, n3, n1])).to eq [n3, n1, n4, n2]
+        expect(Topiary.sort([n4, n3, n1, n2])).to eq [n3, n1, n4, n2]
+        expect(Topiary.sort([n4, n3, n2, n1])).to eq [n3, n1, n4, n2]
+      end
+      it "sorts 1->2,3  3->2  3->4" do
+        n1 = Topiary::Node.new "n1"
+        n2 = Topiary::Node.new "n2"
+        n3 = Topiary::Node.new "n3"
+        n4 = Topiary::Node.new "n4"
+        n1.feed! n2
+        n1.feed! n3
+        n3.feed! n2
+        n3.feed! n4
+        expect(Topiary.sort([n1, n2, n3, n4])).to eq [n1, n3, n2, n4]
+        expect(Topiary.sort([n1, n2, n4, n3])).to eq [n1, n3, n2, n4]
+        expect(Topiary.sort([n1, n3, n2, n4])).to eq [n1, n3, n2, n4]
+        expect(Topiary.sort([n1, n3, n4, n2])).to eq [n1, n3, n2, n4]
+        expect(Topiary.sort([n1, n4, n2, n3])).to eq [n1, n3, n2, n4]
+        expect(Topiary.sort([n1, n4, n3, n2])).to eq [n1, n3, n2, n4]
+        expect(Topiary.sort([n2, n1, n3, n4])).to eq [n1, n3, n2, n4]
+        expect(Topiary.sort([n2, n1, n4, n3])).to eq [n1, n3, n2, n4]
+        expect(Topiary.sort([n2, n3, n1, n4])).to eq [n1, n3, n2, n4]
+        expect(Topiary.sort([n2, n3, n4, n1])).to eq [n1, n3, n2, n4]
+        expect(Topiary.sort([n2, n4, n1, n3])).to eq [n1, n3, n2, n4]
+        expect(Topiary.sort([n2, n4, n3, n1])).to eq [n1, n3, n2, n4]
+        expect(Topiary.sort([n3, n1, n2, n4])).to eq [n1, n3, n2, n4]
+        expect(Topiary.sort([n3, n1, n4, n2])).to eq [n1, n3, n2, n4]
+        expect(Topiary.sort([n3, n2, n1, n4])).to eq [n1, n3, n2, n4]
+        expect(Topiary.sort([n3, n2, n4, n1])).to eq [n1, n3, n2, n4]
+        expect(Topiary.sort([n3, n4, n1, n2])).to eq [n1, n3, n2, n4]
+        expect(Topiary.sort([n3, n4, n2, n1])).to eq [n1, n3, n2, n4]
+        expect(Topiary.sort([n4, n1, n2, n3])).to eq [n1, n3, n2, n4]
+        expect(Topiary.sort([n4, n1, n3, n2])).to eq [n1, n3, n2, n4]
+        expect(Topiary.sort([n4, n2, n1, n3])).to eq [n1, n3, n2, n4]
+        expect(Topiary.sort([n4, n2, n3, n1])).to eq [n1, n3, n2, n4]
+        expect(Topiary.sort([n4, n3, n1, n2])).to eq [n1, n3, n2, n4]
+        expect(Topiary.sort([n4, n3, n2, n1])).to eq [n1, n3, n2, n4]
+      end
+      it "sorts 1->2,3  2->3  3->4" do
+        n1 = Topiary::Node.new "n1"
+        n2 = Topiary::Node.new "n2"
+        n3 = Topiary::Node.new "n3"
+        n4 = Topiary::Node.new "n4"
+        n1.feed! n2
+        n1.feed! n3
+        n2.feed! n3
+        n3.feed! n4
+        expect(Topiary.sort([n1, n2, n3, n4])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n1, n2, n4, n3])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n1, n3, n2, n4])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n1, n3, n4, n2])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n1, n4, n2, n3])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n1, n4, n3, n2])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n2, n1, n3, n4])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n2, n1, n4, n3])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n2, n3, n1, n4])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n2, n3, n4, n1])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n2, n4, n1, n3])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n2, n4, n3, n1])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n3, n1, n2, n4])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n3, n1, n4, n2])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n3, n2, n1, n4])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n3, n2, n4, n1])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n3, n4, n1, n2])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n3, n4, n2, n1])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n4, n1, n2, n3])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n4, n1, n3, n2])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n4, n2, n1, n3])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n4, n2, n3, n1])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n4, n3, n1, n2])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n4, n3, n2, n1])).to eq [n1, n2, n3, n4]
+      end
+      # diamonds
+      it "sorts 1->2->3->4  1->4" do
+        n1 = Topiary::Node.new "n1"
+        n2 = Topiary::Node.new "n2"
+        n3 = Topiary::Node.new "n3"
+        n4 = Topiary::Node.new "n4"
+        n1.feed! n2
+        n2.feed! n3
+        n3.feed! n4
+        n1.feed! n4
+        expect(Topiary.sort([n1, n2, n3, n4])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n1, n2, n4, n3])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n1, n3, n2, n4])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n1, n3, n4, n2])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n1, n4, n2, n3])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n1, n4, n3, n2])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n2, n1, n3, n4])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n2, n1, n4, n3])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n2, n3, n1, n4])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n2, n3, n4, n1])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n2, n4, n1, n3])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n2, n4, n3, n1])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n3, n1, n2, n4])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n3, n1, n4, n2])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n3, n2, n1, n4])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n3, n2, n4, n1])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n3, n4, n1, n2])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n3, n4, n2, n1])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n4, n1, n2, n3])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n4, n1, n3, n2])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n4, n2, n1, n3])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n4, n2, n3, n1])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n4, n3, n1, n2])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n4, n3, n2, n1])).to eq [n1, n2, n3, n4]
+      end
+      it "sorts 1,2->3  1,2->4" do
+        n1 = Topiary::Node.new "n1"
+        n2 = Topiary::Node.new "n2"
+        n3 = Topiary::Node.new "n3"
+        n4 = Topiary::Node.new "n4"
+        n1.feed! n3
+        n2.feed! n3
+        n1.feed! n4
+        n2.feed! n4
+        expect(Topiary.sort([n1, n2, n3, n4])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n1, n2, n4, n3])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n1, n3, n2, n4])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n1, n3, n4, n2])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n1, n4, n2, n3])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n1, n4, n3, n2])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n2, n1, n3, n4])).to eq [n2, n1, n3, n4]
+        expect(Topiary.sort([n2, n1, n4, n3])).to eq [n2, n1, n3, n4]
+        expect(Topiary.sort([n2, n3, n1, n4])).to eq [n2, n1, n3, n4]
+        expect(Topiary.sort([n2, n3, n4, n1])).to eq [n2, n1, n3, n4]
+        expect(Topiary.sort([n2, n4, n1, n3])).to eq [n2, n1, n3, n4]
+        expect(Topiary.sort([n2, n4, n3, n1])).to eq [n2, n1, n3, n4]
+        expect(Topiary.sort([n3, n1, n2, n4])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n3, n1, n4, n2])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n3, n2, n1, n4])).to eq [n2, n1, n3, n4]
+        expect(Topiary.sort([n3, n2, n4, n1])).to eq [n2, n1, n3, n4]
+        expect(Topiary.sort([n3, n4, n1, n2])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n3, n4, n2, n1])).to eq [n2, n1, n3, n4]
+        expect(Topiary.sort([n4, n1, n2, n3])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n4, n1, n3, n2])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n4, n2, n1, n3])).to eq [n2, n1, n3, n4]
+        expect(Topiary.sort([n4, n2, n3, n1])).to eq [n2, n1, n3, n4]
+        expect(Topiary.sort([n4, n3, n1, n2])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n4, n3, n2, n1])).to eq [n2, n1, n3, n4]
+      end
+      it "sorts 1->2->4  1->3->4" do
+        n1 = Topiary::Node.new "n1"
+        n2 = Topiary::Node.new "n2"
+        n3 = Topiary::Node.new "n3"
+        n4 = Topiary::Node.new "n4"
+        n1.feed! n2
+        n2.feed! n4
+        n1.feed! n3
+        n3.feed! n4
+        expect(Topiary.sort([n1, n2, n3, n4])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n1, n2, n4, n3])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n1, n3, n2, n4])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n1, n3, n4, n2])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n1, n4, n2, n3])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n1, n4, n3, n2])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n2, n1, n3, n4])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n2, n1, n4, n3])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n2, n3, n1, n4])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n2, n3, n4, n1])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n2, n4, n1, n3])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n2, n4, n3, n1])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n3, n1, n2, n4])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n3, n1, n4, n2])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n3, n2, n1, n4])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n3, n2, n4, n1])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n3, n4, n1, n2])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n3, n4, n2, n1])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n4, n1, n2, n3])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n4, n1, n3, n2])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n4, n2, n1, n3])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n4, n2, n3, n1])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n4, n3, n1, n2])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n4, n3, n2, n1])).to eq [n1, n2, n3, n4]
+      end
+    end
+
+    context "and 5 edges" do
+      it "sorts 1->4  1->2,3  2,3->4" do
+        n1 = Topiary::Node.new "n1"
+        n2 = Topiary::Node.new "n2"
+        n3 = Topiary::Node.new "n3"
+        n4 = Topiary::Node.new "n4"
+        n1.feed! n4
+        n1.feed! n2
+        n1.feed! n3
+        n2.feed! n4
+        n3.feed! n4
+        expect(Topiary.sort([n1, n2, n3, n4])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n1, n2, n4, n3])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n1, n3, n2, n4])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n1, n3, n4, n2])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n1, n4, n2, n3])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n1, n4, n3, n2])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n2, n1, n3, n4])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n2, n1, n4, n3])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n2, n3, n1, n4])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n2, n3, n4, n1])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n2, n4, n1, n3])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n2, n4, n3, n1])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n3, n1, n2, n4])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n3, n1, n4, n2])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n3, n2, n1, n4])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n3, n2, n4, n1])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n3, n4, n1, n2])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n3, n4, n2, n1])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n4, n1, n2, n3])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n4, n1, n3, n2])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n4, n2, n1, n3])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n4, n2, n3, n1])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n4, n3, n1, n2])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n4, n3, n2, n1])).to eq [n1, n2, n3, n4]
+      end
+      it "sorts 1->4  1->2,3  4->2,3" do
+        n1 = Topiary::Node.new "n1"
+        n2 = Topiary::Node.new "n2"
+        n3 = Topiary::Node.new "n3"
+        n4 = Topiary::Node.new "n4"
+        n1.feed! n4
+        n1.feed! n2
+        n1.feed! n3
+        n4.feed! n2
+        n4.feed! n3
+        expect(Topiary.sort([n1, n2, n3, n4])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n1, n2, n4, n3])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n1, n3, n2, n4])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n1, n3, n4, n2])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n1, n4, n2, n3])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n1, n4, n3, n2])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n2, n1, n3, n4])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n2, n1, n4, n3])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n2, n3, n1, n4])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n2, n3, n4, n1])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n2, n4, n1, n3])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n2, n4, n3, n1])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n3, n1, n2, n4])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n3, n1, n4, n2])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n3, n2, n1, n4])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n3, n2, n4, n1])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n3, n4, n1, n2])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n3, n4, n2, n1])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n4, n1, n2, n3])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n4, n1, n3, n2])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n4, n2, n1, n3])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n4, n2, n3, n1])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n4, n3, n1, n2])).to eq [n1, n4, n2, n3]
+        expect(Topiary.sort([n4, n3, n2, n1])).to eq [n1, n4, n2, n3]
+      end
+      it "sorts 1->4  1->2,3  2->4->3" do
+        n1 = Topiary::Node.new "n1"
+        n2 = Topiary::Node.new "n2"
+        n3 = Topiary::Node.new "n3"
+        n4 = Topiary::Node.new "n4"
+        n1.feed! n4
+        n1.feed! n2
+        n1.feed! n3
+        n2.feed! n4
+        n4.feed! n3
+        expect(Topiary.sort([n1, n2, n3, n4])).to eq [n1, n2, n4, n3]
+        expect(Topiary.sort([n1, n2, n4, n3])).to eq [n1, n2, n4, n3]
+        expect(Topiary.sort([n1, n3, n2, n4])).to eq [n1, n2, n4, n3]
+        expect(Topiary.sort([n1, n3, n4, n2])).to eq [n1, n2, n4, n3]
+        expect(Topiary.sort([n1, n4, n2, n3])).to eq [n1, n2, n4, n3]
+        expect(Topiary.sort([n1, n4, n3, n2])).to eq [n1, n2, n4, n3]
+        expect(Topiary.sort([n2, n1, n3, n4])).to eq [n1, n2, n4, n3]
+        expect(Topiary.sort([n2, n1, n4, n3])).to eq [n1, n2, n4, n3]
+        expect(Topiary.sort([n2, n3, n1, n4])).to eq [n1, n2, n4, n3]
+        expect(Topiary.sort([n2, n3, n4, n1])).to eq [n1, n2, n4, n3]
+        expect(Topiary.sort([n2, n4, n1, n3])).to eq [n1, n2, n4, n3]
+        expect(Topiary.sort([n2, n4, n3, n1])).to eq [n1, n2, n4, n3]
+        expect(Topiary.sort([n3, n1, n2, n4])).to eq [n1, n2, n4, n3]
+        expect(Topiary.sort([n3, n1, n4, n2])).to eq [n1, n2, n4, n3]
+        expect(Topiary.sort([n3, n2, n1, n4])).to eq [n1, n2, n4, n3]
+        expect(Topiary.sort([n3, n2, n4, n1])).to eq [n1, n2, n4, n3]
+        expect(Topiary.sort([n3, n4, n1, n2])).to eq [n1, n2, n4, n3]
+        expect(Topiary.sort([n3, n4, n2, n1])).to eq [n1, n2, n4, n3]
+        expect(Topiary.sort([n4, n1, n2, n3])).to eq [n1, n2, n4, n3]
+        expect(Topiary.sort([n4, n1, n3, n2])).to eq [n1, n2, n4, n3]
+        expect(Topiary.sort([n4, n2, n1, n3])).to eq [n1, n2, n4, n3]
+        expect(Topiary.sort([n4, n2, n3, n1])).to eq [n1, n2, n4, n3]
+        expect(Topiary.sort([n4, n3, n1, n2])).to eq [n1, n2, n4, n3]
+        expect(Topiary.sort([n4, n3, n2, n1])).to eq [n1, n2, n4, n3]
+      end
+      it "sorts 1->4  2->1->3  2->4->3" do
+        n1 = Topiary::Node.new "n1"
+        n2 = Topiary::Node.new "n2"
+        n3 = Topiary::Node.new "n3"
+        n4 = Topiary::Node.new "n4"
+        n1.feed! n4
+        n2.feed! n1
+        n1.feed! n3
+        n2.feed! n4
+        n4.feed! n3
+        expect(Topiary.sort([n1, n2, n3, n4])).to eq [n2, n1, n4, n3]
+        expect(Topiary.sort([n1, n2, n4, n3])).to eq [n2, n1, n4, n3]
+        expect(Topiary.sort([n1, n3, n2, n4])).to eq [n2, n1, n4, n3]
+        expect(Topiary.sort([n1, n3, n4, n2])).to eq [n2, n1, n4, n3]
+        expect(Topiary.sort([n1, n4, n2, n3])).to eq [n2, n1, n4, n3]
+        expect(Topiary.sort([n1, n4, n3, n2])).to eq [n2, n1, n4, n3]
+        expect(Topiary.sort([n2, n1, n3, n4])).to eq [n2, n1, n4, n3]
+        expect(Topiary.sort([n2, n1, n4, n3])).to eq [n2, n1, n4, n3]
+        expect(Topiary.sort([n2, n3, n1, n4])).to eq [n2, n1, n4, n3]
+        expect(Topiary.sort([n2, n3, n4, n1])).to eq [n2, n1, n4, n3]
+        expect(Topiary.sort([n2, n4, n1, n3])).to eq [n2, n1, n4, n3]
+        expect(Topiary.sort([n2, n4, n3, n1])).to eq [n2, n1, n4, n3]
+        expect(Topiary.sort([n3, n1, n2, n4])).to eq [n2, n1, n4, n3]
+        expect(Topiary.sort([n3, n1, n4, n2])).to eq [n2, n1, n4, n3]
+        expect(Topiary.sort([n3, n2, n1, n4])).to eq [n2, n1, n4, n3]
+        expect(Topiary.sort([n3, n2, n4, n1])).to eq [n2, n1, n4, n3]
+        expect(Topiary.sort([n3, n4, n1, n2])).to eq [n2, n1, n4, n3]
+        expect(Topiary.sort([n3, n4, n2, n1])).to eq [n2, n1, n4, n3]
+        expect(Topiary.sort([n4, n1, n2, n3])).to eq [n2, n1, n4, n3]
+        expect(Topiary.sort([n4, n1, n3, n2])).to eq [n2, n1, n4, n3]
+        expect(Topiary.sort([n4, n2, n1, n3])).to eq [n2, n1, n4, n3]
+        expect(Topiary.sort([n4, n2, n3, n1])).to eq [n2, n1, n4, n3]
+        expect(Topiary.sort([n4, n3, n1, n2])).to eq [n2, n1, n4, n3]
+        expect(Topiary.sort([n4, n3, n2, n1])).to eq [n2, n1, n4, n3]
+      end
+      it "sorts 1->4  2->1->3  2,3->4" do
+        n1 = Topiary::Node.new "n1"
+        n2 = Topiary::Node.new "n2"
+        n3 = Topiary::Node.new "n3"
+        n4 = Topiary::Node.new "n4"
+        n1.feed! n4
+        n2.feed! n1
+        n1.feed! n3
+        n2.feed! n3
+        n3.feed! n4
+        expect(Topiary.sort([n1, n2, n3, n4])).to eq [n2, n1, n3, n4]
+        expect(Topiary.sort([n1, n2, n4, n3])).to eq [n2, n1, n3, n4]
+        expect(Topiary.sort([n1, n3, n2, n4])).to eq [n2, n1, n3, n4]
+        expect(Topiary.sort([n1, n3, n4, n2])).to eq [n2, n1, n3, n4]
+        expect(Topiary.sort([n1, n4, n2, n3])).to eq [n2, n1, n3, n4]
+        expect(Topiary.sort([n1, n4, n3, n2])).to eq [n2, n1, n3, n4]
+        expect(Topiary.sort([n2, n1, n3, n4])).to eq [n2, n1, n3, n4]
+        expect(Topiary.sort([n2, n1, n4, n3])).to eq [n2, n1, n3, n4]
+        expect(Topiary.sort([n2, n3, n1, n4])).to eq [n2, n1, n3, n4]
+        expect(Topiary.sort([n2, n3, n4, n1])).to eq [n2, n1, n3, n4]
+        expect(Topiary.sort([n2, n4, n1, n3])).to eq [n2, n1, n3, n4]
+        expect(Topiary.sort([n2, n4, n3, n1])).to eq [n2, n1, n3, n4]
+        expect(Topiary.sort([n3, n1, n2, n4])).to eq [n2, n1, n3, n4]
+        expect(Topiary.sort([n3, n1, n4, n2])).to eq [n2, n1, n3, n4]
+        expect(Topiary.sort([n3, n2, n1, n4])).to eq [n2, n1, n3, n4]
+        expect(Topiary.sort([n3, n2, n4, n1])).to eq [n2, n1, n3, n4]
+        expect(Topiary.sort([n3, n4, n1, n2])).to eq [n2, n1, n3, n4]
+        expect(Topiary.sort([n3, n4, n2, n1])).to eq [n2, n1, n3, n4]
+        expect(Topiary.sort([n4, n1, n2, n3])).to eq [n2, n1, n3, n4]
+        expect(Topiary.sort([n4, n1, n3, n2])).to eq [n2, n1, n3, n4]
+        expect(Topiary.sort([n4, n2, n1, n3])).to eq [n2, n1, n3, n4]
+        expect(Topiary.sort([n4, n2, n3, n1])).to eq [n2, n1, n3, n4]
+        expect(Topiary.sort([n4, n3, n1, n2])).to eq [n2, n1, n3, n4]
+        expect(Topiary.sort([n4, n3, n2, n1])).to eq [n2, n1, n3, n4]
+      end
+      it "sorts 1->4  2,3->1  2,3->4" do
+        n1 = Topiary::Node.new "n1"
+        n2 = Topiary::Node.new "n2"
+        n3 = Topiary::Node.new "n3"
+        n4 = Topiary::Node.new "n4"
+        n1.feed! n4
+        n2.feed! n1
+        n3.feed! n1
+        n2.feed! n4
+        n3.feed! n4
+        expect(Topiary.sort([n1, n2, n3, n4])).to eq [n2, n3, n1, n4]
+        expect(Topiary.sort([n1, n2, n4, n3])).to eq [n2, n3, n1, n4]
+        expect(Topiary.sort([n1, n3, n2, n4])).to eq [n3, n2, n1, n4]
+        expect(Topiary.sort([n1, n3, n4, n2])).to eq [n3, n2, n1, n4]
+        expect(Topiary.sort([n1, n4, n2, n3])).to eq [n2, n3, n1, n4]
+        expect(Topiary.sort([n1, n4, n3, n2])).to eq [n3, n2, n1, n4]
+        expect(Topiary.sort([n2, n1, n3, n4])).to eq [n2, n3, n1, n4]
+        expect(Topiary.sort([n2, n1, n4, n3])).to eq [n2, n3, n1, n4]
+        expect(Topiary.sort([n2, n3, n1, n4])).to eq [n2, n3, n1, n4]
+        expect(Topiary.sort([n2, n3, n4, n1])).to eq [n2, n3, n1, n4]
+        expect(Topiary.sort([n2, n4, n1, n3])).to eq [n2, n3, n1, n4]
+        expect(Topiary.sort([n2, n4, n3, n1])).to eq [n2, n3, n1, n4]
+        expect(Topiary.sort([n3, n1, n2, n4])).to eq [n3, n2, n1, n4]
+        expect(Topiary.sort([n3, n1, n4, n2])).to eq [n3, n2, n1, n4]
+        expect(Topiary.sort([n3, n2, n1, n4])).to eq [n3, n2, n1, n4]
+        expect(Topiary.sort([n3, n2, n4, n1])).to eq [n3, n2, n1, n4]
+        expect(Topiary.sort([n3, n4, n1, n2])).to eq [n3, n2, n1, n4]
+        expect(Topiary.sort([n3, n4, n2, n1])).to eq [n3, n2, n1, n4]
+        expect(Topiary.sort([n4, n1, n2, n3])).to eq [n2, n3, n1, n4]
+        expect(Topiary.sort([n4, n1, n3, n2])).to eq [n3, n2, n1, n4]
+        expect(Topiary.sort([n4, n2, n1, n3])).to eq [n2, n3, n1, n4]
+        expect(Topiary.sort([n4, n2, n3, n1])).to eq [n2, n3, n1, n4]
+        expect(Topiary.sort([n4, n3, n1, n2])).to eq [n3, n2, n1, n4]
+        expect(Topiary.sort([n4, n3, n2, n1])).to eq [n3, n2, n1, n4]
+      end
+    end
+
+    context "and 6 edges" do
+      it "sorts 1->2,3,4 and 2->3,4 and 3->4" do
+        n1 = Topiary::Node.new "n1"
+        n2 = Topiary::Node.new "n2"
+        n3 = Topiary::Node.new "n3"
+        n4 = Topiary::Node.new "n4"
+        n1.feed! n2
+        n1.feed! n3
+        n1.feed! n4
+        n2.feed! n3
+        n2.feed! n4
+        n3.feed! n4
+        expect(Topiary.sort([n1, n2, n3, n4])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n1, n2, n4, n3])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n1, n3, n2, n4])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n1, n3, n4, n2])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n1, n4, n2, n3])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n1, n4, n3, n2])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n2, n1, n3, n4])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n2, n1, n4, n3])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n2, n3, n1, n4])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n2, n3, n4, n1])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n2, n4, n1, n3])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n2, n4, n3, n1])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n3, n1, n2, n4])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n3, n1, n4, n2])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n3, n2, n1, n4])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n3, n2, n4, n1])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n3, n4, n1, n2])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n3, n4, n2, n1])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n4, n1, n2, n3])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n4, n1, n3, n2])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n4, n2, n1, n3])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n4, n2, n3, n1])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n4, n3, n1, n2])).to eq [n1, n2, n3, n4]
+        expect(Topiary.sort([n4, n3, n2, n1])).to eq [n1, n2, n3, n4]
+      end
+      it "sorts 1->2,3,4 and 2->3,4 and 4->3" do
+        n1 = Topiary::Node.new "n1"
+        n2 = Topiary::Node.new "n2"
+        n3 = Topiary::Node.new "n3"
+        n4 = Topiary::Node.new "n4"
+        n1.feed! n2
+        n1.feed! n3
+        n1.feed! n4
+        n2.feed! n3
+        n2.feed! n4
+        n4.feed! n3
+        expect(Topiary.sort([n1, n2, n3, n4])).to eq [n1, n2, n4, n3]
+        expect(Topiary.sort([n1, n2, n4, n3])).to eq [n1, n2, n4, n3]
+        expect(Topiary.sort([n1, n3, n2, n4])).to eq [n1, n2, n4, n3]
+        expect(Topiary.sort([n1, n3, n4, n2])).to eq [n1, n2, n4, n3]
+        expect(Topiary.sort([n1, n4, n2, n3])).to eq [n1, n2, n4, n3]
+        expect(Topiary.sort([n1, n4, n3, n2])).to eq [n1, n2, n4, n3]
+        expect(Topiary.sort([n2, n1, n3, n4])).to eq [n1, n2, n4, n3]
+        expect(Topiary.sort([n2, n1, n4, n3])).to eq [n1, n2, n4, n3]
+        expect(Topiary.sort([n2, n3, n1, n4])).to eq [n1, n2, n4, n3]
+        expect(Topiary.sort([n2, n3, n4, n1])).to eq [n1, n2, n4, n3]
+        expect(Topiary.sort([n2, n4, n1, n3])).to eq [n1, n2, n4, n3]
+        expect(Topiary.sort([n2, n4, n3, n1])).to eq [n1, n2, n4, n3]
+        expect(Topiary.sort([n3, n1, n2, n4])).to eq [n1, n2, n4, n3]
+        expect(Topiary.sort([n3, n1, n4, n2])).to eq [n1, n2, n4, n3]
+        expect(Topiary.sort([n3, n2, n1, n4])).to eq [n1, n2, n4, n3]
+        expect(Topiary.sort([n3, n2, n4, n1])).to eq [n1, n2, n4, n3]
+        expect(Topiary.sort([n3, n4, n1, n2])).to eq [n1, n2, n4, n3]
+        expect(Topiary.sort([n3, n4, n2, n1])).to eq [n1, n2, n4, n3]
+        expect(Topiary.sort([n4, n1, n2, n3])).to eq [n1, n2, n4, n3]
+        expect(Topiary.sort([n4, n1, n3, n2])).to eq [n1, n2, n4, n3]
+        expect(Topiary.sort([n4, n2, n1, n3])).to eq [n1, n2, n4, n3]
+        expect(Topiary.sort([n4, n2, n3, n1])).to eq [n1, n2, n4, n3]
+        expect(Topiary.sort([n4, n3, n1, n2])).to eq [n1, n2, n4, n3]
+        expect(Topiary.sort([n4, n3, n2, n1])).to eq [n1, n2, n4, n3]
+      end
+    end
+  end
+
+end