Methods for implementing and using node schedules in C ++?

Question

I am working on a research project that deals with social networks. I made most of the basics of a C ++ program, and now I want to implement a way to create a graph of nodes and connections, as well as a way to visualize connections between people. I looked a little at Lemon and the Boost graph library, but wondered which one would be easier to learn and implement, or if I should just code my own.

Answer 1

If you use BGL , then you can also use the Chart Set for Algorithms and Drawings (GTAD). GTAD is designed to be compatible with BGL and adds a number of non-BGL graph algorithms as well as layout algorithms.

For visualization, BGL allows you to read and write some common types of image files, such as GraphML and Dot, for use with GraphViz .

Lemon looks like a well-chosen library with a good set of algorithms. You can also use gLemon to view Lemon charts. This visualizer looks pretty simple and was last updated in 2008, unlike Lemon, which is still under development.

I would advise you first to figure out what you want to do with any graphs you create, that is, what algorithms you require (the shortest path, etc.) and compare these libraries with this.

Also check out the tutorials for both. They have very good documentation and should help you decide which will be easier for you to implement.

If you really do not want to delve into the details of how certain graph structures and algorithms are implemented, I would use a library.