anchor.diff:          ,{"community_graph_nodes", fun community_graph_nodes/0}
           ,{"community_one", fun community_one/0}
           ,{"community_clique", fun community_clique/0}
  -        ,{"partition_modularity_increase", fun partition_modularity_increase/0}
  +        ,{timeout, 1000, {"partition_modularity_increase", fun partition_modularity_increase/0}}
           ,{"partition_ring_clique", fun partition_ring_clique/0}
           ,{"partition_sample_1000", fun partition_sample_1000/0}
   %       ,{timeout, 200, {"partition_sample_10000", fun partition_sample_10000/0}}
  
positive.code:     digraph:add_vertex(G, "c"),
      digraph:add_vertex(G, "d"),
      digraph:add_vertex(G, "e"),
      digraph:add_edge(G, "a", "b"),
      digraph:add_edge(G, "b", "c"),
      digraph:add_edge(G, "c", "d"),
      digraph:add_edge(G, "b", "b"),
      {LG = #louvain_graph{}, CleanupFn} = part_louvain:graph(
                                              digraph:vertices(G),
                                              [digraph:edge(G, E) ||
  
negative.code:     lists:foreach(fun(V) -> digraph:add_vertex(G, V) end, Vertices),
      lists:foreach(
          fun({V1, V2}) ->
              digraph_add_edge(G, {V1,V2}, V1, V2, [])
          end, combinations2(Vertices)),
      {neighbors_from_digraph(G), edges_from_digraph(G), Vertices}.
  
  