Data structures for huge graphs in C++ [closed]

It's difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical and cann开发者_如何转开发ot be reasonably answered in its current form. For help clarifying this question so that it can be reopened, visit the help center. Closed 12 years ago.

I want to understand how huge graphs can be implemented, so that graph algorithms run faster with huge graphs.

---

Maybe you should look at a famous graph library, e.g. boost graph library

---

The core idea for graph representation is incidence matrix. The rest depends on what you need. For example possible solution oriented on quickly finding neighbours are adjacency matrices.