Go back to Richel Bilderbeek's homepage.

Go back to Richel Bilderbeek's C++ page.






(C++) BoostGraphExample5


BoostQt CreatorLubuntu


Boost.Graph example 5 is a Boost.Graph example.

Technical facts


Operating system(s) or programming environment(s)


Project type:

C++ standard:


Libraries used:






Qt project file: ./CppBoostGraphExample5/CppBoostGraphExample5.pro


include(../../ConsoleApplication.pri) #Or use the code below
# QT += core
# QT += gui
# CONFIG   += console
# CONFIG   -= app_bundle
# TEMPLATE = app
# CONFIG(release, debug|release) {
# }
# QMAKE_CXXFLAGS += -std=c++1y -Wall -Wextra -Weffc++
# unix {
#   QMAKE_CXXFLAGS += -Werror
# }

# win32 {
#     ../../Libraries/boost_1_54_0
# }

SOURCES += main.cpp








#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Weffc++"
#pragma GCC diagnostic ignored "-Wunused-local-typedefs"
#include <iostream>
#include <boost/graph/adjacency_list.hpp>
#include <boost/graph/breadth_first_search.hpp>
#include <boost/graph/visitors.hpp>
#pragma GCC diagnostic pop

//Define the type of graph:
//boost::adjacency_list is the 'Swiss army knife' graph
typedef boost::adjacency_list
  //Store all edges as a std::vector
  //Store all vertices in a std::vector
  //Relations are both ways (in this example)
  //(note: but you can freely change it to boost::directedS)
  //All vertices are person names of type std::string
  //All edges are weights equal to the encounter frequencies
  //Graph itself has a std::string name
> Graph;

Graph Create()

  Graph g;

  //All vertex names
  //Note: cannot use spaces
  std::vector<std::string> names;

  const Graph::vertex_descriptor v0 = boost::add_vertex(names[0],g);
  const Graph::vertex_descriptor v1 = boost::add_vertex(names[1],g);
  const Graph::vertex_descriptor v2 = boost::add_vertex(names[2],g);
  const Graph::vertex_descriptor v3 = boost::add_vertex(names[3],g);

  std::vector<double> frequencies;


  return g;

class custom_bfs_visitor : public boost::default_bfs_visitor

  template < typename Vertex, typename Graph >
  void discover_vertex(Vertex u, const Graph & g) const
    std::cout << u << std::endl;

int main()
  const auto g(Create());
  TODO: Iterate over nodes






Go back to Richel Bilderbeek's C++ page.

Go back to Richel Bilderbeek's homepage.


Valid XHTML 1.0 Strict

This page has been created by the tool CodeToHtml