graphCompression/Graph.cpp at master · novaCoder-zrk/graphCompression · 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
//
// Created by zhang on 2022/1/19.
//

#include "Graph.h"
void Graph::addOrderedEdge(int src, int dst){
    vertex.insert(src);
    vertex.insert(dst);
    int before = adjList[src].size();
    adjList[src].insert(dst);
    if(adjList[src].size() > before)
        cntEdge++;

}
void Graph::addUnorderedEdge(int src, int dst){
    vertex.insert(src);
    vertex.insert(dst);
    int before = adjList[src].size();
    adjList[src].insert(dst);
    adjList[dst].insert(src);

    if(adjList[src].size() > before)
        cntEdge += 2;
}
Graph::Graph() {
    cntEdge = 0;
}
set<int> Graph:: getNeighbors(int u){
    return adjList[u];
}
bool Graph::isAdj(int src,int dst){
    return  adjList[src].find(dst) != adjList[src].end();
}

int Graph::maxVertex() {
    auto it  = vertex.end();
    it--;
    return *it;
}
int Graph::getEdgeNum() {
    return cntEdge;
}