anchor.diff:                 end,
       Orphaned = sets:fold(GraphFun, [], Nodes),
   
  -    %% Verify connectedness.
  -    ConnectedFun = fun({Name, _, _}, Result0) ->
  -                           {Ns, Result} = sets:fold(fun({N, _, _}, {Disconnected, Result1}) ->
  -                                           Path = digraph:get_short_path(Graph, Name, N),
  -                                           case Path of
  -                                               false ->
  -                                                   {[N|Disconnected], Result1 andalso false};
  -                                               _ ->
  -                                                   {Disconnected, Result1 andalso true}
  -                                           end
  -                                      end, {[], Result0}, Nodes),
  -                           case Ns of
  -                               [] ->
  -                                   ok;
  -                               _ ->
  -                                lager:info("Node ~p can not find shortest path to: ~p", [Name, Ns])
  -                           end,
  -                           Result
  -                 end,
  -    Connected = sets:fold(ConnectedFun, true, Nodes)
  +    [FirstNode|_] = Nodes,
  +    {SymmetricViews, VisitedNodes} = breath_first(FirstNode, Graph, ordsets:new()),
  +
  +    Connected = SymmetricViews
  +        andalso ordsets:from_list(Nodes) == VisitedNodes
           andalso sets:size(ClientsFromMarathon) == lasp_config:get(client_number, 3),
   
  -    IsConnected = case Connected of
  +    case Connected of
           true ->
  -            lager:info("Graph is connected!"),
  -            true;
  +            lager:info("Graph is connected!");
           false ->
  -            lager:info("Graph is not connected!"),
  -            false
  +            lager:info("Graph is not connected!")
       end,
   
  -    WasConnected = IsConnected orelse WasConnected0,
  +    WasConnected = Connected orelse WasConnected0,
   
       case length(Orphaned) of
           0 ->
  
positive.code:                         digraph:add_edge(Graph, Name, N)
                  end, Graph, Membership).
  
  %% @private
  prefix(File) ->
      EvalTimestamp = lasp_config:get(evaluation_timestamp, 0),
  
negative.code: 
      schedule_build_graph(),
  
      {noreply, State#state{is_connected=Connected,
                            was_connected=WasConnected,
                            graph=Graph}};
  
  