Thesis » QuynhNguyen-MS

%!TEX root = note.tex

%%%%%%%%%%%%%%%%%%

% WEEK 14

%%%%%%%%%%%%%%%%%%

\section{Week 14}

    \subsection{C++ Heuristic BC - CHBC}

    \subsection{Pattern}

    Out put graph

\begin{lstlisting}

Graph g;

...

// 1st way

outops::operator<<(cout, g);

// 2nd way

using namespace outops;

cout << g;

\end{lstlisting}

\href{http://stackoverflow.com/questions/8175933/to-compare-two-boost-graph-having-same-vertices}{Using boost::spirit::karma to format the output}

\href{http://stackoverflow.com/questions/17595949/boostgraph-add-vertex-compilation-error}{Use graph_manager.h to manage the graph}

    \subsection{Bug: in copy constructor of GraphManger for v_index_std_map}

        I don't know why the size of v_index_std_map got double?!

        Read for explaination: \href{http://stackoverflow.com/questions/1639544/why-does-stdmap-operator-create-an-object-if-the-key-doesnt-exist}{stdmap create an object if the key doesn't exist}

        \lstinline{boost::get()}: when the key doesn't exist, then it automatically create a default value for that key.

        \begin{lstlisting}

    Vertex Index Std Map:

[

  0

  0

  0

  0

  0

  1

  0

  2

  3

  4

  5

  6

  7

  0

  10

  8

  9

  0

  0

  0

  0

  0

]

        \end{lstlisting}

    \subsection{SubComponent}

        How to store \lstinline{art_points_id} for each SubComponent?

    \subsection{Cannot overload cout operator<< for std::map}

        \begin{lstlisting}

// Code

    template <typename T1, typename T2>

    std::ostream& operator<<(std::ostream& os, const std::map<T1, T2>& m)

    {

        cout << "utility << map\n";

        // using namespace boost::spirit::karma;

        // os << format("(" << (auto_ % "\n  ") << ")", m);

        // os << endl;

        // return os;

    }

// Error

sub_component.o: In function `operator<<(std::ostream&, SubComponent const&)':

sub_component.cpp:(.text+0x715): undefined reference to `outops::operator<<(std::ostream&, std::map<std::string, int, std::less<std::string>, std::allocator<std::pair<std::string const, int> > >)'

        \end{lstlisting}

    \subsection{Boost Test}

        https://github.com/jsankey/boost.test-examples

        http://www.ibm.com/developerworks/aix/library/au-ctools1_boost/

    \subsection{const KEYWORD}

        http://stackoverflow.com/questions/15604127/do-a-getter-for-an-object

        http://stackoverflow.com/questions/6299967/what-are-the-use-cases-for-having-a-function-return-by-const-value-for-non-built

    \subsection{boost/betweenness_centrality.hpp}

        The structure

        \begin{lstlisting}

namespace detail { namespace graph {

    struct brandes_dijkstra_visitor : public bfs_visitor<> {};

    struct brandes_dijkstra_shortest_paths {};

    struct brandes_unweighted_shortest_paths {};

    void init_centrality_map(std::pair<Iter, Iter>, dummy_property_map);

    void init_centrality_map(std::pair<Iter, Iter> keys, Centrality centrality_map);

    void update_centrality(dummy_property_map, const Key&, const T&);

    void update_centrality(CentralityMap centrality_map, Key k, const T& x);

    void divide_centrality_by_two(std::pair<Iter, Iter>, dummy_property_map);

    void divide_centrality_by_two(std::pair<Iter, Iter> keys,

                           CentralityMap centrality_map);

    void brandes_betweenness_centrality_impl(const Graph& g,

                                      CentralityMap centrality,     // C_B

                                      EdgeCentralityMap edge_centrality_map,

                                      IncomingMap incoming, // P

                                      DistanceMap distance,         // d

                                      DependencyMap dependency,     // delta

                                      PathCountMap path_count,      // sigma

                                      VertexIndexMap vertex_index,

                                      ShortestPaths shortest_paths);

} } // end namespace detail::graph

// For unweighted graph

void brandes_betweenness_centrality(...) {

    detail::graph::brandes_unweighted_shortest_paths shortest_paths;

    detail::graph::brandes_betweenness_centrality_impl(...);

};

// For weighted graph

void brandes_betweenness_centrality(...) {

    detail::graph::brandes_dijkstra_shortest_paths<WeightMap>

    shortest_paths(weight_map);

    detail::graph::brandes_betweenness_centrality_impl(...);

}

namespace detail { namespace graph {

    void brandes_betweenness_centrality_dispatch2(...);

    void brandes_betweenness_centrality_dispatch2(...);

    struct brandes_betweenness_centrality_dispatch1 {};

    struct brandes_betweenness_centrality_dispatch1<param_not_found> {};

    struct is_bgl_named_params {};

    struct is_bgl_named_params {};

} } // end namespace detail::graph

        \end{lstlisting}