Latest News
- [May 5, 2008] SNAP 0.2 is now available for download. This version includes a new parallel community identification implementation based on Newman's recursive spectral partitioning algorithm.
- [February 12, 2008] SNAP 0.1 is available for download. This is the first SourceForge release.
- [February 12, 2008] Our IPDPS 2008 paper discussing community identification approaches in SNAP, SNAP overview slides, and a draft SNAP user guide are now available in the documentation section.
What is SNAP?
SNAP (Small-world Network Analysis and Partitioning) is an extensible parallel framework for exploratory analysis and partitioning of large-scale networks.
SNAP is implemented in C, uses POSIX threads and OpenMP primitives for parallelization, and targets sequential, multicore, and symmetric multiprocessor platforms. Our intent with SNAP is to provide a simple and intuitive interface for network analysis and application design, hiding the parallel programming complexity from the user. In addition to path-based, centrality, and community identification queries on large-scale graphs, we support commonly-used preprocessing kernels and quantitative measures that consider the global network topology.