Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I am trying to perform some benchmarks in some graph data structures in C++ – my goal is to optimize data layouts.
Since data layouts are important to my context, I was wondering if there is any pre-defined standard graph structure, commonly used for graph benchmarks – i.e., a standard graph form used to strain memory systems. Has someone ever bumped into something like this?
Thanks in advance.
You could take a look at the Boost implementation: http://www.boost.org/doc/libs/1_48_0/libs/graph/doc/index.html