Skip to content
Snippets Groups Projects
  1. Apr 19, 2011
    • Ant01n3's avatar
      Some work on preferential attachement generators. · f10ea2ed
      Ant01n3 authored
      Modified the old PreferentialAttachment to correctly use the
      random generator of GeneratorBase (there was a bug if one changed
      the random seed, it was not taken into account).
      
      Also added a Barabàsi-Albert generator (BarabasiAlbertGenerator ...)
      that does exaclty the same job but can produce graphs, not only trees.
      Indeed the generator adds one node at each call to nextEvents(), for
      this node it can add one edge (chosen randomly, with a bias toward
      node with high degrees). However doing so creates a tree. One can
      now make two ore more edges for each node added. The number of edges
      generated at each node can be set. It can also be chosen randomly
      (uniformly this time).
      
      The BarabasiAlbertGenerator is stricly the same as the
      PreferentialAttachmentGenerator when the number of edges added per
      node is one. We can however keep the old generator for compatibility
      reasons, or replace it by the BarabasiAlbertGenerator by changing
      the name of one of the two.
      f10ea2ed
    • Ant01n3's avatar
      Preferential attachement uses doubles. · 4ad586f9
      Ant01n3 authored
      Also added the citation of the Barabàsi-Albert model used by
      this generator.
      4ad586f9
    • gsavin's avatar
      Add ref to Dorogovtsev -- Mendes generator. · 8455d821
      gsavin authored
      8455d821
    • gsavin's avatar
  2. Apr 16, 2011
  3. Apr 13, 2011
  4. Feb 15, 2011
  5. Feb 13, 2011
  6. Feb 11, 2011
  7. Jan 18, 2011
  8. Dec 13, 2010
  9. Nov 30, 2010
  10. Nov 25, 2010
  11. Nov 11, 2010
  12. Oct 26, 2010
    • Ant01n3's avatar
      Still more bug fixes in BetweennessCentrality. · 7b0025e7
      Ant01n3 authored
      The algorithm is now largely tested in weighted and unweighted
      graphs and should work on non-multi-graphs. It works on directed
      graphs, but ignore the direction.
      
      Added the possibility to register a progress "callback" since
      the algorithm can take a lot of time to compute.
      7b0025e7
  13. Oct 18, 2010
  14. Oct 11, 2010
  15. Oct 10, 2010
  16. Oct 08, 2010
  17. Oct 07, 2010
  18. Oct 05, 2010