docs/graph_8h_source.html

#ifndef GRAPH_H

#define GRAPH_H


#include <QObject>

#include <QList>

#include <QQueue>

#include <QUrl>

#include <QHash>

#include <QSet>

#include <QMultiHash>

#include <QMultiMap>

#include <QTextStream>

#include <QThread>


// Allows to use QT_CHARTS namespace directives (see below)

#include <QtCharts/QChartGlobal>


// stack is a wrapper around <deque> in C++

// see: www.cplusplus.com/reference/stl/stack

#include <stack>


#include "global.h"

#include "graphvertex.h"

#include "matrix.h"

#include "parser.h"

#include "webcrawler.h"

#include "graphicswidget.h"


class QDateTime;

class QPointF;

class QNetworkReply;


class QAbstractSeries;

class QAbstractAxis;

class QSplineSeries;

class QBarSeries;

class QAreaSeries;

class QBarSet;

class QBarCategoryAxis;


using namespace std;


SOCNETV_USE_NAMESPACE

class Chart;


typedef QList<GraphVertex*> VList;

typedef QHash <QString, int> H_StrToInt;

typedef QHash <int, int> H_Int;

typedef QHash <qreal, int> H_f_i;

typedef QPair <qreal, bool> pair_f_b;

typedef QPair <int, pair_f_b > pair_i_fb;

typedef QMultiHash <int, pair_i_fb > H_edges;

typedef QHash<QString, bool> H_StrToBool;

typedef QList<int> L_int;

typedef QList<int> V_int;

typedef QList<QString> V_str;


class Graph:  public QObject{

    Q_OBJECT

    QThread file_parserThread;

    QThread webcrawlerThread;


public slots:


    int relationCurrent();


    QString relationCurrentName() const;


    void relationCurrentRename(const QString &newName);

    void relationCurrentRename(const QString &newName, const bool &signalMW);


    void vertexCreate (const int &number,

                        const int &size,

                        const QString &color,

                        const QString &numColor,

                        const int &numSize,

                        const QString &label,

                        const QString &labelColor,

                        const int &labelSize,

                        const QPointF &p,

                        const QString &shape,

                        const QString &iconPath = QString(),

                        const bool &signalMW = false

            );


    void graphFileLoaded(const int &fileType,

                         const QString &fName=QString(),

                         const QString &netName=QString(),

                         const int &totalNodes=0,

                         const int &totalLinks=0,

                         const int &edgeDirType=0,

                         const qint64 &elapsedTime=0,

                         const QString &message=QString());


    void vertexRemoveDummyNode(int);


    void graphLoadedTerminateParserThreads (QString reason);


    void setSelectionChanged(const QList<int> selectedVertices,

                               const QList<SelectedEdge> selectedEdges);


    void graphClickedEmptySpace( const QPointF &p);


    bool edgeCreate  (const int &v1, const int &v2, const qreal &weight,

                      const QString &color ,

                      const int &type=0,

                      const bool &drawArrows=true, const bool &bezier=false,

                      const QString &label=QString(),

                      const bool &signalMW=true);


    void edgeCreateWebCrawler (const int &source, const int &target);


    // helper vertexCreate functions

    void vertexCreateAtPos(const QPointF &p);


    void vertexCreateAtPosRandom(const bool &signalMW=false);


    void vertexCreateAtPosRandomWithLabel(const int &i,

                                          const QString &label,

                                          const bool &signalMW=false) ;


    void relationSet(int relNum=RAND_MAX, const bool &updateUI=true);


    void relationNext();


    void relationPrev();


    void canvasSizeSet(const int &width, const int &height);


    double canvasMaxRadius() const;


    qreal canvasMinDimension() const;


    double canvasVisibleX(const double &x) const ;


    double canvasVisibleY(const double &y) const ;


    double canvasRandomX()  const;


    double canvasRandomY()  const;


    void vertexIsolatedAllToggle ( const bool &toggle);


    void vertexClickedSet(const int &v, const QPointF &p);


    void edgeClickedSet(const int &v1, const int &v2, const bool &openMenu=false) ;


    void edgeFilterByWeight (const qreal, const bool);


    void edgeFilterByRelation(int relation, bool status);


    void edgeFilterUnilateral(const bool &toggle);


    void startWebCrawler(

            const QUrl &startUrl,

            const QStringList &urlPatternsIncluded,

            const QStringList &urlPatternsExcluded,

            const QStringList &linkClasses,

            const int &maxNodes,

            const int &maxLinksPerPage,

            const bool &intLinks,

            const bool &childLinks,

            const bool &parentLinks,

            const bool &selfLinks,

            const bool &extLinksIncluded,

            const bool &extLinksCrawl,

            const bool &socialLinks,

            const bool &delayedRequests);


    void slotHandleCrawlerRequestReply();

    void webSpider();


    QString htmlEscaped (QString str) const;


signals:


    void signalWebCrawlParse(QNetworkReply *reply);


    void signalNetworkManagerRequest(const QUrl &currentUrl, const NetworkRequestType &type);


    void signalProgressBoxCreate(const int max=0, const QString msg="Please wait");


    void signalProgressBoxKill(const int max=0);


    void signalProgressBoxUpdate(const int &count=0 );


    void signalGraphSavedStatus(const int &status);


    void signalGraphModified(const bool &undirected,

                             const int &vertices,

                             const int &edges,

                             const qreal &density,

                             const bool &notSaved=true);


    void signalGraphLoaded (const int &fileType,

                            const QString &fileName=QString(),

                            const QString &netName=QString(),

                            const int &totalNodes=0,

                            const int &totalLinks=0,

                            const qreal &density=0,

                            const qint64 &elapsedTime=0,

                            const QString &message=QString() );


    void statusMessage (const QString &message);


    void signalDatasetDescription(QString);


    void signalNodeClickedInfo(const int &number=0,

                                    const QPointF &p=QPointF(),

                                    const QString &label=QString(),

                                    const int &inDegree=0,

                                    const int &outDegree=0);


    void signalEdgeClicked (const MyEdge &edge=MyEdge(), const bool &openMenu=false);


    void signalRelationAddToMW(const QString &newRelation);


    void signalRelationsClear();


    void signalRelationRenamedToMW(const QString &newRelName);


    void signalRelationChangedToGW(int);


    void signalRelationChangedToMW(const int &relIndex=RAND_MAX);


    void signalSelectionChanged(const int &selectedVertices,

                                const int &selectedEdges);


    void signalPromininenceDistributionChartUpdate(QAbstractSeries *series,

                                                   QAbstractAxis *axisX=Q_NULLPTR,

                                                   const qreal &min=0,

                                                   const qreal &max=0,

                                                   QAbstractAxis *axisY=Q_NULLPTR,

                                                   const qreal &minF=0,

                                                   const qreal &maxF=0);


    void signalDrawNode( const QPointF &p,

                         const int &num,

                         const int &size,

                         const QString &nodeShape,

                         const QString &nodeIconPath,

                         const QString &nodeColor,

                         const QString &numberColor, const int &numSize,

                         const int &numDistance,

                         const QString &label,

                         const QString &labelColor, const int &labelSize,

                         const int &labelDistance

                         );


    //signal to GW to erase a node

    void signalRemoveNode (int );


    //signal GW to draw an edge

    void signalDrawEdge ( const int &v1,

                          const int &v2,

                          const qreal &weight,

                          const QString &label="",

                          const QString &color="black",

                          const int &type=0,

                          const bool &drawArrows=true,

                          const bool &bezier=false,

                          const bool &weightNumbers=false);


    //signal to GW

    void signalRemoveEdge(const int &v1, const int &v2, const bool &removeReverse);


    void signalSetEdgeVisibility (const int &relation,

                                  const int &source,

                                  const int &target,

                                  const bool &toggle,

                                  const bool &preserveReverseEdge=false,

                                  const int &edgeWeight= 1,

                                  const int &reverseEdgeWeight = 1);    // The last two are used only if we need to draw the edge


    void setVertexVisibility(const int &number, const bool &toggle);


    void setNodePos(const int &, const qreal &, const qreal &);


    void signalNodesFound(const QList<int> foundList);


    void setNodeSize(const int &v, const int &size);


    void setNodeShape(const int &v, const QString &shape, const QString &iconPath=QString());


    void setNodeColor(const int &v, const QString &color);


    void setNodeLabel(const int &v, const QString &label);


    void setNodeNumberColor(const int &v, const QString &color);


    void setNodeNumberSize(const int &v, const int &size);


    void setNodeNumberDistance(const int &v, const int &distance);


    void setNodeLabelSize(const int &v, const int &size);


    void setNodeLabelColor(const int &v, const QString &color);


    void setNodeLabelDistance(const int &v, const int &distance);


    void setEdgeWeight (const int &v1, const int &v2, const qreal &weight);

    void signalEdgeType(const int &v1,

                        const int &v2,

                        const int &type);

    void setEdgeColor(const int &v1,

                         const int &v2,

                         const QString &color);

    void setEdgeLabel (const int &v1,

                       const int &v2,

                       const QString &label);

    void addGuideCircle(const double&, const double&, const double&);

    void addGuideHLine (const double &y0);


public:


    enum ModStatus {

        NewNet          = -1,

        SavedUnchanged  = 0,

        MinorOptions    = 1,

        VertexMetadata  = 2,

        EdgeMetadata    = 3,

        VertexPositions = 4,

        MajorChanges    = 10,

        VertexCount     = 11,

        EdgeCount       = 12,

        VertexEdgeCount = 13,

    };


    enum Clustering {

        Single_Linkage   = 0, //"single-link" or minimum

        Complete_Linkage = 1, // "complete-link or maximum

        Average_Linkage  = 2, //mean or "average-linkage" or UPGMA


    };


    /* INIT AND CLEAR*/

    Graph(const int &reserveVerticesSize = 5000, const int &reserveEdgesPerVertexSize = 500);

    ~Graph();


    void clear(const QString &reason="");


    /*FILES (READ AND WRITE)*/


    QString getFileName() const;


    void setFileName(const QString &fileName);


    QString getName() const;


    void setName(const QString &graphName);


    bool isSaved() const;


    bool isLoaded() const;


    int getFileFormat() const;


    void setFileFormat(const int &fileFormat);


    bool isFileFormatExportSupported(const int &fileFormat) const;


    void setModStatus(const int &graphNewStatus, const bool&signalMW=true);


    bool isModified() const ;


    void loadFile (const QString fileName,

                    const QString codecName,

                    const int format,

                    const QString delimiter=QString(),

                    const int sm_two_mode = 1,

                    const bool sm_has_labels=false);


    void saveToFile(const QString &fileName,

                   const int &fileType,

                   const bool &saveEdgeWeights=true,

                   const bool &saveZeroWeightEdges=false);


    bool saveToPajekFormat (const QString &fileName,

                                 QString networkName="",

                                 int maxWidth=0, int maxHeight=0);


    bool saveToAdjacencyFormat (const QString &fileName,

                                     const bool &saveEdgeWeights=true);


    bool saveToGraphMLFormat (const QString &fileName,

                             const bool &saveZeroWeightEdges=false,

                                   QString networkName="",

                                   int maxWidth=0, int maxHeight=0);


    bool saveToDotFormat (QString fileName);


    QString graphMatrixTypeToString(const int &matrixType) const;


    int graphMatrixStrToType(const QString &matrix) const;


    QString graphMetricTypeToString(const int &metricType) const;


    int graphMetricStrToType(const QString &metricStr) const;


    QString graphClusteringMethodTypeToString(const int &methodType) const;


    int graphClusteringMethodStrToType(const QString &method) const;


    /* RELATIONS */

    int relations();


    void relationsClear();


    void relationAdd(const QString &relName, const bool &changeRelation=false);


    /* VERTICES */

    int vertexNumberMax();


    int vertexNumberMin();


    int vertexDegreeOut(int);


    int vertexDegreeIn(int);


    QList<int> vertexNeighborhoodList(const int &v1);

    QSet<int> vertexNeighborhoodSet(const int &v1);


    bool vertexIsolated(const int &v1) const;


    int vertexExists(const int &v1 );


    int vertexExists(const QString &label);


    bool vertexFindByNumber (const QStringList &numList);


    bool vertexFindByLabel (const QStringList &labelList);


    bool vertexFindByIndexScore(const int &index,

                                const QStringList &thresholds,

                                const bool &considerWeights,

                                const bool &inverseWeights=false,

                                const bool &dropIsolates=false

                                );


    void vertexRemove (const int &v1);


    void vertexSizeInit (const int);


    void vertexSizeSet(const int &v, const int &newsize);


    int vertexSize(const int &v) const;


    void vertexShapeSetDefault (const QString, const QString &iconPath=QString());


    void vertexShapeSet(const int &v, const QString &shape, const QString &iconPath=QString());


    QString vertexShape(const int &v);


    QString vertexShapeIconPath(const int &v);


    bool graphHasVertexCustomIcons () const { return m_graphHasVertexCustomIcons; }


    void vertexColorInit (const QString &color);


    void vertexColorSet(const int &v, const QString &color);


    QColor vertexColor(const int &v) const;


    void vertexNumberColorInit (const QString &color);


    void vertexNumberColorSet(const int &v=0, const QString &color = "#000000" );


    void vertexNumberSizeInit (const int &size);


    void vertexNumberSizeSet(const int &v, const int &newsize );


    void vertexNumberDistanceInit (const int &distance);


    void vertexNumberDistanceSet(const int &v, const int &newDistance );


    void vertexLabelSet(const int &v, const QString &label);


    QString vertexLabel(const int &v) const;


    void vertexLabelsVisibilitySet(bool toggle);


    void vertexLabelSizeInit(int newSize);


    void vertexLabelSizeSet(const int &v, const int &labelSize );


    void vertexLabelColorInit(QString color);


    void vertexLabelColorSet(const int &v1, const QString &color);


    void vertexLabelDistanceInit (const int &distance);


    void vertexLabelDistanceSet(const int &v, const int &newDistance );


    void vertexLabelDistanceAllSet (const int &newDistance);


    void vertexPosSet(const int &v, const int &x, const int &y);


    QPointF vertexPos(const int &v1) const;


    int vertexClicked() const;


    int vertices(const bool &dropIsolates=false, const bool &countAll=false, const bool &recount=false) ;


    int vertexEdgesOutbound (int i) ;


    int vertexEdgesInbound (int i) ;


    int verticesWithOutboundEdges();


    int verticesWithInboundEdges();


    int verticesWithReciprocalEdges();


    QList<int> verticesListIsolated();


    QList<int> verticesList();


    QSet<int> verticesSet();


    void verticesCreateSubgraph(QList<int> vList,

                                const int &type = SUBGRAPH_CLIQUE,

                                const int &center = 0);


    /* EDGES */


    int edgesEnabled();


    MyEdge edgeClicked();


    qreal edgeExists(const int &v1,

                     const int &v2,

                     const bool &checkReciprocal=false);


    qreal edgeExistsVirtual(const int &v1, const int &v2);


    void edgeOutboundStatusSet (const int &source,

                     const int &target,

                     const bool &toggle=false);


    void edgeInboundStatusSet (const int &target,

                     const int &source,

                     const bool &toggle=false);


    void edgeRemove (const int &v1,

                     const int &v2,

                     const bool &removeReverse=false);


    void edgeRemoveSelected (SelectedEdge &selectedEdge,

                             const bool &removeReverse);


    void edgeRemoveSelectedAll();


    bool edgeSymmetric(const int &v1, const int &v2);


    void edgeTypeSet(const int &v1,

                     const int &v2,

                     const qreal &w,

                     const int &dirType=EdgeType::Directed);


    void edgeWeightSet (const int &v1,

                        const int &v2,

                        const qreal &w,

                        const bool &undirected=false);


    qreal edgeWeight(const int &v1, const int &v2) const;


    void edgeWeightNumbersVisibilitySet (const bool &toggle);


    void edgeLabelSet(const int &v1, const int &v2, const QString &label);


    QString edgeLabel (const int &v1, const int &v2) const;


    void edgeLabelsVisibilitySet (const bool &toggle);


    void edgeColorInit(const QString &);


    void edgeColorSet(const int &v1, const int &v2, const QString &color);


    QString edgeColor (const int &v1, const int &v2);


    bool edgeColorAllSet(const QString &color, const int &threshold=RAND_MAX);


    /* GRAPH methods */


    bool isEmpty() const;


    QList<int> getSelectedVertices() const;


    int getSelectedVerticesCount() const;


    int getSelectedVerticesMin() const;


    int getSelectedVerticesMax() const;


    QList<SelectedEdge> getSelectedEdges() const;


    int getSelectedEdgesCount() const;


    int getGeodesicsCount();


    qreal graphDensity();


    bool isWeighted();


    void setWeighted(const bool &toggle=true);


    qreal graphReciprocity();


    bool isSymmetric();


    void setSymmetric();


    void addRelationSymmetricStrongTies(const bool &allRelations=false);


    void relationAddCocitation();


    void graphDichotomization(const qreal threshold);


    void setDirected(const bool &toggle=true, const bool &signalMW=true);


    void setUndirected(const bool &toggle=true, const bool &signalMW=true);


    bool isDirected();


    bool isUndirected();


    bool isConnected();


    void createMatrixAdjacency(const bool dropIsolates=false,

                                    const bool considerWeights=true,

                                    const bool inverseWeights=false,

                                    const bool symmetrize=false );


    bool createMatrixAdjacencyInverse(const QString &method="lu");


    void createMatrixSimilarityMatching(Matrix &AM,

                                             Matrix &SEM,

                                             const int &measure=METRIC_SIMPLE_MATCHING,

                                             const QString &varLocation="Rows",

                                             const bool &diagonal=false,

                                             const bool &considerWeights=true);


    void createMatrixSimilarityPearson (Matrix &AM,

                                             Matrix &PCC,

                                             const QString &varLocation="Rows",

                                             const bool &diagonal=false);


    void createMatrixDissimilarities(Matrix &INPUT_MATRIX,

                                          Matrix &DSM,

                                          const int &metric,

                                          const QString &varLocation,

                                          const bool &diagonal,

                                          const bool &considerWeights);


    /* REPORT EXPORTS */

    void setReportsDataDir(const QString &reportsDir);

    void setReportsRealNumberPrecision (const int & precision);

    void setReportsLabelLength(const int &length);

    void setReportsChartType(const int &type);


    void writeDataSetToFile(const QString dir, const QString );


    void writeMatrixAdjacencyTo(QTextStream& os,

                                const bool &saveEdgeWeights=true);


    void writeReciprocity( const QString fileName,

                           const bool considerWeights=false);


    void writeMatrix(const QString &fileName,

                     const int &matrix=MATRIX_ADJACENCY,

                     const bool &considerWeights=true,

                     const bool &inverseWeights=false,

                     const bool &dropIsolates=false,

                     const QString &varLocation="Rows",

                     const bool &simpler=false);


    void writeMatrixHTMLTable(QTextStream &outText, Matrix &M,

                              const bool &markDiag=true,

                              const bool &plain=false,

                              const bool &printInfinity=true,

                              const bool &dropIsolates=false);


    void writeMatrixAdjacency(const QString fileName,

                              const bool &markDiag=true);


    void writeMatrixAdjacencyPlot(const QString fileName,

                                      const bool &simpler=false);


    void writeMatrixAdjacencyInvert(const QString &filename,

                                    const QString &method);


    void writeMatrixLaplacianPlainText(const QString &filename);

    void writeMatrixDegreeText(const QString &filename);


    void writeMatrixDistancesPlainText(const QString &fn,

                                       const bool &considerWeights,

                                       const bool &inverseWeights,

                                       const bool &dropIsolates);


    void writeMatrixShortestPathsPlainText(const QString &fn,

                                               const bool &considerWeights,

                                               const bool &inverseWeights);


    void writeMatrixDissimilarities(const QString fileName,

                                    const QString &metricStr,

                                    const QString &varLocation,

                                    const bool &diagonal,

                                    const bool &considerWeights) ;


    void writeMatrixSimilarityMatchingPlain(const QString fileName,

                                            const int &measure=METRIC_SIMPLE_MATCHING,

                                            const QString &matrix = "adjacency",

                                            const QString &varLocation="rows",

                                            const bool &diagonal=false,

                                            const bool &considerWeights=true);


    void writeMatrixSimilarityMatching(const QString fileName,

                                       const QString &measure="Simple",

                                       const QString &matrix = "adjacency",

                                       const QString &varLocation="rows",

                                       const bool &diagonal=false,

                                       const bool &considerWeights=true);


    void writeMatrixSimilarityPearson(const QString fileName,

                                      const bool considerWeights,

                                      const QString &matrix = "adjacency",

                                      const QString &varLocation="rows",

                                      const bool &diagonal=false);


    void writeMatrixSimilarityPearsonPlainText(const QString fileName,

                                               const bool considerWeights,

                                               const QString &matrix = "adjacency",

                                               const QString &varLocation="rows",

                                               const bool &diagonal=false);


    void writeEccentricity( const QString fileName,

                            const bool considerWeights=false,

                            const bool inverseWeights=false,

                            const bool dropIsolates=false);


 //   friend QTextStream& operator <<  (QTextStream& os, Graph& m);


    void writeCentralityDegree(const QString,

                               const bool weights,

                               const bool dropIsolates);


    void writeCentralityCloseness(const QString,

                                  const bool weights,

                                  const bool inverseWeights,

                                  const bool dropIsolates);


    void writeCentralityClosenessInfluenceRange(const QString,

                                                const bool weights,

                                                const bool inverseWeights,

                                                const bool dropIsolates);


    void writeCentralityBetweenness(const QString,

                                    const bool weights,

                                    const bool inverseWeights,

                                    const bool dropIsolates);


    void writeCentralityPower(const QString,

                              const bool weigths,

                              const bool inverseWeights,

                              const bool dropIsolates);


    void writeCentralityStress(const QString,

                               const bool weigths,

                               const bool inverseWeights,

                               const bool dropIsolates);


    void writeCentralityEccentricity(const QString,

                                     const bool weigths,

                                     const bool inverseWeights,

                                     const bool dropIsolates);


    void writeCentralityInformation(const QString,

                                    const bool weigths,

                                    const bool inverseWeights);


    void writeCentralityEigenvector(const QString,

                                    const bool &weigths=true,

                                    const bool &inverseWeights = false,

                                    const bool &dropIsolates=false);


    void writePrestigeDegree(const QString, const bool weights,

                             const bool dropIsolates);


    void writePrestigeProximity(const QString, const bool weights,

                                const bool inverseWeights,

                                const bool dropIsolates);


    void writePrestigePageRank(const QString, const bool Isolates=false);


    bool writeClusteringHierarchical(const QString &fileName,

                                     const QString &varLocation,

                                     const QString &matrix = "Adjacency",

                                     const QString &metric = "Manhattan",

                                     const QString &method = "Complete",

                                     const bool &diagonal = false,

                                     const bool &dendrogram = false,

                                     const bool &considerWeights=true,

                                     const bool &inverseWeights=false,

                                     const bool &dropIsolates=false);


    void writeClusteringHierarchicalResultsToStream(QTextStream& outText,

                                                    const int N,

                                               const bool &dendrogram = false);


    bool writeCliqueCensus( const QString &fileName,

                            const bool considerWeights);


    void writeClusteringCoefficient(const QString, const bool);


    void writeTriadCensus(const QString, const bool);


    /* DISTANCES, CENTRALITIES & PROMINENCE MEASURES */


    int graphConnectednessFull (const bool updateProgress=false) ;


    bool graphReachable(const int &v1, const int &v2) ;


    void createMatrixReachability() ;


    int graphDiameter(const bool considerWeights, const bool inverseWeights);


    int graphDistanceGeodesic(const int &v1,

                              const int &v2,

                              const bool &considerWeights=false,

                              const bool &inverseWeights=true);


    qreal graphDistanceGeodesicAverage(const bool considerWeights,

                                       const bool inverseWeights,

                                       const bool dropIsolates);


    void graphDistancesGeodesic(const bool &computeCentralities=false,

                                const bool &considerWeights=false,

                                const bool &inverseWeights=true,

                                const bool &dropIsolates=false);


    void graphMatrixDistanceGeodesicCreate(const bool &considerWeights=false,

                                     const bool &inverseWeights=true,

                                     const bool &dropIsolates=false);


    void graphMatrixShortestPathsCreate(const bool &considerWeights=false,

                                        const bool &inverseWeights=true,

                                        const bool &dropIsolates=false) ;


    int getProminenceIndexByName(const QString &prominenceIndexName);


    void prominenceDistribution(const int &index,

                                const ChartType &type,

                                const QString &distImageFileName=QString());


    void prominenceDistributionBars(const H_StrToInt &discreteClasses,

                                    const QString &name,

                                    const QString &distImageFileName);


    void prominenceDistributionArea(const H_StrToInt &discreteClasses,

                                    const QString &name,

                                    const QString &distImageFileName);


    void prominenceDistributionSpline(const H_StrToInt &discreteClasses,

                                      const QString &seriesName,

                                      const QString &distImageFileName);


    void centralityDegree(const bool &considerWeights=true,

                          const bool &dropIsolates=false);


    void centralityInformation(const bool considerWeights=false,

                               const bool inverseWeights=false);


    void centralityEigenvector(const bool &considerWeights=false,

                               const bool &inverseWeights=false,

                               const bool &dropIsolates=false);


    void centralityClosenessIR(const bool considerWeights=false,

                               const bool inverseWeights=false,

                               const bool dropIsolates=false);


    void prestigeDegree(const bool &considerWeights, const bool &dropIsolates=false);


    void prestigePageRank(const bool &dropIsolates=false);


    void prestigeProximity(const bool considerWeights=false,

                           const bool inverseWeights=false,

                           const bool dropIsolates=false);


    /* REACHABILITY AND WALKS */


    int walksBetween(int v1, int v2,int length);


    void graphWalksMatrixCreate(const int &N=0,

                                const int &length=0,

                                const bool &updateProgress=false);


    void writeWalksTotalMatrixPlainText(const QString &fn);


    void writeWalksOfLengthMatrixPlainText(const QString &fn, const int &length);


    void writeMatrixWalks (const QString &fn,

                           const int &length=0,

                           const bool &simpler=false);


    QList<int> vertexinfluenceRange(int v1);


    QList<int> vertexinfluenceDomain(int v2);


    void writeReachabilityMatrixPlainText( const QString &fn,

                                           const bool &dropIsolates=false);


    qreal numberOfTriples(int v1);


    /* CLIQUES, CLUSTERING, TRIADS */

    void graphCliques(QSet<int> R=QSet<int>(), QSet<int> P=QSet<int>(), QSet<int> X=QSet<int>() );


    void graphCliqueAdd (const QList<int> &clique);


    int graphCliquesContaining(const int &actor, const int &size=0);


    int graphCliquesOfSize(const int &size );


    bool graphClusteringHierarchical(Matrix &STR_EQUIV,

                                     const QString &varLocation,

                                     const int &metric,

                                     const int &method,

                                     const bool &diagonal=false,

                                     const bool &diagram=false,

                                     const bool &considerWeights=true,

                                     const bool &inverseWeights=false,

                                     const bool &dropIsolates=false);


    qreal clusteringCoefficientLocal(const int &v1);


    qreal clusteringCoefficient (const bool updateProgress=false);


    bool graphTriadCensus();


    void triadType_examine_MAN_label(int, int, int, GraphVertex*,  GraphVertex*, GraphVertex* );

    //  void eccentr_JordanCenter();    // TODO


    /* LAYOUTS */


    void layoutRandom();


    void layoutRadialRandom(const bool &guides=true);


    void layoutCircular(const double &x0,

                        const double &y0,

                        const double &newRadius,

                        const bool &guides=false);


    void layoutByProminenceIndex ( int prominenceIndex,

                                   int layoutType,

                                   const bool &considerWeights=false,

                                   const bool &inverseWeights=false,

                                   const bool &dropIsolates=false);


    void layoutVertexSizeByIndegree();


    void layoutVertexSizeByOutdegree();


    void layoutForceDirectedSpringEmbedder(const int maxIterations);


    void layoutForceDirectedFruchtermanReingold(const int maxIterations);


    void layoutForceDirectedKamadaKawai(const int maxIterations=500,

                                        const bool considerWeights=false,

                                        const bool inverseWeights=false,

                                        const bool dropIsolates=false,

                                        const QString &initialPositions="current");


    qreal graphDistanceEuclidean(const QPointF &a, const QPointF &b);


    qreal graphDistanceEuclidean(const QPointF &a);


    int sign(const qreal &D);


    qreal layoutForceDirected_F_rep(const QString model,

                                    const qreal &dist,

                                    const qreal &optimalDistance);


    qreal layoutForceDirected_F_att(const QString model,

                                    const qreal &dist,

                                    const qreal &optimalDistance) ;


    void layoutForceDirected_Eades_moveNodes(const qreal &c4);


    void layoutForceDirected_FR_moveNodes(const qreal &temperature) ;


    qreal layoutForceDirected_FR_temperature(const int iteration) const;


    qreal computeOptimalDistance(const int &V);


    void compute_angles( const QPointF &Delta,

                         const qreal &dist,

                         qreal &angle1,

                         qreal &angle2,

                         qreal &degrees1,

                         qreal &degrees2 );


    /* CRAWLER */

    void webCrawlTerminateThreads (QString reason);


    void randomizeThings();


    void randomNetErdosCreate (  const int &N,

                                 const QString &model,

                                 const int &m,

                                 const qreal &p,

                                 const QString &mode,

                                 const bool &diag);


    void randomNetScaleFreeCreate (const int &N,

                                    const int &power,

                                    const int &m0,

                                    const int &m,

                                    const qreal &alpha,

                                    const QString &mode);


    void randomNetSmallWorldCreate(const int &N, const int &degree,

                                   const double &beta, const QString &mode);


    void randomNetRingLatticeCreate (const int &N, const int &degree,

                                      const bool updateProgress=false);


    void randomNetRegularCreate (const int &N,

                                    const int &degree,

                                    const QString &mode,

                                    const bool &diag);


    void randomNetLatticeCreate(const int &N,

                                const int &length,

                                const int &dimension,

                                const int &neighborhoodLength,

                                const QString &mode,

                                const bool &circular=false);


    int factorial (int);


    H_Int vpos;


    // Stores the number of vertices at distance n from a given vertex

    H_f_i sizeOfNthOrderNeighborhood;


    /* maps have O(logN) lookup complexity */

    /* Consider using tr1::hashmap which has O(1) lookup, but this is not ISO C++ yet :(   */


private:


    void edgeAdd (const int &v1,

                  const int &v2,

                  const qreal &weight,

                  const int &type,

                  const QString &label,

                  const QString &color

                  );


    void BFS(const int &s,

             const int &si,

             const bool &computeCentralities=false,

             const bool &dropIsolates=false);


    void dijkstra(const int &s,

                  const int &si,

                  const bool &computeCentralities=false,

                  const bool &inverseWeights=false,

                  const bool &dropIsolates=false);


    void minmax(qreal C,

                GraphVertex *v,

                qreal &max,

                qreal &min,

                int &maxNode, int &minNode

              );


    void resolveClasses ( qreal C,

                          H_StrToInt &discreteClasses,

                          int &classes);


    void resolveClasses ( qreal C,

                           H_StrToInt &discreteClasses,

                           int &classes, int name);


    VList m_graph;                              // List of pointers to the vertices. Each vertex stores all info: links, colors, etc


    Parser *file_parser;                        // Our file loader threaded class.


    WebCrawler *web_crawler;                     // Our web crawler threaded class. This will parse the downloaded HTML.


    QQueue<QUrl> *urlQueue;                     // A queue where the crawler will put urls for the network manager to download


    int m_crawler_max_urls;                      // maximum urls we'll visit (max nodes in the resulted network)

    int m_crawler_visited_urls;                  // A counter of the urls visited.


    QList<QString> m_relationsList;


    QList<int> m_graphFileFormatExportSupported;


    QList<int> triadTypeFreqs;                  //stores triad type frequencies


    QList<int> m_verticesList;

    QList<int> m_verticesIsolatedList;


    QList<int> m_verticesSelected;


    QSet<int> m_verticesSet;


    QList<SelectedEdge> m_selectedEdges;


    QMultiHash <int, int> influenceRanges, influenceDomains;


    QMultiHash <int, int> m_vertexPairsNotConnected;

    QHash <int, int> m_vertexPairsUnilaterallyConnected;


    QMultiMap <int, L_int > m_cliques;

    QHash <int, QSet<int> > neighboursHash;


    QList <qreal> m_clusteringLevel;

    QMap <int, V_int> m_clustersPerSequence;


    QMap<QString, V_int> m_clustersByName;

    QMap<int, V_str> m_clusterPairNamesPerSeq;


    Matrix  SIGMA, DM, sumM, invAM, AM, invM, WM;

    Matrix XM, XSM, XRM, CLQM;


    stack<int> Stack;


    H_StrToInt discreteDPs, discreteSDCs, discreteCCs, discreteBCs, discreteSCs;

    H_StrToInt discreteIRCCs, discreteECs, discreteEccentricities;

    H_StrToInt discretePCs, discreteICs,  discretePRPs, discretePPs, discreteEVCs;


    QString m_reportsDataDir;

    int m_reportsRealPrecision;

    int m_reportsLabelLength;

    ChartType m_reportsChartType;


    int m_fieldWidth, m_curRelation, m_fileFormat, m_vertexClicked;


    MyEdge m_clickedEdge;


    qreal edgeWeightTemp, edgeReverseWeightTemp;

    qreal meanSDC, varianceSDC;

    qreal meanSCC, varianceSCC;

    qreal meanIRCC, varianceIRCC;

    qreal meanSBC, varianceSBC;

    qreal meanSSC, varianceSSC;

    qreal meanEC, varianceEC;

    qreal meanSPC, varianceSPC;

    qreal meanIC, varianceIC;

    qreal meanEVC, varianceEVC;

    qreal meanSDP, varianceSDP;

    qreal meanPP, variancePP;

    qreal meanPRP, variancePRP;

    qreal minEccentricity, maxEccentricity;

    qreal minSDP, maxSDP, sumDP, sumSDP, groupDP;

    qreal minSDC, maxSDC, sumDC, sumSDC, groupDC;

    qreal minSCC, maxSCC, nomSCC, denomSCC, sumCC, sumSCC, groupCC, maxIndexCC;

    qreal minIRCC, maxIRCC, nomIRCC, denomIRCC, sumIRCC, groupIRCC;

    qreal minSBC, maxSBC, nomSBC, denomSBC, sumBC, sumSBC, groupSBC, maxIndexBC;

    qreal minSPC, maxSPC, nomSPC, denomSPC, t_sumIC, sumSPC, groupSPC, maxIndexPC;

    qreal minSSC, maxSSC, sumSC, sumSSC, groupSC, maxIndexSC;

    qreal minEC, maxEC, nomEC, denomEC, sumEC, groupEC, maxIndexEC;

    qreal minIC, maxIC, nomIC, denomIC, sumIC, maxIndexIC;

    qreal minEVC, maxEVC, nomEVC, denomEVC, sumEVC, sumSEVC, groupEVC;

    qreal minPRP, maxPRP, nomPRC, denomPRC, sumPC, t_sumPRP, sumPRP;

    qreal minPP, maxPP, nomPP, denomPP, sumPP, groupPP;


    qreal minCLC, maxCLC, averageCLC,varianceCLC, d_factor;

    int maxNodeCLC, minNodeCLC;

    int classesSDP, maxNodeDP, minNodeDP;

    int classesSDC, maxNodeSDC, minNodeSDC;

    int classesSCC, maxNodeSCC, minNodeSCC;

    int classesIRCC, maxNodeIRCC, minNodeIRCC;

    int classesSBC, maxNodeSBC, minNodeSBC;

    int classesSPC, maxNodeSPC, minNodeSPC;

    int classesSSC, maxNodeSSC, minNodeSSC;

    int classesEC, maxNodeEC, minNodeEC;

    int classesEccentricity, maxNodeEccentricity, minNodeEccentricity;

    int classesIC, maxNodeIC, minNodeIC;

    int classesPRP, maxNodePRP, minNodePRP;

    int classesPP, maxNodePP, minNodePP;

    int classesEVC, maxNodeEVC, minNodeEVC;

    qreal sizeOfComponent;


    int m_graphModStatus;

    int m_reserveEdgesPerVertexSize;

    int m_totalVertices, m_totalEdges, m_graphDiameter, initVertexSize;

    int initVertexLabelSize, initVertexNumberSize;

    int initVertexNumberDistance, initVertexLabelDistance;

    bool order;

    bool initEdgeWeightNumbers, initEdgeLabels;

    qreal m_graphAverageDistance, m_graphGeodesicsCount;

    qreal m_graphDensity;

    qreal m_graphSumDistance;

    qreal m_graphReciprocityArc, m_graphReciprocityDyad;

    int m_graphReciprocityTiesReciprocated;

    int m_graphReciprocityTiesNonSymmetric;

    int m_graphReciprocityTiesTotal;

    int m_graphReciprocityPairsReciprocated;

    int m_graphReciprocityPairsTotal;


    bool m_graphHasVertexCustomIcons;


    int outboundEdgesVert, inboundEdgesVert, reciprocalEdgesVert;


    qreal canvasWidth, canvasHeight;

    bool calculatedEdges;

    bool calculatedVertices, calculatedVerticesList, calculatedVerticesSet;

    bool calculatedAdjacencyMatrix, calculatedDistances, calculatedCentralities;

    bool calculatedIsolates;

    bool calculatedEVC;

    bool calculatedDP, calculatedDC, calculatedPP;

    bool calculatedIRCC, calculatedIC, calculatedPRP;

    bool calculatedTriad;

    bool calculatedGraphSymmetry, calculatedGraphReciprocity;

    bool calculatedGraphDensity, calculatedGraphWeighted;

    bool m_graphIsDirected, m_graphIsSymmetric, m_graphIsWeighted, m_graphIsConnected;


    int csRecDepth;


    QString m_fileName, m_graphName, initEdgeColor, initVertexColor,

        initVertexNumberColor, initVertexLabelColor;

    QString initVertexShape, initVertexIconPath;

    QString htmlHead, htmlHeadLight, htmlEnd;


    QDateTime actualDateTime;

};


#endif


Chart
Definition chart.h:41

GraphVertex
Definition graphvertex.h:51

Graph
The Graph class This is the main class for a Graph, used in conjuction with GraphVertex,...
Definition graph.h:98

Graph::vertexNumberColorSet
void vertexNumberColorSet(const int &v=0, const QString &color="#000000")
Graph::vertexColorSet Changes the color of vertex v1.
Definition graph.cpp:1742

Graph::maxIRCC
qreal maxIRCC
Definition graph.h:1263

Graph::signalSelectionChanged
void signalSelectionChanged(const int &selectedVertices, const int &selectedEdges)

Graph::m_vertexPairsUnilaterallyConnected
QHash< int, int > m_vertexPairsUnilaterallyConnected
Definition graph.h:1216

Graph::denomIC
qreal denomIC
Definition graph.h:1268

Graph::XSM
Matrix XSM
Definition graph.h:1228

Graph::factorial
int factorial(int)
Definition graph.cpp:15606

Graph::initVertexNumberSize
int initVertexNumberSize
Definition graph.h:1295

Graph::calculatedIC
bool calculatedIC
Definition graph.h:1320

Graph::reciprocalEdgesVert
int reciprocalEdgesVert
Definition graph.h:1311

Graph::signalRelationChangedToGW
void signalRelationChangedToGW(int)

Graph::canvasSizeSet
void canvasSizeSet(const int &width, const int &height)
Sets the size of the canvas.
Definition graph.cpp:438

Graph::signalEdgeType
void signalEdgeType(const int &v1, const int &v2, const int &type)

Graph::getSelectedEdges
QList< SelectedEdge > getSelectedEdges() const
Returns a QList of user-selected edges in pair<int,int>
Definition graph.cpp:3300

Graph::m_totalVertices
int m_totalVertices
Definition graph.h:1294

Graph::denomPRC
qreal denomPRC
Definition graph.h:1270

Graph::maxPP
qreal maxPP
Definition graph.h:1271

Graph::minIC
qreal minIC
Definition graph.h:1268

Graph::varianceSDC
qreal varianceSDC
Definition graph.h:1247

Graph::getProminenceIndexByName
int getProminenceIndexByName(const QString &prominenceIndexName)
Returns the IndexType of the given prominence index name Called from MW::slotEditNodeFind,...
Definition graph.cpp:7379

Graph::minNodeSBC
int minNodeSBC
Definition graph.h:1279

Graph::initVertexShape
QString initVertexShape
Definition graph.h:1330

Graph::isSymmetric
bool isSymmetric()
Returns TRUE if the adjacency matrix of the current relation is symmetric.
Definition graph.cpp:4052

Graph::sumPRP
qreal sumPRP
Definition graph.h:1270

Graph::sumDC
qreal sumDC
Definition graph.h:1261

Graph::vertexCreateAtPosRandomWithLabel
void vertexCreateAtPosRandomWithLabel(const int &i, const QString &label, const bool &signalMW=false)
Creates a new randomly positioned vertex with specific number and label. All other values are from th...
Definition graph.cpp:914

Graph::nomSPC
qreal nomSPC
Definition graph.h:1265

Graph::m_reserveEdgesPerVertexSize
int m_reserveEdgesPerVertexSize
Definition graph.h:1293

Graph::signalRemoveEdge
void signalRemoveEdge(const int &v1, const int &v2, const bool &removeReverse)

Graph::initVertexNumberDistance
int initVertexNumberDistance
Definition graph.h:1296

Graph::prestigePageRank
void prestigePageRank(const bool &dropIsolates=false)
Calculates the PageRank Prestige of each vertex.
Definition graph.cpp:10779

Graph::graphConnectednessFull
int graphConnectednessFull(const bool updateProgress=false)

Graph::getSelectedVerticesCount
int getSelectedVerticesCount() const
Returns count of user-selected vertices.
Definition graph.cpp:3264

Graph::writeMatrixAdjacencyTo
void writeMatrixAdjacencyTo(QTextStream &os, const bool &saveEdgeWeights=true)
Definition graph.cpp:21028

Graph::maxEC
qreal maxEC
Definition graph.h:1267

Graph::vertexShapeSetDefault
void vertexShapeSetDefault(const QString, const QString &iconPath=QString())
Sets the default vertex shape and iconPath.
Definition graph.cpp:1597

Graph::sumBC
qreal sumBC
Definition graph.h:1264

Graph::sumSCC
qreal sumSCC
Definition graph.h:1262

Graph::minNodeSCC
int minNodeSCC
Definition graph.h:1277

Graph::classesSCC
int classesSCC
Definition graph.h:1277

Graph::edgeWeightTemp
qreal edgeWeightTemp
Definition graph.h:1246

Graph::m_graphReciprocityTiesTotal
int m_graphReciprocityTiesTotal
Definition graph.h:1305

Graph::m_reportsLabelLength
int m_reportsLabelLength
Definition graph.h:1239

Graph::classesSSC
int classesSSC
Definition graph.h:1281

Graph::CLQM
Matrix CLQM
Definition graph.h:1228

Graph::setName
void setName(const QString &graphName)
Sets the name of the current graph.
Definition graph.cpp:15644

Graph::writePrestigePageRank
void writePrestigePageRank(const QString, const bool Isolates=false)
Writes the PageRank scores of vertices to a file.
Definition graph.cpp:11023

Graph::initVertexLabelSize
int initVertexLabelSize
Definition graph.h:1295

Graph::graphClusteringHierarchical
bool graphClusteringHierarchical(Matrix &STR_EQUIV, const QString &varLocation, const int &metric, const int &method, const bool &diagonal=false, const bool &diagram=false, const bool &considerWeights=true, const bool &inverseWeights=false, const bool &dropIsolates=false)
Performs an hierarchical clustering process (Johnson, 1967) on a given NxN distance/dissimilarity mat...
Definition graph.cpp:13936

Graph::sumSSC
qreal sumSSC
Definition graph.h:1266

Graph::sumCC
qreal sumCC
Definition graph.h:1262

Graph::m_graphIsWeighted
bool m_graphIsWeighted
Definition graph.h:1324

Graph::randomNetRingLatticeCreate
void randomNetRingLatticeCreate(const int &N, const int &degree, const bool updateProgress=false)
Creates a random ring lattice network.
Definition graph.cpp:11861

Graph::web_crawler
WebCrawler * web_crawler
Definition graph.h:1190

Graph::maxIndexEC
qreal maxIndexEC
Definition graph.h:1267

Graph::m_graphIsSymmetric
bool m_graphIsSymmetric
Definition graph.h:1324

Graph::writeMatrixWalks
void writeMatrixWalks(const QString &fn, const int &length=0, const bool &simpler=false)
Calls graphWalksMatrixCreate() to compute walks and writes the Walks of given length matrix to a file...
Definition graph.cpp:12337

Graph::vertexLabelDistanceInit
void vertexLabelDistanceInit(const int &distance)
Changes the default distance of vertex labels.
Definition graph.cpp:2035

Graph::relationCurrentName
QString relationCurrentName() const
Gets the current relation name.
Definition graph.cpp:669

Graph::setNodeNumberDistance
void setNodeNumberDistance(const int &v, const int &distance)

Graph::minNodeEC
int minNodeEC
Definition graph.h:1282

Graph::graphDistanceGeodesic
int graphDistanceGeodesic(const int &v1, const int &v2, const bool &considerWeights=false, const bool &inverseWeights=true)
Returns the geodesic distance (length of shortest path) from vertex v1 to vertex v2.
Definition graph.cpp:4625

Graph::edgeClicked
MyEdge edgeClicked()
Returns clicked edge.
Definition graph.cpp:2532

Graph::layoutForceDirectedKamadaKawai
void layoutForceDirectedKamadaKawai(const int maxIterations=500, const bool considerWeights=false, const bool inverseWeights=false, const bool dropIsolates=false, const QString &initialPositions="current")
Embeds a Force Directed Placement layout according to the Kamada-Kawai model. In this model,...
Definition graph.cpp:22457

Graph::writeMatrixSimilarityPearson
void writeMatrixSimilarityPearson(const QString fileName, const bool considerWeights, const QString &matrix="adjacency", const QString &varLocation="rows", const bool &diagonal=false)
Calls Graph::createMatrixSimilarityPearson() and writes Pearson Correlation Coefficients to given fil...
Definition graph.cpp:14759

Graph::maxNodeEC
int maxNodeEC
Definition graph.h:1282

Graph::discretePPs
H_StrToInt discretePPs
Definition graph.h:1235

Graph::prominenceDistributionArea
void prominenceDistributionArea(const H_StrToInt &discreteClasses, const QString &name, const QString &distImageFileName)
Computes the distribution of a centrality index scores. The distribution data are returned as QAreaSe...
Definition graph.cpp:7704

Graph::classesEVC
int classesEVC
Definition graph.h:1287

Graph::vertexLabel
QString vertexLabel(const int &v) const
Returns the label of a vertex v1.
Definition graph.cpp:1885

Graph::setFileName
void setFileName(const QString &fileName)
Sets the file name of the current graph.
Definition graph.cpp:15668

Graph::slotHandleCrawlerRequestReply
void slotHandleCrawlerRequestReply()
Gets the reply of a MW network request made by Web Crawler, and emits that reply as is to the Web Cra...
Definition graph.cpp:3636

Graph::signalNetworkManagerRequest
void signalNetworkManagerRequest(const QUrl &currentUrl, const NetworkRequestType &type)

Graph::vertices
int vertices(const bool &dropIsolates=false, const bool &countAll=false, const bool &recount=false)
Gets the number of vertices in the graph.
Definition graph.cpp:2925

Graph::writeCentralityStress
void writeCentralityStress(const QString, const bool weigths, const bool inverseWeights, const bool dropIsolates)
Writes the Stress centralities to a file.
Definition graph.cpp:9234

Graph::m_cliques
QMultiMap< int, L_int > m_cliques
Definition graph.h:1218

Graph::m_clickedEdge
MyEdge m_clickedEdge
Definition graph.h:1244

Graph::signalRelationAddToMW
void signalRelationAddToMW(const QString &newRelation)

Graph::denomSPC
qreal denomSPC
Definition graph.h:1265

Graph::XM
Matrix XM
Definition graph.h:1228

Graph::minmax
void minmax(qreal C, GraphVertex *v, qreal &max, qreal &min, int &maxNode, int &minNode)
Computes minimum and maximum centralities during graphDistancesGeodesic()
Definition graph.cpp:6133

Graph::m_selectedEdges
QList< SelectedEdge > m_selectedEdges
Definition graph.h:1211

Graph::sumPP
qreal sumPP
Definition graph.h:1271

Graph::nomPP
qreal nomPP
Definition graph.h:1271

Graph::writeMatrixHTMLTable
void writeMatrixHTMLTable(QTextStream &outText, Matrix &M, const bool &markDiag=true, const bool &plain=false, const bool &printInfinity=true, const bool &dropIsolates=false)
Writes the matrix M as HTML.
Definition graph.cpp:20890

Graph::vertexClicked
int vertexClicked() const
Returns the number of the clicked vertex.
Definition graph.cpp:1531

Graph::m_curRelation
int m_curRelation
Definition graph.h:1242

Graph::setEdgeWeight
void setEdgeWeight(const int &v1, const int &v2, const qreal &weight)

Graph::calculatedGraphReciprocity
bool calculatedGraphReciprocity
Definition graph.h:1322

Graph::webcrawlerThread
QThread webcrawlerThread
Definition graph.h:101

Graph::signalSetEdgeVisibility
void signalSetEdgeVisibility(const int &relation, const int &source, const int &target, const bool &toggle, const bool &preserveReverseEdge=false, const int &edgeWeight=1, const int &reverseEdgeWeight=1)

Graph::maxNodeDP
int maxNodeDP
Definition graph.h:1275

Graph::minNodePP
int minNodePP
Definition graph.h:1286

Graph::graphMetricTypeToString
QString graphMetricTypeToString(const int &metricType) const
Helper method, return the human readable name of metric type.
Definition graph.cpp:23204

Graph::graphCliqueAdd
void graphCliqueAdd(const QList< int > &clique)
Called from Graph::graphCliques to add a new clique (list of vertices) Adds clique info to each cliqu...
Definition graph.cpp:13275

Graph::m_graphAverageDistance
qreal m_graphAverageDistance
Definition graph.h:1299

Graph::varianceSDP
qreal varianceSDP
Definition graph.h:1256

Graph::m_graphFileFormatExportSupported
QList< int > m_graphFileFormatExportSupported
Definition graph.h:1200

Graph::denomPP
qreal denomPP
Definition graph.h:1271

Graph::isSaved
bool isSaved() const
Returns true if the graph is saved.
Definition graph.cpp:15855

Graph::denomEC
qreal denomEC
Definition graph.h:1267

Graph::minSBC
qreal minSBC
Definition graph.h:1264

Graph::minNodeIC
int minNodeIC
Definition graph.h:1284

Graph::maxIndexIC
qreal maxIndexIC
Definition graph.h:1268

Graph::calculatedGraphDensity
bool calculatedGraphDensity
Definition graph.h:1323

Graph::writeCentralityClosenessInfluenceRange
void writeCentralityClosenessInfluenceRange(const QString, const bool weights, const bool inverseWeights, const bool dropIsolates)
Writes the "improved" closeness centrality indices to a file.
Definition graph.cpp:8727

Graph::sumSC
qreal sumSC
Definition graph.h:1266

Graph::layoutForceDirected_Eades_moveNodes
void layoutForceDirected_Eades_moveNodes(const qreal &c4)
Definition graph.cpp:23009

Graph::vertexCreate
void vertexCreate(const int &number, const int &size, const QString &color, const QString &numColor, const int &numSize, const QString &label, const QString &labelColor, const int &labelSize, const QPointF &p, const QString &shape, const QString &iconPath=QString(), const bool &signalMW=false)
Creates a new vertex.
Definition graph.cpp:770

Graph::createMatrixAdjacencyInverse
bool createMatrixAdjacencyInverse(const QString &method="lu")
Computes the inverse of the current adjacency matrix.
Definition graph.cpp:21461

Graph::signalEdgeClicked
void signalEdgeClicked(const MyEdge &edge=MyEdge(), const bool &openMenu=false)

Graph::m_clusterPairNamesPerSeq
QMap< int, V_str > m_clusterPairNamesPerSeq
Definition graph.h:1225

Graph::m_reportsDataDir
QString m_reportsDataDir
Definition graph.h:1237

Graph::edgeWeightNumbersVisibilitySet
void edgeWeightNumbersVisibilitySet(const bool &toggle)
Changes the visibility of edge weight numbers.
Definition graph.cpp:2713

Graph::signalRelationsClear
void signalRelationsClear()

Graph::edgeColorAllSet
bool edgeColorAllSet(const QString &color, const int &threshold=RAND_MAX)
Changes the color of all enabled edges.
Definition graph.cpp:2737

Graph::getSelectedVerticesMin
int getSelectedVerticesMin() const
Returns min of user-selected vertices.
Definition graph.cpp:3273

Graph::writeCentralityEccentricity
void writeCentralityEccentricity(const QString, const bool weigths, const bool inverseWeights, const bool dropIsolates)
Writes the Eccentricity centralities (aka Harary Graph Centrality) to a file.
Definition graph.cpp:9469

Graph::m_vertexClicked
int m_vertexClicked
Definition graph.h:1242

Graph::minSSC
qreal minSSC
Definition graph.h:1266

Graph::vertexNeighborhoodList
QList< int > vertexNeighborhoodList(const int &v1)
Returns a list of all vertices mutually connected to vertex v1 in the current relation.
Definition graph.cpp:2894

Graph::relations
int relations()
Returns the count of relationships in this Graph.
Definition graph.cpp:732

Graph::graphFileLoaded
void graphFileLoaded(const int &fileType, const QString &fName=QString(), const QString &netName=QString(), const int &totalNodes=0, const int &totalLinks=0, const int &edgeDirType=0, const qint64 &elapsedTime=0, const QString &message=QString())
Stores loaded file name, graph name, sets edge direction type and signals MW to update the UI.
Definition graph.cpp:16000

Graph::setNodeLabelColor
void setNodeLabelColor(const int &v, const QString &color)

Graph::edgeReverseWeightTemp
qreal edgeReverseWeightTemp
Definition graph.h:1246

Graph::verticesWithReciprocalEdges
int verticesWithReciprocalEdges()
Returns the sum of vertices having reciprocal edges.
Definition graph.cpp:3427

Graph::saveToGraphMLFormat
bool saveToGraphMLFormat(const QString &fileName, const bool &saveZeroWeightEdges=false, QString networkName="", int maxWidth=0, int maxHeight=0)
Saves the current graph to a GraphML-formatted file.
Definition graph.cpp:16283

Graph::saveToPajekFormat
bool saveToPajekFormat(const QString &fileName, QString networkName="", int maxWidth=0, int maxHeight=0)
Saves the active graph to a Pajek-formatted file.
Definition graph.cpp:16127

Graph::relationAddCocitation
void relationAddCocitation()
Creates a new symmetric relation by connecting those actors that are cocitated by others....
Definition graph.cpp:4244

Graph::graphMatrixTypeToString
QString graphMatrixTypeToString(const int &matrixType) const
Helper method, return the human readable name of matrix type.
Definition graph.cpp:23097

Graph::sumEC
qreal sumEC
Definition graph.h:1267

Graph::vertexExists
int vertexExists(const int &v1)
Checks if the given vertex exists in the graph.
Definition graph.cpp:984

Graph::variancePRP
qreal variancePRP
Definition graph.h:1258

Graph::setNodeLabelSize
void setNodeLabelSize(const int &v, const int &size)

Graph::graphReachable
bool graphReachable(const int &v1, const int &v2)
Returns true if vertices v1 and v2 are reachable.
Definition graph.cpp:4539

Graph::m_graphDiameter
int m_graphDiameter
Definition graph.h:1294

Graph::file_parserThread
QThread file_parserThread
Definition graph.h:100

Graph::calculatedPRP
bool calculatedPRP
Definition graph.h:1320

Graph::discreteEccentricities
H_StrToInt discreteEccentricities
Definition graph.h:1234

Graph::graphCliques
void graphCliques(QSet< int > R=QSet< int >(), QSet< int > P=QSet< int >(), QSet< int > X=QSet< int >())
Finds all maximal cliques in an undirected (?) graph. Implements the Bron–Kerbosch algorithm,...
Definition graph.cpp:13338

Graph::getFileName
QString getFileName() const
Returns the file name of the current graph, if any.
Definition graph.cpp:15657

Graph::graphMatrixStrToType
int graphMatrixStrToType(const QString &matrix) const
Helper method, return the matrix type of human readable matrix name .
Definition graph.cpp:23155

Graph::graphLoadedTerminateParserThreads
void graphLoadedTerminateParserThreads(QString reason)
Graph::graphLoadedTerminateParserThreads.
Definition graph.cpp:15968

Graph::writeMatrixAdjacencyInvert
void writeMatrixAdjacencyInvert(const QString &filename, const QString &method)
Calls Graph::createMatrixAdjacencyInverse(method) to compute the inverse of the adjacency matrix and ...
Definition graph.cpp:21509

Graph::vertexSize
int vertexSize(const int &v) const
Returns the size of vertex v.
Definition graph.cpp:1585

Graph::setNodeSize
void setNodeSize(const int &v, const int &size)

Graph::denomSCC
qreal denomSCC
Definition graph.h:1262

Graph::m_graphReciprocityTiesNonSymmetric
int m_graphReciprocityTiesNonSymmetric
Definition graph.h:1304

Graph::layoutVertexSizeByOutdegree
void layoutVertexSizeByOutdegree()
Convenience method Changes the size of all nodes to be proportional to their outDegree (Degree Centra...
Definition graph.cpp:21780

Graph::t_sumIC
qreal t_sumIC
Definition graph.h:1265

Graph::m_clustersPerSequence
QMap< int, V_int > m_clustersPerSequence
Definition graph.h:1222

Graph::edgeLabelSet
void edgeLabelSet(const int &v1, const int &v2, const QString &label)
Changes the label of edge v1->v2.
Definition graph.cpp:2834

Graph::writeCliqueCensus
bool writeCliqueCensus(const QString &fileName, const bool considerWeights)
Graph::writeCliqueCensus Calls graphCliques() to compute all cliques (maximal connected subgraphs) of...
Definition graph.cpp:12955

Graph::compute_angles
void compute_angles(const QPointF &Delta, const qreal &dist, qreal &angle1, qreal &angle2, qreal &degrees1, qreal &degrees2)
Graph::compute_angles Computes the two angles of the orthogonal triangle shaped by two points of diff...
Definition graph.cpp:22958

Graph::urlQueue
QQueue< QUrl > * urlQueue
Definition graph.h:1192

Graph::sign
int sign(const qreal &D)
Graph::sign returns the sign of number D as integer (1 or -1)
Definition graph.cpp:22934

Graph::m_verticesSet
QSet< int > m_verticesSet
Definition graph.h:1209

Graph::canvasVisibleY
double canvasVisibleY(const double &y) const
Checks if y is visible inside the canvas usable area and if not returns an adjusted y-coordinate.
Definition graph.cpp:495

Graph::m_verticesIsolatedList
QList< int > m_verticesIsolatedList
Definition graph.h:1205

Graph::minNodePRP
int minNodePRP
Definition graph.h:1285

Graph::writeMatrixLaplacianPlainText
void writeMatrixLaplacianPlainText(const QString &filename)
Computes the Laplacian matrix of the graph and writes it to given file.
Definition graph.cpp:21590

Graph::vertexCreateAtPos
void vertexCreateAtPos(const QPointF &p)
Creates a new vertex in the given position.
Definition graph.cpp:854

Graph::meanIC
qreal meanIC
Definition graph.h:1254

Graph::sumPC
qreal sumPC
Definition graph.h:1270

Graph::influenceRanges
QMultiHash< int, int > influenceRanges
Definition graph.h:1213

Graph::relationPrev
void relationPrev()
Changes graph to previous relation.
Definition graph.cpp:603

Graph::classesSPC
int classesSPC
Definition graph.h:1280

Graph::layoutRadialRandom
void layoutRadialRandom(const bool &guides=true)
Repositions all nodes on the periphery of different circles with random radius.
Definition graph.cpp:21659

Graph::writeMatrixAdjacency
void writeMatrixAdjacency(const QString fileName, const bool &markDiag=true)
Definition graph.cpp:21057

Graph::addGuideHLine
void addGuideHLine(const double &y0)

Graph::groupIRCC
qreal groupIRCC
Definition graph.h:1263

Graph::vertexFindByLabel
bool vertexFindByLabel(const QStringList &labelList)
Finds vertices by their label.
Definition graph.cpp:1079

Graph::prominenceDistribution
void prominenceDistribution(const int &index, const ChartType &type, const QString &distImageFileName=QString())
Computes the distribution of a centrality index score. The distribution is stored as Qt Series depend...
Definition graph.cpp:7436

Graph::variancePP
qreal variancePP
Definition graph.h:1257

Graph::minSDP
qreal minSDP
Definition graph.h:1260

Graph::vertexEdgesOutbound
int vertexEdgesOutbound(int i)
Returns the number of outbound edges (arcs) from vertex v1.
Definition graph.cpp:2652

Graph::calculatedVerticesList
bool calculatedVerticesList
Definition graph.h:1315

Graph::meanIRCC
qreal meanIRCC
Definition graph.h:1249

Graph::maxIndexPC
qreal maxIndexPC
Definition graph.h:1265

Graph::createMatrixDissimilarities
void createMatrixDissimilarities(Matrix &INPUT_MATRIX, Matrix &DSM, const int &metric, const QString &varLocation, const bool &diagonal, const bool &considerWeights)
Calls Matrix:distancesMatrix to compute the dissimilarities matrix DSM of the variables (rows,...
Definition graph.cpp:14534

Graph::discretePRPs
H_StrToInt discretePRPs
Definition graph.h:1235

Graph::writeCentralityEigenvector
void writeCentralityEigenvector(const QString, const bool &weigths=true, const bool &inverseWeights=false, const bool &dropIsolates=false)
Writes the eigenvector centralities to a file.
Definition graph.cpp:6864

Graph::vertexPosSet
void vertexPosSet(const int &v, const int &x, const int &y)
Changes the position of the given vertex.
Definition graph.cpp:1482

Graph::canvasHeight
qreal canvasHeight
Definition graph.h:1313

Graph::sumSEVC
qreal sumSEVC
Definition graph.h:1269

Graph::setNodeLabelDistance
void setNodeLabelDistance(const int &v, const int &distance)

Graph::edgeFilterUnilateral
void edgeFilterUnilateral(const bool &toggle)
Enables or disables unilateral edges in current relationship.
Definition graph.cpp:2473

Graph::sizeOfNthOrderNeighborhood
H_f_i sizeOfNthOrderNeighborhood
Definition graph.h:1139

Graph::setVertexVisibility
void setVertexVisibility(const int &number, const bool &toggle)

Graph::maxNodeSSC
int maxNodeSSC
Definition graph.h:1281

Graph::maxEccentricity
qreal maxEccentricity
Definition graph.h:1259

Graph::minEVC
qreal minEVC
Definition graph.h:1269

Graph::createMatrixReachability
void createMatrixReachability()
Creates the reachability matrix XRM.
Definition graph.cpp:4551

Graph::signalRelationChangedToMW
void signalRelationChangedToMW(const int &relIndex=RAND_MAX)

Graph::maxSPC
qreal maxSPC
Definition graph.h:1265

Graph::signalDrawEdge
void signalDrawEdge(const int &v1, const int &v2, const qreal &weight, const QString &label="", const QString &color="black", const int &type=0, const bool &drawArrows=true, const bool &bezier=false, const bool &weightNumbers=false)

Graph::prominenceDistributionSpline
void prominenceDistributionSpline(const H_StrToInt &discreteClasses, const QString &seriesName, const QString &distImageFileName)
Computes the distribution of a centrality index scores. The distribution data are returned as QSpline...
Definition graph.cpp:7552

Graph::invM
Matrix invM
Definition graph.h:1227

Graph::sumIC
qreal sumIC
Definition graph.h:1268

Graph::varianceIRCC
qreal varianceIRCC
Definition graph.h:1249

Graph::layoutForceDirected_F_rep
qreal layoutForceDirected_F_rep(const QString model, const qreal &dist, const qreal &optimalDistance)
Definition graph.cpp:22895

Graph::getFileFormat
int getFileFormat() const
Returns the format of the last file opened.
Definition graph.cpp:15679

Graph::canvasWidth
qreal canvasWidth
Definition graph.h:1313

Graph::clusteringCoefficient
qreal clusteringCoefficient(const bool updateProgress=false)
Computes local clustering coefficients and returns the network average Clustering Coefficient.
Definition graph.cpp:15212

Graph::resolveClasses
void resolveClasses(qreal C, H_StrToInt &discreteClasses, int &classes)
Checks if score C is a new prominence class If yes, it stores that number in a QHash<QString,...
Definition graph.cpp:6158

Graph::edgeAdd
void edgeAdd(const int &v1, const int &v2, const qreal &weight, const int &type, const QString &label, const QString &color)
Adds a directed edge from v1 to v2 If type == EdgeType::Undirected then it also adds the directed edg...
Definition graph.cpp:2189

Graph::meanEC
qreal meanEC
Definition graph.h:1252

Graph::m_reportsRealPrecision
int m_reportsRealPrecision
Definition graph.h:1238

Graph::vertexColorInit
void vertexColorInit(const QString &color)
Graph::vertexColorInit default vertex color initialization.
Definition graph.cpp:1717

Graph::t_sumPRP
qreal t_sumPRP
Definition graph.h:1270

Graph::m_vertexPairsNotConnected
QMultiHash< int, int > m_vertexPairsNotConnected
Definition graph.h:1215

Graph::vertexLabelColorSet
void vertexLabelColorSet(const int &v1, const QString &color)
Changes the label color of vertex v1 or all vertices if v1 = 0.
Definition graph.cpp:1948

Graph::maxNodeSDC
int maxNodeSDC
Definition graph.h:1276

Graph::graphCliquesContaining
int graphCliquesContaining(const int &actor, const int &size=0)
Definition graph.cpp:13492

Graph::setEdgeLabel
void setEdgeLabel(const int &v1, const int &v2, const QString &label)

Graph::triadType_examine_MAN_label
void triadType_examine_MAN_label(int, int, int, GraphVertex *, GraphVertex *, GraphVertex *)
Definition graph.cpp:15387

Graph::setUndirected
void setUndirected(const bool &toggle=true, const bool &signalMW=true)
Makes the graph undirected or directed.
Definition graph.cpp:4413

Graph::clusteringCoefficientLocal
qreal clusteringCoefficientLocal(const int &v1)
Returns the local clustering coefficient (CLUCOF) of a vertex v1.
Definition graph.cpp:15042

Graph::randomNetRegularCreate
void randomNetRegularCreate(const int &N, const int &degree, const QString &mode, const bool &diag)
Creates a random network where nodes have the same degree.
Definition graph.cpp:11684

Graph::initVertexNumberColor
QString initVertexNumberColor
Definition graph.h:1329

Graph::minEccentricity
qreal minEccentricity
Definition graph.h:1259

Graph::vertexDegreeIn
int vertexDegreeIn(int)
Returns the inDegree (sum of inbound edge weights) of vertex v1.
Definition graph.cpp:2883

Graph::maxPRP
qreal maxPRP
Definition graph.h:1270

Graph::groupDP
qreal groupDP
Definition graph.h:1260

Graph::maxNodeEVC
int maxNodeEVC
Definition graph.h:1287

Graph::sumSDP
qreal sumSDP
Definition graph.h:1260

Graph::edgeClickedSet
void edgeClickedSet(const int &v1, const int &v2, const bool &openMenu=false)
Sets the clicked edge.
Definition graph.cpp:2495

Graph::writePrestigeDegree
void writePrestigeDegree(const QString, const bool weights, const bool dropIsolates)
Writes the Degree Prestige of each node to a file.
Definition graph.cpp:10144

Graph::signalRemoveNode
void signalRemoveNode(int)

Graph::edgesEnabled
int edgesEnabled()
Returns the number |E| of graph - only the enabled edges.
Definition graph.cpp:2624

Graph::discreteSDCs
H_StrToInt discreteSDCs
Definition graph.h:1233

Graph::discreteDPs
H_StrToInt discreteDPs
Definition graph.h:1233

Graph::edgeColorInit
void edgeColorInit(const QString &)
Saves the default edge color Used by random network creation methods.
Definition graph.cpp:2724

Graph::minPRP
qreal minPRP
Definition graph.h:1270

Graph::m_graphReciprocityDyad
qreal m_graphReciprocityDyad
Definition graph.h:1302

Graph::groupCC
qreal groupCC
Definition graph.h:1262

Graph::writeMatrixAdjacencyPlot
void writeMatrixAdjacencyPlot(const QString fileName, const bool &simpler=false)
Writes a visual representation of the adjacency matrix of the graph to the specified file.
Definition graph.cpp:21198

Graph::csRecDepth
int csRecDepth
Definition graph.h:1326

Graph::writeClusteringCoefficient
void writeClusteringCoefficient(const QString, const bool)
Graph::writeClusteringCoefficient Writes the clustering coefficients to a file.
Definition graph.cpp:12608

Graph::sumEVC
qreal sumEVC
Definition graph.h:1269

Graph::writePrestigeProximity
void writePrestigeProximity(const QString, const bool weights, const bool inverseWeights, const bool dropIsolates)
Writes the proximity prestige indices to a file.
Definition graph.cpp:10556

Graph::m_fileName
QString m_fileName
Definition graph.h:1328

Graph::webCrawlTerminateThreads
void webCrawlTerminateThreads(QString reason)
called from Graph, when closing network, to terminate all crawler processes Also called indirectly wh...
Definition graph.cpp:3440

Graph::centralityClosenessIR
void centralityClosenessIR(const bool considerWeights=false, const bool inverseWeights=false, const bool dropIsolates=false)
Computes an "improved" closeness centrality index, IRCC, which can be used on disconnected graphs....
Definition graph.cpp:8606

Graph::signalProgressBoxCreate
void signalProgressBoxCreate(const int max=0, const QString msg="Please wait")

Graph::minNodeEVC
int minNodeEVC
Definition graph.h:1287

Graph::minSPC
qreal minSPC
Definition graph.h:1265

Graph::createMatrixAdjacency
void createMatrixAdjacency(const bool dropIsolates=false, const bool considerWeights=true, const bool inverseWeights=false, const bool symmetrize=false)
Creates an adjacency matrix AM where AM(i,j)=1 if i is connected to j and AM(i,j)=0 if i not connecte...
Definition graph.cpp:21362

Graph::edgeSymmetric
bool edgeSymmetric(const int &v1, const int &v2)
Returns TRUE if edge(v1, v2) is symmetric, i.e. (v1,v2) == (v2,v1).
Definition graph.cpp:2606

Graph::edgeWeight
qreal edgeWeight(const int &v1, const int &v2) const
Returns the weight of the edge v1->v2.
Definition graph.cpp:2702

Graph::setNodeShape
void setNodeShape(const int &v, const QString &shape, const QString &iconPath=QString())

Graph::maxIndexCC
qreal maxIndexCC
Definition graph.h:1262

Graph::nomIRCC
qreal nomIRCC
Definition graph.h:1263

Graph::neighboursHash
QHash< int, QSet< int > > neighboursHash
Definition graph.h:1219

Graph::minNodeEccentricity
int minNodeEccentricity
Definition graph.h:1283

Graph::vertexLabelColorInit
void vertexLabelColorInit(QString color)
Graph::vertexLabelColorInit Changes the default vertex label color.
Definition graph.cpp:1985

Graph::calculatedAdjacencyMatrix
bool calculatedAdjacencyMatrix
Definition graph.h:1316

Graph::getSelectedVerticesMax
int getSelectedVerticesMax() const
Returns max of user-selected vertices.
Definition graph.cpp:3286

Graph::nomPRC
qreal nomPRC
Definition graph.h:1270

Graph::isModified
bool isModified() const
Returns true of graph is modified (edges/vertices added/removed)
Definition graph.cpp:15825

Graph::discreteBCs
H_StrToInt discreteBCs
Definition graph.h:1233

Graph::signalProgressBoxKill
void signalProgressBoxKill(const int max=0)

Graph::vertexLabelSet
void vertexLabelSet(const int &v, const QString &label)
Changes the label of a vertex v1.
Definition graph.cpp:1868

Graph::m_reportsChartType
ChartType m_reportsChartType
Definition graph.h:1240

Graph::htmlEscaped
QString htmlEscaped(QString str) const
Helper method, returns a nice qstring where all html special chars are encoded.
Definition graph.cpp:23315

Graph::classesSDC
int classesSDC
Definition graph.h:1276

Graph::initVertexSize
int initVertexSize
Definition graph.h:1294

Graph::m_relationsList
QList< QString > m_relationsList
Definition graph.h:1198

Graph::getSelectedEdgesCount
int getSelectedEdgesCount() const
Returns the count of user-selected edges.
Definition graph.cpp:3309

Graph::edgeTypeSet
void edgeTypeSet(const int &v1, const int &v2, const qreal &w, const int &dirType=EdgeType::Directed)
Changes the direction type of an existing edge.
Definition graph.cpp:4490

Graph::vertexRemoveDummyNode
void vertexRemoveDummyNode(int)
Deletes a dummy node.
Definition graph.cpp:940

Graph::m_graphDensity
qreal m_graphDensity
Definition graph.h:1300

Graph::m_graphReciprocityPairsReciprocated
int m_graphReciprocityPairsReciprocated
Definition graph.h:1306

Graph::vertexFindByIndexScore
bool vertexFindByIndexScore(const int &index, const QStringList &thresholds, const bool &considerWeights, const bool &inverseWeights=false, const bool &dropIsolates=false)
Finds vertices by their index score.
Definition graph.cpp:1125

Graph::meanSCC
qreal meanSCC
Definition graph.h:1248

Graph::walksBetween
int walksBetween(int v1, int v2, int length)
Calculates and returns the number of walks of a given length between v1 and v2.
Definition graph.cpp:12142

Graph::edgeExists
qreal edgeExists(const int &v1, const int &v2, const bool &checkReciprocal=false)
Checks if there is an edge from v1 to v2 and returns the weight, if the edge exists.
Definition graph.cpp:2548

Graph::m_verticesList
QList< int > m_verticesList
Definition graph.h:1204

Graph::nomSBC
qreal nomSBC
Definition graph.h:1264

Graph::initVertexLabelColor
QString initVertexLabelColor
Definition graph.h:1329

Graph::webSpider
void webSpider()
A loop, that takes urls awaiting in front of the urlQueue, and signals to the MW to make the network ...
Definition graph.cpp:3593

Graph::maxNodeSCC
int maxNodeSCC
Definition graph.h:1277

Graph::writeWalksOfLengthMatrixPlainText
void writeWalksOfLengthMatrixPlainText(const QString &fn, const int &length)
Graph::writeWalksOfLengthMatrixPlainText.
Definition graph.cpp:12300

Graph::influenceDomains
QMultiHash< int, int > influenceDomains
Definition graph.h:1213

Graph::meanSBC
qreal meanSBC
Definition graph.h:1250

Graph::addRelationSymmetricStrongTies
void addRelationSymmetricStrongTies(const bool &allRelations=false)
Creates a new symmetric relation by keeping only strong-ties (mutual links) in the current relation....
Definition graph.cpp:4158

Graph::vertexShapeIconPath
QString vertexShapeIconPath(const int &v)
Returns the IconPath of vertex v1.
Definition graph.cpp:1662

Graph::classesEccentricity
int classesEccentricity
Definition graph.h:1283

Graph::getSelectedVertices
QList< int > getSelectedVertices() const
Returns a QList of user-selected vertices.
Definition graph.cpp:3255

Graph::signalGraphModified
void signalGraphModified(const bool &undirected, const int &vertices, const int &edges, const qreal &density, const bool &notSaved=true)

Graph::vertexPos
QPointF vertexPos(const int &v1) const
Returns the position of the given vertex.
Definition graph.cpp:1495

Graph::varianceSBC
qreal varianceSBC
Definition graph.h:1250

Graph::classesEC
int classesEC
Definition graph.h:1282

Graph::statusMessage
void statusMessage(const QString &message)

Graph::createMatrixSimilarityPearson
void createMatrixSimilarityPearson(Matrix &AM, Matrix &PCC, const QString &varLocation="Rows", const bool &diagonal=false)
The Pearson product-moment correlation coefficient (PPMCC, PCC or Pearson's r) is a measure of the li...
Definition graph.cpp:15004

Graph::createMatrixSimilarityMatching
void createMatrixSimilarityMatching(Matrix &AM, Matrix &SEM, const int &measure=METRIC_SIMPLE_MATCHING, const QString &varLocation="Rows", const bool &diagonal=false, const bool &considerWeights=true)
Calls Matrix:similarityMatrix to compute the similarity matrix SCM of the variables (rows,...
Definition graph.cpp:14736

Graph::setModStatus
void setModStatus(const int &graphNewStatus, const bool &signalMW=true)
Sets the graph modification status.
Definition graph.cpp:15709

Graph::m_graphName
QString m_graphName
Definition graph.h:1328

Graph::maxNodeSBC
int maxNodeSBC
Definition graph.h:1279

Graph::graphDensity
qreal graphDensity()
Gets the graph density (if computed) or computes it again.
Definition graph.cpp:3324

Graph::vertexShapeSet
void vertexShapeSet(const int &v, const QString &shape, const QString &iconPath=QString())
Changes the shape and iconPath of vertex v1, or all vertices if v1=-1.
Definition graph.cpp:1617

Graph::XRM
Matrix XRM
Definition graph.h:1228

Graph::initVertexLabelDistance
int initVertexLabelDistance
Definition graph.h:1296

Graph::vertexSizeInit
void vertexSizeInit(const int)
Sets the initial vertex size.
Definition graph.cpp:1540

Graph::edgeLabelsVisibilitySet
void edgeLabelsVisibilitySet(const bool &toggle)
Toggles the visibility of edge labels.
Definition graph.cpp:2860

Graph::maxNodeSPC
int maxNodeSPC
Definition graph.h:1280

Graph::order
bool order
Definition graph.h:1297

Graph::m_verticesSelected
QList< int > m_verticesSelected
Definition graph.h:1207

Graph::denomEVC
qreal denomEVC
Definition graph.h:1269

Graph::initEdgeWeightNumbers
bool initEdgeWeightNumbers
Definition graph.h:1298

Graph::setNodePos
void setNodePos(const int &, const qreal &, const qreal &)

Graph::edgeWeightSet
void edgeWeightSet(const int &v1, const int &v2, const qreal &w, const bool &undirected=false)
Changes the weight of the edge from vertex v1 to v2 (and optionally of the reverse edge)
Definition graph.cpp:2679

Graph::maxSBC
qreal maxSBC
Definition graph.h:1264

Graph::maxIndexBC
qreal maxIndexBC
Definition graph.h:1264

Graph::calculatedGraphSymmetry
bool calculatedGraphSymmetry
Definition graph.h:1322

Graph::signalGraphLoaded
void signalGraphLoaded(const int &fileType, const QString &fileName=QString(), const QString &netName=QString(), const int &totalNodes=0, const int &totalLinks=0, const qreal &density=0, const qint64 &elapsedTime=0, const QString &message=QString())

Graph::discreteEVCs
H_StrToInt discreteEVCs
Definition graph.h:1235

Graph::m_totalEdges
int m_totalEdges
Definition graph.h:1294

Graph::signalDrawNode
void signalDrawNode(const QPointF &p, const int &num, const int &size, const QString &nodeShape, const QString &nodeIconPath, const QString &nodeColor, const QString &numberColor, const int &numSize, const int &numDistance, const QString &label, const QString &labelColor, const int &labelSize, const int &labelDistance)

Graph::writeMatrixSimilarityMatchingPlain
void writeMatrixSimilarityMatchingPlain(const QString fileName, const int &measure=METRIC_SIMPLE_MATCHING, const QString &matrix="adjacency", const QString &varLocation="rows", const bool &diagonal=false, const bool &considerWeights=true)
Writes similarity matrix based on a matching measure to given file.
Definition graph.cpp:14289

Graph::randomNetLatticeCreate
void randomNetLatticeCreate(const int &N, const int &length, const int &dimension, const int &neighborhoodLength, const QString &mode, const bool &circular=false)
Creates a lattice network.
Definition graph.cpp:11936

Graph::varianceSPC
qreal varianceSPC
Definition graph.h:1253

Graph::writeClusteringHierarchicalResultsToStream
void writeClusteringHierarchicalResultsToStream(QTextStream &outText, const int N, const bool &dendrogram=false)
Writes Hierarchical Clustering results to given output stream Before running this methos,...
Definition graph.cpp:13712

Graph::m_clustersByName
QMap< QString, V_int > m_clustersByName
Definition graph.h:1224

Graph::graphMatrixDistanceGeodesicCreate
void graphMatrixDistanceGeodesicCreate(const bool &considerWeights=false, const bool &inverseWeights=true, const bool &dropIsolates=false)
Creates the matrix DM of geodesic distances between vertices.
Definition graph.cpp:4826

Graph::prestigeDegree
void prestigeDegree(const bool &considerWeights, const bool &dropIsolates=false)
Computes the Degree Prestige (in-degree) of each vertex - diagonal included Also the mean value and t...
Definition graph.cpp:9966

Graph::varianceEC
qreal varianceEC
Definition graph.h:1252

Graph::writeMatrix
void writeMatrix(const QString &fileName, const int &matrix=MATRIX_ADJACENCY, const bool &considerWeights=true, const bool &inverseWeights=false, const bool &dropIsolates=false, const QString &varLocation="Rows", const bool &simpler=false)
Definition graph.cpp:20527

Graph::vertexinfluenceDomain
QList< int > vertexinfluenceDomain(int v2)
Returns the influence domain of vertex v1, namely the set of nodes who can reach v1 The Influence Dom...
Definition graph.cpp:12514

Graph::isFileFormatExportSupported
bool isFileFormatExportSupported(const int &fileFormat) const
Returns true if the fileFormat is supported for saving.
Definition graph.cpp:15693

Graph::nomEC
qreal nomEC
Definition graph.h:1267

Graph::vertexLabelSizeSet
void vertexLabelSizeSet(const int &v, const int &labelSize)
Changes the label size of vertex v1 or all vertices if v1=0.
Definition graph.cpp:1908

Graph::minEC
qreal minEC
Definition graph.h:1267

Graph::htmlHead
QString htmlHead
Definition graph.h:1331

Graph::~Graph
~Graph()
Destroys the Graph object.
Definition graph.cpp:269

Graph::minSCC
qreal minSCC
Definition graph.h:1262

Graph::writeMatrixDissimilarities
void writeMatrixDissimilarities(const QString fileName, const QString &metricStr, const QString &varLocation, const bool &diagonal, const bool &considerWeights)
Writes dissimilarity matrix based on a metric/measure to given html file.
Definition graph.cpp:14394

Graph::minNodeIRCC
int minNodeIRCC
Definition graph.h:1278

Graph::sumIRCC
qreal sumIRCC
Definition graph.h:1263

Graph::vertexLabelDistanceSet
void vertexLabelDistanceSet(const int &v, const int &newDistance)
Changes the distance.of vertex v label from the vertex.
Definition graph.cpp:1997

Graph::graphDiameter
int graphDiameter(const bool considerWeights, const bool inverseWeights)
Returns the diameter of the graph, aka the largest geodesic distance between any two vertices.
Definition graph.cpp:4643

Graph::discreteCCs
H_StrToInt discreteCCs
Definition graph.h:1233

Graph::writeReachabilityMatrixPlainText
void writeReachabilityMatrixPlainText(const QString &fn, const bool &dropIsolates=false)
Definition graph.cpp:12569

Graph::dijkstra
void dijkstra(const int &s, const int &si, const bool &computeCentralities=false, const bool &inverseWeights=false, const bool &dropIsolates=false)
Definition graph.cpp:5855

Graph::numberOfTriples
qreal numberOfTriples(int v1)
Definition graph.cpp:15024

Graph::writeEccentricity
void writeEccentricity(const QString fileName, const bool considerWeights=false, const bool inverseWeights=false, const bool dropIsolates=false)
Writes the Eccentricity report to file.
Definition graph.cpp:6287

Graph::vertexEdgesInbound
int vertexEdgesInbound(int i)
Returns the number of inbound edges (arcs) to vertex v1.
Definition graph.cpp:2663

Graph::denomSBC
qreal denomSBC
Definition graph.h:1264

Graph::setNodeNumberColor
void setNodeNumberColor(const int &v, const QString &color)

Graph::maxEVC
qreal maxEVC
Definition graph.h:1269

Graph::saveToDotFormat
bool saveToDotFormat(QString fileName)
TODO Saves the active graph to a UCINET-formatted file.
Definition graph.cpp:16266

Graph::prestigeProximity
void prestigeProximity(const bool considerWeights=false, const bool inverseWeights=false, const bool dropIsolates=false)
Computes Proximity Prestige of each vertex Also the mean value and the variance of it....
Definition graph.cpp:10425

Graph::AM
Matrix AM
Definition graph.h:1227

Graph::signalWebCrawlParse
void signalWebCrawlParse(QNetworkReply *reply)

Graph::randomNetErdosCreate
void randomNetErdosCreate(const int &N, const QString &model, const int &m, const qreal &p, const QString &mode, const bool &diag)
Creates an erdos-renyi random network according to the given model.
Definition graph.cpp:11283

Graph::m_graphModStatus
int m_graphModStatus
Definition graph.h:1292

Graph::randomizeThings
void randomizeThings()
Adds a little universal randomness :)
Definition graph.cpp:11263

Graph::calculatedGraphWeighted
bool calculatedGraphWeighted
Definition graph.h:1323

Graph::relationCurrent
int relationCurrent()
Gets the current relation number.
Definition graph.cpp:660

Graph::minIRCC
qreal minIRCC
Definition graph.h:1263

Graph::setDirected
void setDirected(const bool &toggle=true, const bool &signalMW=true)
Toggles the graph directed or undirected.
Definition graph.cpp:4382

Graph::writeCentralityPower
void writeCentralityPower(const QString, const bool weigths, const bool inverseWeights, const bool dropIsolates)
Writes Power Centralities to a file.
Definition graph.cpp:9689

Graph::maxSSC
qreal maxSSC
Definition graph.h:1266

Graph::maxSDP
qreal maxSDP
Definition graph.h:1260

Graph::isUndirected
bool isUndirected()
Returns true if graph is undirected.
Definition graph.cpp:4474

Graph::groupEVC
qreal groupEVC
Definition graph.h:1269

Graph::graphDistancesGeodesic
void graphDistancesGeodesic(const bool &computeCentralities=false, const bool &considerWeights=false, const bool &inverseWeights=true, const bool &dropIsolates=false)
Computes the geodesic distances between all vertices: In the process, it also computes many other cen...
Definition graph.cpp:4935

Graph::setSymmetric
void setSymmetric()
Transforms the graph to symmetric (all edges reciprocal)
Definition graph.cpp:4112

Graph::classesSDP
int classesSDP
Definition graph.h:1275

Graph::varianceSCC
qreal varianceSCC
Definition graph.h:1248

Graph::m_fieldWidth
int m_fieldWidth
Definition graph.h:1242

Graph::SIGMA
Matrix SIGMA
Definition graph.h:1227

Graph::maxNodePP
int maxNodePP
Definition graph.h:1286

Graph::vertexLabelSizeInit
void vertexLabelSizeInit(int newSize)
Graph::vertexLabelSizeInit Changes the default size of vertex labels.
Definition graph.cpp:1897

Graph::varianceIC
qreal varianceIC
Definition graph.h:1254

Graph::edgeExistsVirtual
qreal edgeExistsVirtual(const int &v1, const int &v2)
Checks if there is an edge from v1 to v2, even weight = 0 and returns the weight, if the edge exists ...
Definition graph.cpp:2578

Graph::m_crawler_max_urls
int m_crawler_max_urls
Definition graph.h:1194

Graph::layoutForceDirectedFruchtermanReingold
void layoutForceDirectedFruchtermanReingold(const int maxIterations)
Embeds a Force Directed Placement layout according to the Fruchterman-Reingold model....
Definition graph.cpp:22325

Graph::sumSBC
qreal sumSBC
Definition graph.h:1264

Graph::calculatedDP
bool calculatedDP
Definition graph.h:1319

Graph::setReportsDataDir
void setReportsDataDir(const QString &reportsDir)
Sets the directory where reports are saved This is used when exporting prominence distribution images...
Definition graph.cpp:16665

Graph::vpos
H_Int vpos
Definition graph.h:1136

Graph::verticesWithInboundEdges
int verticesWithInboundEdges()
Returns the sum of vertices having edgesInbound.
Definition graph.cpp:3418

Graph::randomNetSmallWorldCreate
void randomNetSmallWorldCreate(const int &N, const int &degree, const double &beta, const QString &mode)
Creates a small world random network.
Definition graph.cpp:11605

Graph::WM
Matrix WM
Definition graph.h:1227

Graph::isEmpty
bool isEmpty() const
Returns true if the current graph has no vertices at all.
Definition graph.cpp:3207

Graph::vertexNeighborhoodSet
QSet< int > vertexNeighborhoodSet(const int &v1)
Returns the set of all vertices mutually connected to vertex v1 in the current relation.
Definition graph.cpp:2906

Graph::graphDistanceGeodesicAverage
qreal graphDistanceGeodesicAverage(const bool considerWeights, const bool inverseWeights, const bool dropIsolates)
Returns the average distance of the graph.
Definition graph.cpp:4659

Graph::layoutForceDirected_FR_moveNodes
void layoutForceDirected_FR_moveNodes(const qreal &temperature)
Graph::layoutForceDirected_FR_moveNodes.
Definition graph.cpp:23058

Graph::setReportsChartType
void setReportsChartType(const int &type)
Sets the chart type in reports.
Definition graph.cpp:16694

Graph::varianceEVC
qreal varianceEVC
Definition graph.h:1255

Graph::canvasMinDimension
qreal canvasMinDimension() const
Gets the min dimensions of the canvas.
Definition graph.cpp:477

Graph::m_graphIsDirected
bool m_graphIsDirected
Definition graph.h:1324

Graph::graphWalksMatrixCreate
void graphWalksMatrixCreate(const int &N=0, const int &length=0, const bool &updateProgress=false)
Computes either the "Walks of given length" or the "Total Walks" matrix. If length>0,...
Definition graph.cpp:12162

Graph::calculatedDistances
bool calculatedDistances
Definition graph.h:1316

Graph::verticesWithOutboundEdges
int verticesWithOutboundEdges()
Returns the sum of vertices having edgesOutbound.
Definition graph.cpp:3409

Graph::verticesList
QList< int > verticesList()
Returns a list of all vertices numbers inside the graph.
Definition graph.cpp:2994

Graph::setReportsLabelLength
void setReportsLabelLength(const int &length)
Sets the length of labels in reports.
Definition graph.cpp:16685

Graph::setWeighted
void setWeighted(const bool &toggle=true)
Sets the graph to be weighted ( valued edges ).
Definition graph.cpp:3401

Graph::sumM
Matrix sumM
Definition graph.h:1227

Graph::vertexLabelDistanceAllSet
void vertexLabelDistanceAllSet(const int &newDistance)
Changes the distance of all vertex labels from their vertices.
Definition graph.cpp:2009

Graph::graphClickedEmptySpace
void graphClickedEmptySpace(const QPointF &p)
Resets the clicked edge and node.
Definition graph.cpp:3220

Graph::writeMatrixShortestPathsPlainText
void writeMatrixShortestPathsPlainText(const QString &fn, const bool &considerWeights, const bool &inverseWeights)
Writes the shortest paths matrix to a file Each SIGMA(i,j) element is the number of shortest paths (g...
Definition graph.cpp:6249

Graph::maxSDC
qreal maxSDC
Definition graph.h:1261

Graph::writeClusteringHierarchical
bool writeClusteringHierarchical(const QString &fileName, const QString &varLocation, const QString &matrix="Adjacency", const QString &metric="Manhattan", const QString &method="Complete", const bool &diagonal=false, const bool &dendrogram=false, const bool &considerWeights=true, const bool &inverseWeights=false, const bool &dropIsolates=false)
Writes Hierarchical Clustering Analysis to a given file.
Definition graph.cpp:13535

Graph::canvasRandomX
double canvasRandomX() const
Returns a random x-coordinate adjusted to be visible inside the canvas usable area.
Definition graph.cpp:503

Graph::loadFile
void loadFile(const QString fileName, const QString codecName, const int format, const QString delimiter=QString(), const int sm_two_mode=1, const bool sm_has_labels=false)
Loads a graph from a given file.
Definition graph.cpp:15885

Graph::isLoaded
bool isLoaded() const
Returns true if a graph has been loaded from a file.
Definition graph.cpp:15841

Graph::vertexNumberDistanceSet
void vertexNumberDistanceSet(const int &v, const int &newDistance)
Changes the distance.of vertex v number from the vertex.
Definition graph.cpp:1825

Graph::initEdgeColor
QString initEdgeColor
Definition graph.h:1328

Graph::m_graphGeodesicsCount
qreal m_graphGeodesicsCount
Definition graph.h:1299

Graph::triadTypeFreqs
QList< int > triadTypeFreqs
Definition graph.h:1202

Graph::isWeighted
bool isWeighted()
Returns true if the graph is weighted (valued), i.e. if any e in |E| has value not 0 or 1 Complexity:...
Definition graph.cpp:3355

Graph::groupSBC
qreal groupSBC
Definition graph.h:1264

Graph::edgeOutboundStatusSet
void edgeOutboundStatusSet(const int &source, const int &target, const bool &toggle=false)
Toggles the status of outbound edge source -> target at source vertex.
Definition graph.cpp:2228

Graph::vertexRemove
void vertexRemove(const int &v1)
Removes the vertex v1 from the graph First, it removes all edges to doomed from other vertices Then i...
Definition graph.cpp:1350

Graph::graphMetricStrToType
int graphMetricStrToType(const QString &metricStr) const
Helper method, return the identifier of a metric.
Definition graph.cpp:23243

Graph::invAM
Matrix invAM
Definition graph.h:1227

Graph::edgeLabel
QString edgeLabel(const int &v1, const int &v2) const
Returns the label of edge v1->v2.
Definition graph.cpp:2851

Graph::signalNodeClickedInfo
void signalNodeClickedInfo(const int &number=0, const QPointF &p=QPointF(), const QString &label=QString(), const int &inDegree=0, const int &outDegree=0)

Graph::saveToAdjacencyFormat
bool saveToAdjacencyFormat(const QString &fileName, const bool &saveEdgeWeights=true)
Saves the active graph to an adjacency-formatted file.
Definition graph.cpp:16229

Graph::graphReciprocity
qreal graphReciprocity()
Gets the arc reciprocity of the graph.
Definition graph.cpp:3657

Graph::writeMatrixSimilarityMatching
void writeMatrixSimilarityMatching(const QString fileName, const QString &measure="Simple", const QString &matrix="adjacency", const QString &varLocation="rows", const bool &diagonal=false, const bool &considerWeights=true)
Writes similarity matrix based on a matching measure to given html file.
Definition graph.cpp:14561

Graph::m_graph
VList m_graph
Definition graph.h:1186

Graph::centralityEigenvector
void centralityEigenvector(const bool &considerWeights=false, const bool &inverseWeights=false, const bool &dropIsolates=false)
Computes Eigenvector centrality.
Definition graph.cpp:7116

Graph::meanSPC
qreal meanSPC
Definition graph.h:1253

Graph::vertexCreateAtPosRandom
void vertexCreateAtPosRandom(const bool &signalMW=false)
Creates a new randomly positioned vertex with default values.
Definition graph.cpp:887

Graph::m_graphReciprocityArc
qreal m_graphReciprocityArc
Definition graph.h:1302

Graph::setNodeLabel
void setNodeLabel(const int &v, const QString &label)

Graph::writeCentralityDegree
void writeCentralityDegree(const QString, const bool weights, const bool dropIsolates)
Writes the Degree Centrality to a file.
Definition graph.cpp:8029

Graph::BFS
void BFS(const int &s, const int &si, const bool &computeCentralities=false, const bool &dropIsolates=false)
Definition graph.cpp:5682

Graph::writeMatrixDegreeText
void writeMatrixDegreeText(const QString &filename)
Computes the Degree matrix of the graph and writes it to given file.
Definition graph.cpp:21563

Graph::layoutVertexSizeByIndegree
void layoutVertexSizeByIndegree()
Convenience method Changes the size of all nodes to be proportional to their InDegree (Degree Prestig...
Definition graph.cpp:21791

Graph::m_graphSumDistance
qreal m_graphSumDistance
Definition graph.h:1301

Graph::setEdgeColor
void setEdgeColor(const int &v1, const int &v2, const QString &color)

Graph::prominenceDistributionBars
void prominenceDistributionBars(const H_StrToInt &discreteClasses, const QString &name, const QString &distImageFileName)
Computes the distribution of a centrality index scores. The distribution data are returned as QBarSer...
Definition graph.cpp:7863

Graph::d_factor
qreal d_factor
Definition graph.h:1273

Graph::layoutForceDirected_F_att
qreal layoutForceDirected_F_att(const QString model, const qreal &dist, const qreal &optimalDistance)
Definition graph.cpp:22880

Graph::vertexShape
QString vertexShape(const int &v)
Returns the shape of this vertex.
Definition graph.cpp:1652

Graph::discreteECs
H_StrToInt discreteECs
Definition graph.h:1234

Graph::inboundEdgesVert
int inboundEdgesVert
Definition graph.h:1311

Graph::signalDatasetDescription
void signalDatasetDescription(QString)

Graph::maxIndexSC
qreal maxIndexSC
Definition graph.h:1266

Graph::verticesSet
QSet< int > verticesSet()
Returns a QSet of all vertices numbers inside the graph.
Definition graph.cpp:3016

Graph::computeOptimalDistance
qreal computeOptimalDistance(const int &V)
Computes Optimal Distance. Used in Spring Embedder and FR algorithms.
Definition graph.cpp:22866

Graph::minNodeSDC
int minNodeSDC
Definition graph.h:1276

Graph::writeWalksTotalMatrixPlainText
void writeWalksTotalMatrixPlainText(const QString &fn)
Graph::writeWalksTotalMatrixPlainText Writes the total number of walks matrix.
Definition graph.cpp:12265

Graph::initVertexIconPath
QString initVertexIconPath
Definition graph.h:1330

Graph::discreteSCs
H_StrToInt discreteSCs
Definition graph.h:1233

Graph::relationSet
void relationSet(int relNum=RAND_MAX, const bool &updateUI=true)
Changes the current relation, and optionally emits signals to MW/GW (default: true)
Definition graph.cpp:531

Graph::meanSSC
qreal meanSSC
Definition graph.h:1251

Graph::m_graphReciprocityTiesReciprocated
int m_graphReciprocityTiesReciprocated
Definition graph.h:1303

Graph::vertexColorSet
void vertexColorSet(const int &v, const QString &color)
Changes the color of vertex v1.
Definition graph.cpp:1675

Graph::minCLC
qreal minCLC
Definition graph.h:1273

Graph::setReportsRealNumberPrecision
void setReportsRealNumberPrecision(const int &precision)
Sets the precision (number of fraction digits) the app will use when writing real numbers in reports.
Definition graph.cpp:16676

Graph::vertexNumberColorInit
void vertexNumberColorInit(const QString &color)
Changes the initial color of the vertex numbers.
Definition graph.cpp:1730

Graph::edgeCreateWebCrawler
void edgeCreateWebCrawler(const int &source, const int &target)
Called from WebCrawler when it finds an new link Calls edgeCreate() method with initEdgeColor.
Definition graph.cpp:2167

Graph::vertexClickedSet
void vertexClickedSet(const int &v, const QPointF &p)
Sets the clicked vertex.
Definition graph.cpp:1509

Graph::edgeFilterByWeight
void edgeFilterByWeight(const qreal, const bool)
Filters (disables) edges according the specified threshold weight.
Definition graph.cpp:2320

Graph::nomEVC
qreal nomEVC
Definition graph.h:1269

Graph::denomIRCC
qreal denomIRCC
Definition graph.h:1263

Graph::canvasRandomY
double canvasRandomY() const
Returns a random y-coordinate adjusted to be visible inside the canvas usable area.
Definition graph.cpp:512

Graph::verticesListIsolated
QList< int > verticesListIsolated()
Returns a list of all isolated vertices inside the graph.
Definition graph.cpp:2962

Graph::saveToFile
void saveToFile(const QString &fileName, const int &fileType, const bool &saveEdgeWeights=true, const bool &saveZeroWeightEdges=false)
Saves the current graph to a file.
Definition graph.cpp:16075

Graph::graphClusteringMethodTypeToString
QString graphClusteringMethodTypeToString(const int &methodType) const
Helper method, return the human readable name of clustering method type.
Definition graph.cpp:23272

Graph::layoutForceDirected_FR_temperature
qreal layoutForceDirected_FR_temperature(const int iteration) const
Reduces the temperature as the layout approaches a better configuration.
Definition graph.cpp:22830

Graph::m_crawler_visited_urls
int m_crawler_visited_urls
Definition graph.h:1195

Graph::classesIC
int classesIC
Definition graph.h:1284

Graph::ModStatus
ModStatus
Definition graph.h:374

Graph::EdgeMetadata
@ EdgeMetadata
Definition graph.h:379

Graph::SavedUnchanged
@ SavedUnchanged
Definition graph.h:376

Graph::MinorOptions
@ MinorOptions
Definition graph.h:377

Graph::VertexPositions
@ VertexPositions
Definition graph.h:380

Graph::VertexEdgeCount
@ VertexEdgeCount
Definition graph.h:384

Graph::VertexCount
@ VertexCount
Definition graph.h:382

Graph::NewNet
@ NewNet
Definition graph.h:375

Graph::EdgeCount
@ EdgeCount
Definition graph.h:383

Graph::VertexMetadata
@ VertexMetadata
Definition graph.h:378

Graph::MajorChanges
@ MajorChanges
Definition graph.h:381

Graph::calculatedIRCC
bool calculatedIRCC
Definition graph.h:1320

Graph::m_graphHasVertexCustomIcons
bool m_graphHasVertexCustomIcons
Definition graph.h:1309

Graph::Stack
stack< int > Stack
Definition graph.h:1230

Graph::vertexNumberSizeInit
void vertexNumberSizeInit(const int &size)
Changes the initial size of vertex numbers.
Definition graph.cpp:1771

Graph::graphHasVertexCustomIcons
bool graphHasVertexCustomIcons() const
Definition graph.h:519

Graph::layoutRandom
void layoutRandom()
Repositions all nodes on random positions Emits setNodePos(i, x,y) to tell GW that the node item shou...
Definition graph.cpp:21620

Graph::discreteICs
H_StrToInt discreteICs
Definition graph.h:1235

Graph::meanSDC
qreal meanSDC
Definition graph.h:1247

Graph::addGuideCircle
void addGuideCircle(const double &, const double &, const double &)

Graph::initVertexColor
QString initVertexColor
Definition graph.h:1328

Graph::actualDateTime
QDateTime actualDateTime
Definition graph.h:1333

Graph::calculatedCentralities
bool calculatedCentralities
Definition graph.h:1316

Graph::signalGraphSavedStatus
void signalGraphSavedStatus(const int &status)

Graph::maxCLC
qreal maxCLC
Definition graph.h:1273

Graph::graphDistanceEuclidean
qreal graphDistanceEuclidean(const QPointF &a, const QPointF &b)
Computes the euclideian distance between QPointF a and b.
Definition graph.cpp:22987

Graph::writeTriadCensus
void writeTriadCensus(const QString, const bool)
Definition graph.cpp:12807

Graph::m_graphIsConnected
bool m_graphIsConnected
Definition graph.h:1324

Graph::calculatedTriad
bool calculatedTriad
Definition graph.h:1321

Graph::groupPP
qreal groupPP
Definition graph.h:1271

Graph::writeCentralityBetweenness
void writeCentralityBetweenness(const QString, const bool weights, const bool inverseWeights, const bool dropIsolates)
Writes Betweenness centralities to file.
Definition graph.cpp:8958

Graph::Clustering
Clustering
Definition graph.h:389

Graph::Single_Linkage
@ Single_Linkage
Definition graph.h:390

Graph::Complete_Linkage
@ Complete_Linkage
Definition graph.h:391

Graph::Average_Linkage
@ Average_Linkage
Definition graph.h:392

Graph::graphTriadCensus
bool graphTriadCensus()
Graph::graphTriadCensus Conducts a triad census and updates QList::triadTypeFreqs,...
Definition graph.cpp:15278

Graph::edgeRemove
void edgeRemove(const int &v1, const int &v2, const bool &removeReverse=false)
Removes the directed arc v1->v2 or, if the graph is undirected, the edge v1 <->v2.
Definition graph.cpp:2261

Graph::edgeColor
QString edgeColor(const int &v1, const int &v2)
Returns the color of the directed edge v1->v2.
Definition graph.cpp:2821

Graph::classesSBC
int classesSBC
Definition graph.h:1279

Graph::graphDichotomization
void graphDichotomization(const qreal threshold)
Creates a new binary relation in a valued network using edge dichotomization according to the thresho...
Definition graph.cpp:4307

Graph::DM
Matrix DM
Definition graph.h:1227

Graph::isConnected
bool isConnected()
Checks if the graph is connected, in the sense of a topological space, i.e., there is a path from any...
Definition graph.cpp:4706

Graph::relationCurrentRename
void relationCurrentRename(const QString &newName)
Overload. Renames current relation to newName, without emitting any signal to MW.
Definition graph.cpp:721

Graph::groupSPC
qreal groupSPC
Definition graph.h:1265

Graph::maxNodeEccentricity
int maxNodeEccentricity
Definition graph.h:1283

Graph::m_fileFormat
int m_fileFormat
Definition graph.h:1242

Graph::varianceSSC
qreal varianceSSC
Definition graph.h:1251

Graph::maxSCC
qreal maxSCC
Definition graph.h:1262

Graph::edgeRemoveSelected
void edgeRemoveSelected(SelectedEdge &selectedEdge, const bool &removeReverse)
Removes a SelectedEdge.
Definition graph.cpp:2291

Graph::startWebCrawler
void startWebCrawler(const QUrl &startUrl, const QStringList &urlPatternsIncluded, const QStringList &urlPatternsExcluded, const QStringList &linkClasses, const int &maxNodes, const int &maxLinksPerPage, const bool &intLinks, const bool &childLinks, const bool &parentLinks, const bool &selfLinks, const bool &extLinksIncluded, const bool &extLinksCrawl, const bool &socialLinks, const bool &delayedRequests)
Creates a new WebCrawler, that will parse the downloaded HTML code of each webpage we download....
Definition graph.cpp:3480

Graph::outboundEdgesVert
int outboundEdgesVert
Definition graph.h:1311

Graph::vertexColor
QColor vertexColor(const int &v) const
Graph::vertexColor.
Definition graph.cpp:1707

Graph::graphClusteringMethodStrToType
int graphClusteringMethodStrToType(const QString &method) const
Helper method, return clustering method type from the human readable name of it.
Definition graph.cpp:23296

Graph::groupEC
qreal groupEC
Definition graph.h:1267

Graph::minNodeSSC
int minNodeSSC
Definition graph.h:1281

Graph::vertexSizeSet
void vertexSizeSet(const int &v, const int &newsize)
Changes the size of a vertex v or all vertices if v=0.
Definition graph.cpp:1554

Graph::classesPRP
int classesPRP
Definition graph.h:1285

Graph::minNodeDP
int minNodeDP
Definition graph.h:1275

Graph::vertexFindByNumber
bool vertexFindByNumber(const QStringList &numList)
Finds vertices in strList by their number.
Definition graph.cpp:1029

Graph::signalNodesFound
void signalNodesFound(const QList< int > foundList)

Graph::initEdgeLabels
bool initEdgeLabels
Definition graph.h:1298

Graph::getGeodesicsCount
int getGeodesicsCount()
Returns the number of geodesics (shortest-paths) in the graph.
Definition graph.cpp:4685

Graph::classesPP
int classesPP
Definition graph.h:1286

Graph::sumSPC
qreal sumSPC
Definition graph.h:1265

Graph::htmlHeadLight
QString htmlHeadLight
Definition graph.h:1331

Graph::centralityDegree
void centralityDegree(const bool &considerWeights=true, const bool &dropIsolates=false)
Calculates the degree (outDegree) centrality of each vertex - diagonal included.
Definition graph.cpp:7246

Graph::layoutForceDirectedSpringEmbedder
void layoutForceDirectedSpringEmbedder(const int maxIterations)
Embeds a Force Directed Placement layout according to the initial Spring Embedder model proposed by E...
Definition graph.cpp:22181

Graph::meanSDP
qreal meanSDP
Definition graph.h:1256

Graph::vertexIsolated
bool vertexIsolated(const int &v1) const
Checks if vertex is isolated.
Definition graph.cpp:1459

Graph::calculatedVertices
bool calculatedVertices
Definition graph.h:1315

Graph::discreteIRCCs
H_StrToInt discreteIRCCs
Definition graph.h:1234

Graph::calculatedPP
bool calculatedPP
Definition graph.h:1319

Graph::signalProgressBoxUpdate
void signalProgressBoxUpdate(const int &count=0)

Graph::setNodeColor
void setNodeColor(const int &v, const QString &color)

Graph::vertexDegreeOut
int vertexDegreeOut(int)
Returns the outDegree (sum of outbound edge weights) of vertex v1.
Definition graph.cpp:2871

Graph::verticesCreateSubgraph
void verticesCreateSubgraph(QList< int > vList, const int &type=SUBGRAPH_CLIQUE, const int &center=0)
Creates a subgraph (clique, star, cycle, line) with vertices in vList Iff vList is empty,...
Definition graph.cpp:3041

Graph::signalPromininenceDistributionChartUpdate
void signalPromininenceDistributionChartUpdate(QAbstractSeries *series, QAbstractAxis *axisX=Q_NULLPTR, const qreal &min=0, const qreal &max=0, QAbstractAxis *axisY=Q_NULLPTR, const qreal &minF=0, const qreal &maxF=0)

Graph::calculatedVerticesSet
bool calculatedVerticesSet
Definition graph.h:1315

Graph::relationsClear
void relationsClear()
Clears relationships in this Graph.
Definition graph.cpp:742

Graph::writeCentralityInformation
void writeCentralityInformation(const QString, const bool weigths, const bool inverseWeights)
Writes the information centralities to file.
Definition graph.cpp:6594

Graph::writeReciprocity
void writeReciprocity(const QString fileName, const bool considerWeights=false)
Writes reciprocity report to filename.
Definition graph.cpp:3797

Graph::meanPP
qreal meanPP
Definition graph.h:1257

Graph::vertexNumberDistanceInit
void vertexNumberDistanceInit(const int &distance)
Changes the initial distance of vertex numbers.
Definition graph.cpp:1815

Graph::minNodeCLC
int minNodeCLC
Definition graph.h:1274

Graph::vertexNumberMax
int vertexNumberMax()
Returns the number of the last vertex in the graph.
Definition graph.cpp:953

Graph::meanPRP
qreal meanPRP
Definition graph.h:1258

Graph::nomIC
qreal nomIC
Definition graph.h:1268

Graph::canvasMaxRadius
double canvasMaxRadius() const
Gets the max radius of the canvas.
Definition graph.cpp:469

Graph::discretePCs
H_StrToInt discretePCs
Definition graph.h:1235

Graph::canvasVisibleX
double canvasVisibleX(const double &x) const
Checks if x is visible inside the canvas usable area and if not returns an adjusted x-coordinate.
Definition graph.cpp:486

Graph::m_graphReciprocityPairsTotal
int m_graphReciprocityPairsTotal
Definition graph.h:1307

Graph::calculatedEVC
bool calculatedEVC
Definition graph.h:1318

Graph::graphMatrixShortestPathsCreate
void graphMatrixShortestPathsCreate(const bool &considerWeights=false, const bool &inverseWeights=true, const bool &dropIsolates=false)
Creates the matrix SIGMA of shortest paths (geodesics) between vertices Each SIGMA(i,...
Definition graph.cpp:4735

Graph::edgeInboundStatusSet
void edgeInboundStatusSet(const int &target, const int &source, const bool &toggle=false)
Toggles the status of inbound edge target <- source at target vertex.
Definition graph.cpp:2242

Graph::edgeRemoveSelectedAll
void edgeRemoveSelectedAll()
Removes all selected edges.
Definition graph.cpp:2301

Graph::vertexLabelsVisibilitySet
void vertexLabelsVisibilitySet(bool toggle)

Graph::htmlEnd
QString htmlEnd
Definition graph.h:1331

Graph::maxIC
qreal maxIC
Definition graph.h:1268

Graph::signalRelationRenamedToMW
void signalRelationRenamedToMW(const QString &newRelName)

Graph::maxNodePRP
int maxNodePRP
Definition graph.h:1285

Graph::relationNext
void relationNext()
Changes graph to next relation.
Definition graph.cpp:616

Graph::maxNodeIC
int maxNodeIC
Definition graph.h:1284

Graph::maxNodeIRCC
int maxNodeIRCC
Definition graph.h:1278

Graph::meanEVC
qreal meanEVC
Definition graph.h:1255

Graph::relationAdd
void relationAdd(const QString &relName, const bool &changeRelation=false)
Adds a new relation to the graph.
Definition graph.cpp:635

Graph::classesIRCC
int classesIRCC
Definition graph.h:1278

Graph::setFileFormat
void setFileFormat(const int &fileFormat)
Definition graph.cpp:15683

Graph::writeDataSetToFile
void writeDataSetToFile(const QString dir, const QString)
Writes a "famous" dataset to the given file Datasets are hardcoded! They are exported in the given fi...
Definition graph.cpp:16719

Graph::calculatedEdges
bool calculatedEdges
Definition graph.h:1314

Graph::calculatedDC
bool calculatedDC
Definition graph.h:1319

Graph::maxNodeCLC
int maxNodeCLC
Definition graph.h:1274

Graph::vertexNumberSizeSet
void vertexNumberSizeSet(const int &v, const int &newsize)
Changes the size of vertex v number.
Definition graph.cpp:1782

Graph::layoutCircular
void layoutCircular(const double &x0, const double &y0, const double &newRadius, const bool &guides=false)
Repositions all nodes on the periphery of a circle with given radius.
Definition graph.cpp:21725

Graph::groupSC
qreal groupSC
Definition graph.h:1266

Graph::sumSDC
qreal sumSDC
Definition graph.h:1261

Graph::m_clusteringLevel
QList< qreal > m_clusteringLevel
Definition graph.h:1221

Graph::setSelectionChanged
void setSelectionChanged(const QList< int > selectedVertices, const QList< SelectedEdge > selectedEdges)
Sets the user-selected vertices and edges.
Definition graph.cpp:3238

Graph::calculatedIsolates
bool calculatedIsolates
Definition graph.h:1317

Graph::minNodeSPC
int minNodeSPC
Definition graph.h:1280

Graph::minSDC
qreal minSDC
Definition graph.h:1261

Graph::vertexNumberMin
int vertexNumberMin()
Returns the number of the first vertex in the graph.
Definition graph.cpp:966

Graph::clear
void clear(const QString &reason="")
Clears all vertices.
Definition graph.cpp:279

Graph::centralityInformation
void centralityInformation(const bool considerWeights=false, const bool inverseWeights=false)
Computes the Information centrality of each vertex - diagonal included Note that there is no known ge...
Definition graph.cpp:6474

Graph::nomSCC
qreal nomSCC
Definition graph.h:1262

Graph::vertexIsolatedAllToggle
void vertexIsolatedAllToggle(const bool &toggle)
Toggles the status of all isolated vertices (thos without links)
Definition graph.cpp:1432

Graph::writeMatrixSimilarityPearsonPlainText
void writeMatrixSimilarityPearsonPlainText(const QString fileName, const bool considerWeights, const QString &matrix="adjacency", const QString &varLocation="rows", const bool &diagonal=false)
Calls Graph::graphSimilariyPearsonCorrelationCoefficients() and writes Pearson Correlation Coefficien...
Definition graph.cpp:14908

Graph::layoutByProminenceIndex
void layoutByProminenceIndex(int prominenceIndex, int layoutType, const bool &considerWeights=false, const bool &inverseWeights=false, const bool &dropIsolates=false)
Applies a layout according to each actor's prominence index score. The layout type can be radial (0),...
Definition graph.cpp:21813

Graph::sumDP
qreal sumDP
Definition graph.h:1260

Graph::edgeColorSet
void edgeColorSet(const int &v1, const int &v2, const QString &color)
Changes the color of edge v1->v2.
Definition graph.cpp:2798

Graph::edgeCreate
bool edgeCreate(const int &v1, const int &v2, const qreal &weight, const QString &color, const int &type=0, const bool &drawArrows=true, const bool &bezier=false, const QString &label=QString(), const bool &signalMW=true)
Checks a) if edge exists and b) if the reverse edge exists Calls edgeAdd to add the new edge to the G...
Definition graph.cpp:2057

Graph::writeMatrixDistancesPlainText
void writeMatrixDistancesPlainText(const QString &fn, const bool &considerWeights, const bool &inverseWeights, const bool &dropIsolates)
Writes the matrix of distances to a file.
Definition graph.cpp:6210

Graph::setNodeNumberSize
void setNodeNumberSize(const int &v, const int &size)

Graph::edgeFilterByRelation
void edgeFilterByRelation(int relation, bool status)
Toggles (enables or disables) all edges of the given relation.
Definition graph.cpp:2452

Graph::sizeOfComponent
qreal sizeOfComponent
Definition graph.h:1288

Graph::averageCLC
qreal averageCLC
Definition graph.h:1273

Graph::getName
QString getName() const
Returns the name of the current graph.
Definition graph.cpp:15623

Graph::graphCliquesOfSize
int graphCliquesOfSize(const int &size)
Graph::graphCliquesOfSize Returns the number of maximal cliques of a given size.
Definition graph.cpp:13516

Graph::groupDC
qreal groupDC
Definition graph.h:1261

Graph::isDirected
bool isDirected()
Returns true if graph is directed.
Definition graph.cpp:4461

Graph::minPP
qreal minPP
Definition graph.h:1271

Graph::varianceCLC
qreal varianceCLC
Definition graph.h:1273

Graph::randomNetScaleFreeCreate
void randomNetScaleFreeCreate(const int &N, const int &power, const int &m0, const int &m, const qreal &alpha, const QString &mode)
Creates a scale-free random-network network.
Definition graph.cpp:11426

Graph::file_parser
Parser * file_parser
Definition graph.h:1188

Graph::writeCentralityCloseness
void writeCentralityCloseness(const QString, const bool weights, const bool inverseWeights, const bool dropIsolates)
Writes the closeness centralities to a file.
Definition graph.cpp:8312

Graph::vertexinfluenceRange
QList< int > vertexinfluenceRange(int v1)
Returns the influence range of vertex v1, namely the set of nodes who are reachable from v1 (See Wass...
Definition graph.cpp:12456

Matrix
Definition matrix.h:115

MyEdge
Definition global.h:150

Parser
Defines a class for network file loading and parsing.
Definition parser.h:68

WebCrawler
The WebCrawler class Parses HTML code it receives, locates urls inside it and puts them into a url qu...
Definition webcrawler.h:34

global.h

NetworkRequestType
NetworkRequestType
Definition global.h:97

SUBGRAPH_CLIQUE
static const int SUBGRAPH_CLIQUE
Definition global.h:114

MATRIX_ADJACENCY
static const int MATRIX_ADJACENCY
Definition global.h:119

Directed
@ Directed
Definition global.h:68

ChartType
ChartType
Definition global.h:90

SelectedEdge
QPair< int, int > SelectedEdge
Definition global.h:147

SOCNETV_USE_NAMESPACE
#define SOCNETV_USE_NAMESPACE
Definition global.h:11

H_Int
QHash< int, int > H_Int
Definition graph.h:66

V_str
QList< QString > V_str
Definition graph.h:74

L_int
QList< int > L_int
Definition graph.h:72

H_edges
QMultiHash< int, pair_i_fb > H_edges
Definition graph.h:70

H_StrToBool
QHash< QString, bool > H_StrToBool
Definition graph.h:71

H_f_i
QHash< qreal, int > H_f_i
Definition graph.h:67

VList
QList< GraphVertex * > VList
Definition graph.h:64

V_int
QList< int > V_int
Definition graph.h:73

pair_f_b
QPair< qreal, bool > pair_f_b
Definition graph.h:68

H_StrToInt
QHash< QString, int > H_StrToInt
Definition graph.h:65

pair_i_fb
QPair< int, pair_f_b > pair_i_fb
Definition graph.h:69

graphicswidget.h
Declares the GraphicsWidget class for handling the main visualization widget in the network graph int...

graphvertex.h
Declares the GraphVertex class for representing and managing vertices in the network graph structure.

matrix.h
Declares the Matrix class for handling adjacency and sociomatrix data structures in network analysis.

METRIC_SIMPLE_MATCHING
static const int METRIC_SIMPLE_MATCHING
Definition matrix.h:38

parser.h
Declares the Parser class for reading and interpreting various network data formats,...

webcrawler.h