Graph.h

Go to the documentation of this file.

#pragma once

#include <vector>

using namespace std;

class Graph {

private:
    vector<vector<int>> adjacencyMatrix;

    vector<string> nodes;

    bool hasCycleCache = false;

    bool hasCycleFlag = false;

    enum Type {
        UNCHECKED, DIRECTED, UNDIRECTED
    };

    Type type = UNCHECKED;

    vector<int> inDeg;

    vector<int> outDeg;

    bool isFreeOfLoopsCache = false;

    bool isFreeOfLoopsFlag = false;

    bool isMultigraphCache = false;

    bool isMultigraphFlag = false;

    bool isForestCache = false;

    bool isForestFlag = false;

    bool isCompleteCache = false;

    bool isCompleteFlag = false;

    bool isRegularCache = false;

    bool isRegularFlag = false;

    bool hasCycleRec(const int i, bool *visited, bool *stack) const;

    vector<vector<int>> powerMatrix(vector<vector<int>> squareMatrix, int exponent);

    vector<vector<int>> getIdentityMatrix(int size);

    vector<vector<int>> multiplyMatrix(const vector<vector<int>> &A, const vector<vector<int>> &B);

    vector<vector<int>> addMatrix(const vector<vector<int>> &A, const vector<vector<int>> &B);

    vector<vector<int>> getZeroizedMatrix(int rows, int cols);

    bool isSameMatrix(const vector<vector<int>> &A, const vector<vector<int>> &B);

    bool isSquareMatrix(const vector<vector<int>> &adjacencyMatrix) const;

    const vector<vector<int>> &getAdjacencyMatrix() const;



public:
    Graph(vector<vector<int>> adjacencyMatrix);
    Graph(vector<vector<int>> adjacencyMatrix, vector<string> node_names);

    Graph(string matlabMatrix);

    int getNumberOfNodes() const;

    int getNumberOfEdges();

    void exportFile(const string fileName, const string data) const;

    void exportAdjazenzmatrixFile(const string fileName) const;

    string graphToJson();

    bool hasCycle();

    bool hasEdge(const int from, const int to);

    bool hasPath(const vector<int> path) const;

    const string getAdjacencyMatrixString() const;

    bool isDirected();

    int getInDeg(int vertexIndex);

    int getOutDeg(int vertexIndex);

    bool isFreeOfLoops();

    bool isMultigraph();

    bool isSimple();

    bool isComplete();

    bool isRegular();

    bool isForest();

    bool hasConnectivity(int s, int t);

    string exportDot();

    bool areNeighbours(int from, int to);

    string exportDot(vector<int> path);

};