Technical facts

Operating system(s) or programming environment(s)

Lubuntu 15.04 (vivid)

IDE(s):

Qt Creator 3.1.1

Project type:

Console application

C++ standard:

C++98

Compiler(s):

G++ 4.9.2

Libraries used:

STL: GNU ISO C++ Library, version 4.9.2

Qt project file: ./CppBoostGraphExample2/CppBoostGraphExample2.pro


include(../../ConsoleApplication.pri) #Or use the code below

# QT += core

# QT += gui

# CONFIG   += console

# CONFIG   -= app_bundle

# TEMPLATE = app

# CONFIG(release, debug|release) {

#   DEFINES += NDEBUG NTRACE_BILDERBIKKEL

# }

# QMAKE_CXXFLAGS += -std=c++1y -Wall -Wextra -Weffc++

# unix {

#   QMAKE_CXXFLAGS += -Werror

# }



include(../../Libraries/Boost.pri)

# win32 {

#   INCLUDEPATH += \

#     ../../Libraries/boost_1_54_0

# }



SOURCES += main.cpp

./CppBoostGraphExample2/main.cpp


#pragma GCC diagnostic push

#pragma GCC diagnostic ignored "-Weffc++"

#pragma GCC diagnostic ignored "-Wunused-local-typedefs"

#include <boost/graph/adjacency_list.hpp>

#include <boost/graph/graphviz.hpp>

#pragma GCC diagnostic pop

int main()

{

  //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

    boost::vecS,

    //Store all vertices in a std::vector

    boost::vecS,

    //Relations are both ways (in this example)

    //(note: but you can freely change it to boost::directedS)

    boost::undirectedS,

    //All vertices are person names of type std::string

    boost::property<boost::vertex_name_t,std::string>,

    //All edges are relation of type std::string

    boost::property<boost::edge_name_t,std::string>

  > Graph;



  Graph  g;



  std::vector<std::string> names;

  names.push_back("Mr. A");

  names.push_back("Mrs. B");

  names.push_back("Dr. C");

  names.push_back("Prof. D");



  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<std::string> relations;

  relations.push_back("Married");

  relations.push_back("Lovers");

  relations.push_back("Collegues");

  relations.push_back("Roommates");



  boost::add_edge(v0,v1,relations[0],g);

  boost::add_edge(v1,v2,relations[1],g);

  boost::add_edge(v2,v3,relations[2],g);

  boost::add_edge(v0,v3,relations[3],g);



  //Writing graph to file

  {

    std::ofstream f("test.dot");

    //Problems:

    //- All relationships are omitted

    boost::write_graphviz(

      f,

      g,

      boost::make_label_writer(&(names[0])));

    f.close();

  }



  //View the output directly using KGraphViewerer

  std::system("kgraphviewer test.dot");

}

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

Go back to Richel Bilderbeek's homepage.

This page has been created by the tool CodeToHtml

(C++) BoostGraphExample2

Technical facts

Qt project file: ./CppBoostGraphExample2/CppBoostGraphExample2.pro

./CppBoostGraphExample2/main.cpp