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.