scan2/Graph.hpp at main · mlk12333/scan2 · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
//
//  Graph.hpp
//  scan2
//
//  Created by 孟令凯 on 2021/3/4.
//
//

#ifndef Graph_hpp
#define Graph_hpp
#include <iostream>
#include <stdio.h>
#include "string"
#include <ext/hash_map>
#include <vector>
#include <list>
#include <fstream>
#include <queue>

using namespace std;
using namespace __gnu_cxx;

class Graph{
    string str;//图数据
    string f;//索引数据
    int n,m,m2;
    hash_map<int,vector<int>> out_edges;
    hash_map<int,vector<int>> in_edges;
    vector<int> out_degree;
    vector<int> in_degree;

//    hash_map<int,hash_map<int,int>> out_edges;
//    hash_map<int,hash_map<int,int>> in_edges;

    hash_map<int,hash_map<int,int>> cNum;
    hash_map<int,hash_map<int,int>> fNum;

    vector<vector<vector<double>>> core_order1;
    vector<vector<vector<double>>> core_order2;

    vector<vector<vector<double>>> neighbor_order1;
    vector<vector<vector<double>>> neighbor_order2;

//    int *neiNum;
    vector<int> neiNum;

    vector<vector<int>> degree_order;

    vector<vector<int>> cycle_trai;

public:
    Graph(string str, string f);
    void creatIndex(double parameter1,double parameter2, int parameterNum);
    void readIndex();
    void buildNeighborOrder();
    void getNeiNum();
    int BinarySearch(vector<int> &a, int value, int n);
    void writeNOrder();
    void writeCOrder();

    void writeCOrder2(int parameterNum);

    void query(double parameter1,double parameter2, int parameterNum);
    vector<int> getAllNei(double parameter1,double parameter2,int v);
    vector<int> getAllCore(double parameter1,double parameter2,int corei);

    void getTriangles();

    bool judgeCycletrai(int a,int b,int c);

    void getCycleTti();

    void getFlowTti();

    vector<int> intersection(vector<int> &A, vector<int> &B, int a, int b);

};

#endif /* Graph_hpp */