# SSCA2 Graph Sample

- Kernel 1: generate the graph randomly
- Kernel 2: using the generated graph, find vertex pairs with largest integer weight and place them in an edge listS
- Kernel 3: create a list of sub-graphs of all the paths of length SubGraphPathLength that start with an edge inS
- Kernel 4: find the set of vertices in the graph with the highest Betweenness Centrality score, or shortest path enumeration-based centrality metric

- System Requirements
- Hardware:
- Any Intel processor with AVX support like 2nd Generation Intel Core™ i3, i5, or i7 processors and Intel Xeon® E3 or E5 processor family, or newer

- Microsoft Visual Studio 2010* or 2012* standard edition or above
- Intel® C++ Composer XE 2013 SP1 for Windows

- GNU* GCC 4.5 or newer
- Intel® C++ Composer XE 2013 SP1 for Linux*