Thesis » QuynhNguyen-MS

//

// Created by quynh on 1/9/16.

//

// Problem with deep copy

// http://stackoverflow.com/questions/6955578/subtraction-and-intersection-of-two-vectors-of-pointers-in-c

#ifndef GRAPH_PARSER_SUB_COMPONENT_H

#define GRAPH_PARSER_SUB_COMPONENT_H

#include <boost/graph/betweenness_centrality.hpp>

#include <boost/graph/copy.hpp>

#include "centrality.h"

#include "common.h"

#include "utility.h"

#include "graph_manager.h"

class SubComponent {

public:

    typedef std::vector<double> CentralityVec;

    typedef boost::iterator_property_map<CentralityVec::iterator, VertexIndexPMap> CentralityPMap;

    SubComponent(bool weighted_graph = false);

    // Getter & Setter

    GraphManager const& gm() const;

    StringSet const& all_vertices_id() const;

    StringSet const& art_points_id() const;

    StringSet const& non_art_points_id() const;

    NameToIntMap const& weight_map() const;

    NameToIntMap const& weight_reversed_map() const;

    std::map< std::pair<string, string>, int > const& traffic_matrix() const;

    CentralityVec const& v_centrality_vec() const;

    // CREATE SUB-COMPONENT

    void AddEdge(Router r1, Router r2, Link l);

    void FinalizeSubComponent(StringSet all_art_points_id);

    // LINK WEIGHT CALCULATION

    void initialize_weight();

    int get_weight_map(string name);

    int get_weight_reversed_map(string name);

    void update_weight_map(string name, int value);

    void update_weight_reversed_map(string name, int value);

    void calculate_weight_reversed(int V);

    // TRAFFIC MATRIX CALCULATION

    void CalculateTrafficMatrix();

    void initialize_traffic_matrix();

    int get_traffic_matrix(string name_1, string name_2);

    void update_traffic_matrix(string name_1, string name_2, int value);

    // BETWEENNESS CENTRALITY

    void CalculateBetweennessCentralityHeuristic();

    void initialize_betweenness_centrality();

    double get_betweenness_centrality(string name);

    double get_betweenness_centrality(Vertex v);

    // HELPERS

    int num_of_vertices();

    int index_of_vertex_id(string vertex_id);

    bool vertex_exists(string name);

    string first_vertex_id_with_unknown_weight();

    // HELPERS FOR OUTPUTTING RESULT

    void print();

    void print_traffic_matrix();

    friend std::ostream& operator<<(std::ostream& os, const SubComponent& sc);

    // OLD CODE

    void printWeight();

    void _find_vertices_with_unknown_weight(VertexVec& unknown_weight_vertices);

    // Betweenness Centrality

    void findBetweennessCentrality();

    void printBetweennessCentrality();

    // NEW CODE

    GraphManager gm_;

private:

    StringSet all_vertices_id_;

    StringSet art_points_id_;

    StringSet non_art_points_id_; // vertices that are not articulation points

    NameToIntMap name_index_pmap_;

    NameToIntMap weight_map_;

    NameToIntMap weight_reversed_map_;

    typedef std::map< std::pair<string, string>, int> TrafficMatrixStdMap;

    typedef boost::associative_property_map<TrafficMatrixStdMap> TrafficMatrixPMap;

    TrafficMatrixStdMap traffic_matrix_;

    TrafficMatrixPMap traffic_matrix_pmap_;

    // vector<vector<int> > traffic_matrix_;

    CentralityVec v_centrality_vec_;

    CentralityPMap v_centrality_pmap_;

};

#endif //GRAPH_PARSER_SUB_COMPONENT_H