anchor.diff:      Neighb43 = nodelist:mk_neighborhood( [N8,  N14, N33, N14], N14),
       Neighb44 = nodelist:mk_neighborhood( [N33, N14, N8, N33, N14],  N14),
       Neighb45 = nodelist:mk_neighborhood( [N14, N33, N8, N14, N8],  N33),
  -    ?compare_neighborhood(Neighb41,  N8,   8, N33, [N33, N14], N14, [N14, N33], true, true),
  -    ?compare_neighborhood(Neighb42,  N8,   8, N33, [N33, N14], N14, [N14, N33], true, true),
  -    ?compare_neighborhood(Neighb43,  N14, 14, N8,  [N8, N33],  N33, [N33, N8],  true, true),
  -    ?compare_neighborhood(Neighb44,  N14, 14, N8,  [N8, N33],  N33, [N33, N8],  true, true),
  -    ?compare_neighborhood(Neighb45,  N33, 33, N14, [N14, N8],  N8,  [N8, N14],  true, true),
  +    ?compare_neighborhood(Neighb41,  N8,  N33, [N33, N14], N14, [N14, N33], true, true),
  +    ?compare_neighborhood(Neighb42,  N8,  N33, [N33, N14], N14, [N14, N33], true, true),
  +    ?compare_neighborhood(Neighb43,  N14, N8,  [N8, N33],  N33, [N33, N8],  true, true),
  +    ?compare_neighborhood(Neighb44,  N14, N8,  [N8, N33],  N33, [N33, N8],  true, true),
  +    ?compare_neighborhood(Neighb45,  N33, N14, [N14, N8],  N8,  [N8, N14],  true, true),
       
       % tests with nodes equal to the base node in the node list:
       ?compare_neighborhood(nodelist:mk_neighborhood([N8, N33, N14], N15),
  -                          N15, 15, N8, [N8, N33], N33, [N33, N8], true, true),
  +                          N15, N8, [N8, N33], N33, [N33, N8], true, true),
       ?expect_exception(nodelist:mk_neighborhood([N8, N33, N15], N14),
                         throw, 'cannot create a neighborhood() with a neighbor newer than the node itself'),
       ?expect_exception(nodelist:mk_neighborhood([N8, N15, N33], N14),
  
positive.code: %% @doc Tests converting neighborhood structures to node lists.
  -spec test_to_list(any()) -> ok.
  test_to_list(_Config) ->
      N8 = node:new(pid1,   8, 0),
      N14 = node:new(pid2, 14, 0),
      N20 = node:new(pid3, 20, 0),
      N33 = node:new(pid4, 33, 0),
      N50 = node:new(pid5, 50, 0),
      
      Neighb1 = nodelist:mk_neighborhood([N8, N14, N33, N50], N20),
      Neighb2 = nodelist:mk_neighborhood([N8, N14, N33, N50], N20, 3, 3),
  
negative.code:     % Neighb3 = nodelist:mk_neighborhood([N8, N14, N42, N50], N33, 2, 2),
      % remove existing nodes:
      ?compare_neighborhood(nodelist:filter(Neighb3, fun(N) -> not node:same_process(N, N8) end),
                            N33, N14, [N14], N42, [N42, N50], true, true),
      ?compare_neighborhood(nodelist:filter(Neighb3, fun(N) -> not node:same_process(N, N14) end),
                            N33, N8, [N8], N42, [N42, N50], true, true),
      ?compare_neighborhood(nodelist:filter(Neighb3, fun(N) -> not node:same_process(N, N42) end),
                            N33, N14, [N14, N8], N50, [N50], true, true),
      ?compare_neighborhood(nodelist:filter(Neighb3, fun(N) -> not node:same_process(N, N50) end),
                            N33, N14, [N14, N8], N42, [N42], true, true),
  
      % remove non-existing nodes and pids:
      ?equals(nodelist:filter(Neighb3, fun(N) -> not node:same_process(N, N20) end), Neighb3),
  