Skip to content

Releases: bdsullivan/INDDGO

INDDGO version 2.0

27 Sep 19:42
Compare
Choose a tag to compare

This release is a major upgrade to INDDGO version 1.0 and marks the integration of a large number of additional Graph feature computations into the INDDGO framework. For Linux users, this release supercedes Windows/MSVC-Compatible INDDGO version 1.1 and includes all improvements in that release.

Warning: This release is not guaranteed to compile on Windows/Cygwin/MSVC.

Highlights:

  • OpenMP support in many features and routines.
  • Improved graph library class structure makes it easier for developers to add new methods.
  • Improved googletest unit testing coverage for lib_graphd.
  • I/O speed improvements, up to 90% in some cases.
  • Reduction in memory footprints for many routines, and speed-up due to
    fewer copies.
  • New graph_stats binary for use in calculating features.
  • New tree_stats binary for use in calculating statistics of tree decompositions/bags.
  • Supports generation of synthetic R-MAT and Random Intersection Graphs.
  • Executables for creating graph complements, running CPLEX solver on MWIS problems.
  • Improved code documentation and Doxygen support.
  • New graph feature calculations:
  • Triangle counting
  • Local and global clustering coefficients
  • Single source shortest paths
  • All-pairs shortest paths
  • Betweenness centrality
  • Eccentricity
  • Expansion
  • Edge density
  • Diameter and effective diameter
  • Average path length
  • Delta hyperbolicity
  • Degree assortativity
  • Eigenvalue calculations
  • Degree distribution
  • K-cores

Notes: Calculation of betweenness centrailty currently requires Boost. Calculation of eigenvalues currently requires PETSc and SLEPc.

Windows/MSVC-Compatible INDDGO version 1.1

20 Sep 18:38
Compare
Choose a tag to compare

This release has been tested for compilation using g++ on Windows and Linux, as well as the Microsoft Visual Studio C++ compiler. It contains all functionality needed to run serial and parallel versions of the MWIS solver.

Highlights since 1.0.0:

  • Improved graph library class structure makes it easier for developers to add new methods.
  • Faster I/O routines.
  • New graph feature calculations available in GraphProperties
  • Improved code documentation and Doxygen support
  • Integrated unit testing with gtest for functions in lib_graphd
  • Support for parallel make
  • Several new executables (including graph_stats utility)
  • Assorted bug fixes

INDDGO version 1.0

27 Sep 19:48
Compare
Choose a tag to compare

Initial release of INDDGO.