docs/graph_8h_source.html

#ifndef GRAPH_H

#define GRAPH_H


#include <QObject>

#include <QList>

#include <QQueue>

#include <QHash>

#include <QSet>

#include <QMultiHash>

#include <QMultiMap>

#include <QTextStream>

#include <QThread>

#include <QStack>


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

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

#include <stack>


#include "global.h"

#include "graph/filters/filter_condition.h"

#include "graphvertex.h"

#include "matrix.h"

#include "parser.h"

#include "webcrawler.h"


class QDateTime;

class QPointF;

class QNetworkReply;

class QUrl;

class QAbstractSeries;

class QAbstractAxis;


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;


    friend class DistanceEngine;


public slots:

    // ============================================================================

    // LEGACY/INTERNAL (UI / IO WIRING)

    // ----------------------------------------------------------------------------

    // NOTE (WS2/F0):

    // Slots are part of Graph's coordinator role (signals/threads/UI wiring).

    // Engines/services should not depend on these directly.

    // ============================================================================


    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,

                      const QHash<QString, QString> &customAttributes = QHash<QString, QString>());


    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,

                    const QHash<QString,QString> &edgeCustomAttributes =

                        QHash<QString,QString>());


    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 vertexFilterByCentrality(const float threshold,

                                  const bool overThreshold,

                                  const IndexType centralityIndex);


    void vertexFilterByEgoNetwork(const int v1, const int depth = 1);

    void vertexFilterBySelection(const QList<int> &selectedVertices);

    void vertexFilterByAttribute(const FilterCondition &cond);

    void edgeFilterByAttribute(const FilterCondition &cond);

    void vertexFilterRestoreAll();

    bool visibilityHistoryEmpty() const;


    void edgeFilterByWeight(const qreal, const bool);

    void edgeFilterReset();


    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();


    void slotCancelComputation();


    QString htmlEscaped(QString str) const;


signals:


    void signalWebCrawlParse(QNetworkReply *reply);


    // ============================================================================

    // LEGACY/INTERNAL (UI SIGNAL SURFACE)

    // ----------------------------------------------------------------------------

    // NOTE (WS2/F0): Signals are a UI orchestration mechanism. Engines/services

    // must not emit/call UI-facing behavior directly.

    // ============================================================================


    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:

    // ============================================================================

    // GRAPH FACADE CONTRACT (WS2 / F0)

    // ----------------------------------------------------------------------------

    // This section defines the *supported* API surface that UI and CLI code may

    // call going forward.

    //

    // Rules:

    // - New UI features MUST use only the "FACADE API (SUPPORTED)" surface.

    // - Engines/services MUST NOT call UI-oriented slots/signals.

    // - Anything explicitly marked LEGACY/INTERNAL is not allowed for new code,

    //   even if it remains public for historical reasons.

    //

    // ============================================================================


    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


    };


    // --------------------------------------------------------------------------

    // FACADE API (SUPPORTED): Visibility snapshot for non-destructive filtering.

    // Used by the filter system to save/restore vertex and edge visibility state.

    // Stored as a stack to support future undo/redo.

    // --------------------------------------------------------------------------


    struct GraphVisibilitySnapshot

    {

        QHash<int, bool> nodeVisible;            // vertex number  → was enabled

        QHash<QPair<int, int>, bool> arcVisible; // (source,target)→ was visible

        bool active = false;                     // true when this snapshot holds real data

    };


    /* INIT AND CLEAR*/

    // --------------------------------------------------------------------------

    // FACADE API (SUPPORTED): Lifecycle

    // --------------------------------------------------------------------------

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

    ~Graph();


    QThread *getThread() const;

    void moveToThreadFacade(QThread *thread);


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


    /*FILES (READ AND WRITE)*/

    // --------------------------------------------------------------------------

    // FACADE API (SUPPORTED): File identity / load-save

    // --------------------------------------------------------------------------


    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 */

    // --------------------------------------------------------------------------

    // FACADE API (SUPPORTED): Relations

    // --------------------------------------------------------------------------


    int relations();


    void relationsClear();


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


    /* VERTICES */

    // --------------------------------------------------------------------------

    // FACADE API (SUPPORTED): Vertex queries + edits

    // --------------------------------------------------------------------------


    int vertexIndexByNumber(int v) const;

    // LEGACY/INTERNAL (ENGINE SUPPORT):

    // Access a vertex by internal storage index (vpos result).

    // No bounds checks: preserves existing behavior of direct m_graph[idx] usage.

    GraphVertex *vertexAtIndex(int idx);

    const GraphVertex *vertexAtIndex(int idx) const;


    VList::const_iterator verticesBegin() const;

    VList::const_iterator verticesEnd() const;


    int vertexNumberMax();


    int vertexNumberMin();


    int vertexDegreeOut(int);


    int vertexDegreeIn(int);


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

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

    QSet<int> vertexOutNeighborsSet(const int &v1, const bool includeInEdges = false);


    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;


    QStringList graphHasVertexCustomAttributes() const;


    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 vertexCustomAttributesSet(const int &v1, const QHash<QString, QString> &customAttributes);


    void vertexCustomAttributeSet(const int &v1, const QString &key, const QString &value);


    void vertexCustomAttributeRemove(const int &v1, const QString &key);


    QHash<QString, QString> vertexCustomAttributes(const int &v1) const;


    int vertexAttributesImport(const QStringList &headers,

                               const QVector<QStringList> &rows,

                               int idColumn,

                               bool matchByLabel);


    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);


    // Regression/testing helper: access a vertex object by its number.

    // Returns nullptr if not found.

    GraphVertex *vertexPtr(const int v);


    /* EDGES */

    // --------------------------------------------------------------------------

    // FACADE API (SUPPORTED): Edge queries + edits

    // --------------------------------------------------------------------------


    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);


    void edgeCustomAttributesSet(const int &v1, const int &v2, const QHash<QString,QString> &attrs);


    QHash<QString,QString> edgeCustomAttributes(const int &v1, const int &v2) const;


    int edgeAttributesImport(const QStringList &headers,

                             const QVector<QStringList> &rows,

                             int srcColumn,

                             int tgtColumn);


    QStringList graphHasEdgeCustomAttributes() const;


    /* GRAPH methods */

    // --------------------------------------------------------------------------

    // FACADE API (SUPPORTED): Graph facts + settings used by UI/CLI

    // --------------------------------------------------------------------------


    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();


    bool isConnectedCached() const;


    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);


    bool 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);


    bool writeMatrixDissimilarities(const QString fileName,

                                    const QString &metricStr,

                                    const QString &varLocation,

                                    const bool &diagonal,

                                    const bool &considerWeights);


    bool writeMatrixSimilarityMatching(const QString fileName,

                                       const QString &measure = "Simple",

                                       const QString &matrix = "adjacency",

                                       const QString &varLocation = "rows",

                                       const bool &diagonal = false,

                                       const bool &considerWeights = true);


    bool writeMatrixSimilarityPearson(const QString fileName,

                                      const bool considerWeights,

                                      const QString &matrix = "adjacency",

                                      const QString &varLocation = "rows",

                                      const bool &diagonal = false);


    bool writeEccentricity(const QString fileName,

                           const bool considerWeights = false,

                           const bool inverseWeights = false,

                           const bool dropIsolates = false);


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


    bool writeCentralityDegree(const QString,

                               const bool weights,

                               const bool dropIsolates);


    bool writeCentralityCloseness(const QString,

                                  const bool weights,

                                  const bool inverseWeights,

                                  const bool dropIsolates);


    bool writeCentralityClosenessInfluenceRange(const QString,

                                                const bool weights,

                                                const bool inverseWeights,

                                                const bool dropIsolates);


    bool writeCentralityBetweenness(const QString,

                                    const bool weights,

                                    const bool inverseWeights,

                                    const bool dropIsolates);


    bool writeCentralityPower(const QString,

                              const bool weigths,

                              const bool inverseWeights,

                              const bool dropIsolates);


    bool writeCentralityStress(const QString,

                               const bool weigths,

                               const bool inverseWeights,

                               const bool dropIsolates);


    bool writeCentralityEccentricity(const QString,

                                     const bool weigths,

                                     const bool inverseWeights,

                                     const bool dropIsolates);


    bool writeCentralityInformation(const QString,

                                    const bool weigths,

                                    const bool inverseWeights);


    bool writeCentralityEigenvector(const QString,

                                    const bool &weigths = true,

                                    const bool &inverseWeights = false,

                                    const bool &dropIsolates = false);


    bool writePrestigeDegree(const QString, const bool weights,

                             const bool dropIsolates);


    bool writePrestigeProximity(const QString, const bool weights,

                                const bool inverseWeights,

                                const bool dropIsolates);


    bool 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);


    bool writeClusteringCoefficient(const QString, const bool);


    bool 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 graphDiameterCached() const;


    qreal graphSumDistanceCached() const;


    qreal graphGeodesicsCountCached() const;


    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);


    qreal graphDistanceGeodesicAverageCached() const;


    void graphDistancesGeodesic(const bool &computeCentralities = false,

                                const bool &considerWeights = false,

                                const bool &inverseWeights = true,

                                const bool &dropIsolates = false);


    // ============================================================================

    // LEGACY/INTERNAL (ENGINE SUPPORT PRIMITIVES)

    // ----------------------------------------------------------------------------

    // NOTE (WS2/F0): These exist to support DistanceEngine during transition.

    // UI code must not call these. Prefer keeping them engine-only.

    // ============================================================================

    // --- SSSP/Brandes stack helpers (DistanceEngine should not touch Stack directly) ---

    void ssspStackClear();

    bool ssspStackEmpty() const;

    int ssspStackTop() const;

    void ssspStackPop();

    int ssspStackSize() const;

    void ssspStackPush(int v);

    // --- SSSP nth-order neighborhood (for Power Centrality) ---

    void ssspNthOrderClear();

    //

    // LEGACY/INTERNAL: transitional storage.

    // DistanceEngine may use this via the accessors below.

    // (Later WS2/F1 may hide this field and keep only accessors.)

    // Stores the number of vertices at distance n from a given vertex, for n=0,1,2,... during SSSP traversal.

    H_f_i sizeOfNthOrderNeighborhood;

    H_f_i::const_iterator ssspNthOrderBegin() const;

    H_f_i::const_iterator ssspNthOrderEnd() const;

    int ssspNthOrderValue(qreal dist) const;

    void ssspNthOrderIncrement(int dist);

    void ssspNthOrderIncrement(qreal dist);

    // --- SSSP component size accumulator ---

    void ssspComponentReset(int value = 1);

    void ssspComponentAdd(int delta);

    int ssspComponentSize() const;

    // --- Connectivity bookkeeping ---

    void notConnectedPairsClear();

    void notConnectedPairsInsert(int from, int to);

    int notConnectedPairsSize() const;


    // --- Distance centrality cache flags ---

    // CLI/benchmark helper: allows repeated runs by clearing the computed flags only.

    // Does not modify graph structure or results.

    void resetDistanceCentralityCacheFlags();


    // LEGACY/INTERNAL (ENGINE SUPPORT): cached results written by DistanceEngine

    void setSymmetricCached(bool v);

    bool symmetricCached() const;


    void setConnectedCached(bool v);

    void setDiameterCached(int v);


    void resetDistanceAggregates(); // sets avg/sum/geodesics/diameter to 0

    void addToDistanceSum(qreal delta);

    void incGeodesicsCount();

    void setAverageDistanceCached(qreal v);


    bool graphMatrixDistanceGeodesicCreate(const bool &considerWeights = false,

                                           const bool &inverseWeights = false,

                                           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);


    bool isCentralityIndexComputed(const IndexType index) const;


    /* 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,

                                const bool &dropIsolates = false,

                                const bool &considerWeights = false,

                                const bool &inverseWeights = false,

                                const bool &symmetrize = false);


    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 *);

    // --- Triad census results (read-only access for CLI / reports) ---

    const QList<int> &graphTriadTypeFreqs() const { return triadTypeFreqs; }

    bool hasCalculatedTriadCensus() const { return calculatedTriad; }


    //  void eccentr_JordanCenter();    // TODO


    /* LAYOUTS */


    void layoutRandom();


    void layoutRadialRandom(const bool &guides = true);


    void layoutEgoRadial(const int egoVertex);


    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);


    qreal layoutForceDirected_Eades_moveNodes(const qreal &c4);


    qreal 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();


    bool randomNetErdosCreate(const int &N, const QString &model,

                              const int &m, const qreal &p,

                              const QString &mode, const bool &diag);


    bool randomNetScaleFreeCreate(const int &N, const int &power,

                                  const int &m0, const int &m,

                                  const qreal &alpha, const QString &mode);


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

                                   const double &beta, const QString &mode);


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

                                    const bool updateProgress = false);


    bool randomNetRegularCreate(const int &N, const int &degree,

                                const QString &mode, const bool &diag);


    bool randomNetLatticeCreate(const int &N, const int &length,

                                const int &dimension, const int &nei,

                                const QString &mode, const bool &circular);


    int factorial(int);


    // Progress cancellation query: readable by engines and sinks.

    bool progressCanceled() const;

    void resetProgressCanceled();


    //

    // LEGACY/INTERNAL: storage bookkeeping.

    // Do not use from UI/engines. (Later WS2 will likely privatize this and

    // expose intent-revealing helpers if needed.)

    H_Int vpos;


    // --------------------------------------------------------------------------

    // INTERNAL PROGRESS FACADE (WS2/F4)

    // Algorithm slices must not emit signals directly.

    // --------------------------------------------------------------------------

protected:

    void progressStatus(const QString &msg);

    void progressCreate(int max, const QString &msg);

    void progressUpdate(int value);

    void progressFinish();


    void uiProminenceDistributionSpline(const QVector<QPair<qreal, qreal>> &points,

                                        qreal min, qreal max,

                                        qreal minF, qreal maxF,

                                        const QString &seriesName,

                                        const QString &distImageFileName);

    void uiProminenceDistributionArea(const QVector<QPair<qreal, qreal>> &points,

                                      const qreal min,

                                      const qreal max,

                                      const qreal minF,

                                      const qreal maxF,

                                      const QString &name,

                                      const QString &distImageFileName);

    void uiProminenceDistributionBars(const QStringList &categories,

                                      const QVector<qreal> &frequencies,

                                      const qreal min,

                                      const qreal max,

                                      const qreal minF,

                                      const qreal maxF,

                                      const QString &name,

                                      const QString &distImageFileName);


private:

    void edgeAdd(const int &v1,

                 const int &v2,

                 const qreal &weight,

                 const int &type,

                 const QString &label,

                 const QString &color);


    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);


    void layoutRandomInMemory();


    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;

    QStack<GraphVisibilitySnapshot> m_visibilityHistory; // filter undo stack


    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_progressCanceled;

    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:28

DistanceEngine
Definition distance_engine.h:24

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:74

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

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

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

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

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

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

Graph::factorial
int factorial(int)
Definition graph_random_networks.cpp:886

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

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

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

Graph::signalRelationChangedToGW
void signalRelationChangedToGW(int)

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

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_selection.cpp:107

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

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

Graph::graphHasVertexCustomAttributes
QStringList graphHasVertexCustomAttributes() const
Returns true if at least one vertex has a 'custom' attribute.
Definition graph_vertex_style.cpp:186

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

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

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

Graph::progressStatus
void progressStatus(const QString &msg)
Emits a status message to be shown in the UI status bar.
Definition graph_ui_facade.cpp:35

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

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

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

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

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

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

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_vertices.cpp:177

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

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

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

Graph::moveToThreadFacade
void moveToThreadFacade(QThread *thread)
Definition graph_ui_facade.cpp:25

Graph::ssspNthOrderClear
void ssspNthOrderClear()
Definition graph_distance_cache.cpp:285

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

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

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

Graph::verticesEnd
VList::const_iterator verticesEnd() const
Definition graph_vertices.cpp:336

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

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

Graph::vertexAtIndex
GraphVertex * vertexAtIndex(int idx)
Returns the vertex at a given index.
Definition graph_vertices.cpp:312

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

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

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

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

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

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

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

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

Graph::edgeCustomAttributesSet
void edgeCustomAttributesSet(const int &v1, const int &v2, const QHash< QString, QString > &attrs)
Sets all custom attributes on edge v1→v2, replacing any previously stored attributes for that edge.
Definition graph_edge_style.cpp:179

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

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

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

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

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

Graph::layoutForceDirected_FR_moveNodes
qreal layoutForceDirected_FR_moveNodes(const qreal &temperature)
Moves all vertices to their new positions as computed by the Fruchterman-Reingold model.
Definition graph_layouts_force.cpp:1181

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

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_clustering_hierarchical.cpp:36

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

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

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

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

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

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

Graph::writeMatrixWalks
void writeMatrixWalks(const QString &fn, const int &length=0, const bool &simpler=false)
Writes the walks of given length matrix to a file in HTML. If length = 0, it writes the Total Walks m...
Definition graph_reports.cpp:3620

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

Graph::relationCurrentName
QString relationCurrentName() const
Gets the current relation name.
Definition graph_relations.cpp:188

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

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

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_distance_facade.cpp:30

Graph::edgeClicked
MyEdge edgeClicked()
Returns clicked edge.
Definition graph_selection.cpp:206

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_layouts_force.cpp:415

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

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

Graph::prominenceDistributionArea
void prominenceDistributionArea(const H_StrToInt &discreteClasses, const QString &name, const QString &distImageFileName)
Computes prominence distribution data and delegates Area chart rendering.
Definition graph_prominence_distribution.cpp:336

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

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

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

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_crawler.cpp:223

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

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

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_vertices.cpp:661

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

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

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

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

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_centrality.cpp:668

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

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

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

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_reports.cpp:6136

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

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

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

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

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

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:1385

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

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

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

Graph::randomNetLatticeCreate
bool randomNetLatticeCreate(const int &N, const int &length, const int &dimension, const int &nei, const QString &mode, const bool &circular)
Creates a lattice (mesh/grid) random network.
Definition graph_random_networks.cpp:715

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_cliques.cpp:25

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

Graph::vertexCustomAttributeRemove
void vertexCustomAttributeRemove(const int &v1, const QString &key)
Removes a single custom attribute key from vertex v1. Does nothing if the key does not exist.
Definition graph_vertex_style.cpp:642

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

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

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

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

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

Graph::writeClusteringCoefficient
bool writeClusteringCoefficient(const QString, const bool)
Writes the clustering coefficients to a file.
Definition graph_reports.cpp:3773

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

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

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

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

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

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

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

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

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

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

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

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_edge_style.cpp:50

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

Graph::progressFinish
void progressFinish()
Emits a signal to kill the progress box in the UI, indicating that the operation is complete.
Definition graph_ui_facade.cpp:68

Graph::graphDistanceGeodesicAverageCached
qreal graphDistanceGeodesicAverageCached() const
Returns the average geodesic distance of the graph, without recalculating it.
Definition graph_distance_facade.cpp:121

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

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

Graph::notConnectedPairsSize
int notConnectedPairsSize() const
Definition graph_distance_cache.cpp:346

Graph::setSymmetricCached
void setSymmetricCached(bool v)
Definition graph_distance_cache.cpp:360

Graph::setDiameterCached
void setDiameterCached(int v)
Definition graph_distance_cache.cpp:364

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

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_io.cpp:132

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

Graph::graphTriadTypeFreqs
const QList< int > & graphTriadTypeFreqs() const
Definition graph.h:1121

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

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

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_io.cpp:573

Graph::ssspComponentSize
int ssspComponentSize() const
Definition graph_distance_cache.cpp:325

Graph::saveToPajekFormat
bool saveToPajekFormat(const QString &fileName, QString networkName="", int maxWidth=0, int maxHeight=0)
Save the current graph to a Pajek (.paj) file.
Definition graph_io.cpp:297

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

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

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

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

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

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_reachability_walks.cpp:28

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

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

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

Graph::ssspStackPop
void ssspStackPop()
Definition graph_distance_cache.cpp:270

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

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_cliques.cpp:89

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

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

Graph::graphLoadedTerminateParserThreads
void graphLoadedTerminateParserThreads(QString reason)
Graph::graphLoadedTerminateParserThreads.
Definition graph_io.cpp:102

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

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

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

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

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

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

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

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

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

Graph::resetProgressCanceled
void resetProgressCanceled()
Resets the cancellation status.
Definition graph_ui_facade.cpp:42

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

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_layouts_force.cpp:1032

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

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

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

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_canvas.cpp:89

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

Graph::uiProminenceDistributionBars
void uiProminenceDistributionBars(const QStringList &categories, const QVector< qreal > &frequencies, const qreal min, const qreal max, const qreal minF, const qreal maxF, const QString &name, const QString &distImageFileName)
Definition graph_ui_prominence_distribution.cpp:201

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

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

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

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

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

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

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

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

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

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

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

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

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_prominence_distribution.cpp:166

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

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

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

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

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

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

Graph::layoutRandomInMemory
void layoutRandomInMemory()
Repositions all vertices at random coordinates without emitting any signals.
Definition graph_layouts_basic.cpp:136

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_similarity_matrices.cpp:32

Graph::writeMatrixSimilarityPearson
bool 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_reports.cpp:5210

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

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

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

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

Graph::symmetricCached
bool symmetricCached() const
Definition graph_distance_cache.cpp:361

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

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_edge_filters.cpp:213

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

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

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

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

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

Graph::createMatrixReachability
void createMatrixReachability()
Creates the reachability matrix XRM.
Definition graph_reachability_walks.cpp:38

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

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

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 prominence distribution data and delegates Spline chart rendering.
Definition graph_prominence_distribution.cpp:302

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

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

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

Graph::layoutForceDirected_F_rep
qreal layoutForceDirected_F_rep(const QString model, const qreal &dist, const qreal &optimalDistance)
Computes the repulsive force between two vertices for force-directed layouts.
Definition graph_layouts_force.cpp:964

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

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

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

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_centrality.cpp:692

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 arc from v1 to v2 into the internal graph data structures.
Definition graph_edges.cpp:285

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

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

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

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

Graph::writeCentralityEccentricity
bool 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_reports.cpp:2347

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

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

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

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_vertex_style.cpp:509

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

Graph::writeMatrixSimilarityMatching
bool 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_reports.cpp:5026

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

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

Graph::ssspComponentAdd
void ssspComponentAdd(int delta)
Definition graph_distance_cache.cpp:320

Graph::triadType_examine_MAN_label
void triadType_examine_MAN_label(int, int, int, GraphVertex *, GraphVertex *, GraphVertex *)
Definition graph_triad_census.cpp:144

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

Graph::vertexOutNeighborsSet
QSet< int > vertexOutNeighborsSet(const int &v1, const bool includeInEdges=false)
Returns the set of all 1-hop neighbors of vertex v1 in the current relation.
Definition graph_structure_metrics.cpp:89

Graph::incGeodesicsCount
void incGeodesicsCount()
Definition graph_distance_cache.cpp:375

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

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

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

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

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

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

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

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

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

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

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

Graph::signalRemoveNode
void signalRemoveNode(int)

Graph::vertexFilterBySelection
void vertexFilterBySelection(const QList< int > &selectedVertices)
Saves current visibility state and shows only the selected vertices and the edges between them.
Definition graph_node_filters.cpp:370

Graph::edgesEnabled
int edgesEnabled()
Returns the number of enabled ties in the current relation.
Definition graph_edges.cpp:548

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

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

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

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

Graph::writeTriadCensus
bool writeTriadCensus(const QString, const bool)
Definition graph_reports.cpp:3980

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

Graph::m_progressCanceled
bool m_progressCanceled
Definition graph.h:1434

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

Graph::vertexAttributesImport
int vertexAttributesImport(const QStringList &headers, const QVector< QStringList > &rows, int idColumn, bool matchByLabel)
Imports custom attributes from a parsed table into existing vertices.
Definition graph_vertex_style.cpp:669

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_reports.cpp:6444

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

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

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

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

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_centrality.cpp:535

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

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

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

Graph::uiProminenceDistributionArea
void uiProminenceDistributionArea(const QVector< QPair< qreal, qreal > > &points, const qreal min, const qreal max, const qreal minF, const qreal maxF, const QString &name, const QString &distImageFileName)
Definition graph_ui_prominence_distribution.cpp:111

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_matrix_adjacency.cpp:27

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_edges.cpp:506

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

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

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

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

Graph::ssspStackSize
int ssspStackSize() const
Definition graph_distance_cache.cpp:275

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

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

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

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

Graph::vertexIndexByNumber
int vertexIndexByNumber(int v) const
Returns the index of a vertex by its number.
Definition graph_vertices.cpp:302

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

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

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

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

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

Graph::ssspComponentReset
void ssspComponentReset(int value=1)
Definition graph_distance_cache.cpp:315

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

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

Graph::getThread
QThread * getThread() const
Definition graph_ui_facade.cpp:20

Graph::addToDistanceSum
void addToDistanceSum(qreal delta)
Definition graph_distance_cache.cpp:374

Graph::writeMatrixDissimilarities
bool 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_reports.cpp:4887

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

Graph::ssspStackEmpty
bool ssspStackEmpty() const
Definition graph_distance_cache.cpp:260

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

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

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

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

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_edges.cpp:640

Graph::vertexRemoveDummyNode
void vertexRemoveDummyNode(int)
Deletes a dummy node.
Definition graph_vertices.cpp:282

Graph::ssspNthOrderBegin
H_f_i::const_iterator ssspNthOrderBegin() const
Definition graph_distance_cache.cpp:290

Graph::progressCanceled
bool progressCanceled() const
Returns true if the user has requested cancellation via the progress dialog.
Definition graph_ui_facade.cpp:76

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

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

Graph::randomNetSmallWorldCreate
bool randomNetSmallWorldCreate(const int &N, const int &degree, const double &beta, const QString &mode)
Creates a Watts–Strogatz small-world random network.
Definition graph_random_networks.cpp:382

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_vertices.cpp:868

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

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_reachability_walks.cpp:116

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_edges.cpp:441

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

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

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

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_crawler.cpp:178

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

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

Graph::resetDistanceCentralityCacheFlags
void resetDistanceCentralityCacheFlags()
Definition graph_distance_cache.cpp:354

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

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_relations.cpp:277

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

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

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

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_vertices.cpp:1200

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

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

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_similarity_matrices.cpp:102

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_similarity_matrices.cpp:56

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

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

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

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

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_vertex_style.cpp:105

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

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

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

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

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

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

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

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

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

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

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_edges.cpp:607

Graph::setConnectedCached
void setConnectedCached(bool v)
Definition graph_distance_cache.cpp:363

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

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, const QHash< QString, QString > &edgeCustomAttributes=QHash< QString, QString >())
Checks if edge (v1,v2) already exists, then creates it and signals the UI to draw it.
Definition graph_edges.cpp:73

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

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

Graph::randomNetErdosCreate
bool randomNetErdosCreate(const int &N, const QString &model, const int &m, const qreal &p, const QString &mode, const bool &diag)
Creates an Erdős–Rényi random network.
Definition graph_random_networks.cpp:46

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::notConnectedPairsClear
void notConnectedPairsClear()
Definition graph_distance_cache.cpp:336

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

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

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::uiProminenceDistributionSpline
void uiProminenceDistributionSpline(const QVector< QPair< qreal, qreal > > &points, qreal min, qreal max, qreal minF, qreal maxF, const QString &seriesName, const QString &distImageFileName)
Definition graph_ui_prominence_distribution.cpp:34

Graph::vertexFilterByEgoNetwork
void vertexFilterByEgoNetwork(const int v1, const int depth=1)
Saves current visibility state and shows only the ego network of vertex v1 at the given depth.
Definition graph_node_filters.cpp:237

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

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

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

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_prestige.cpp:25

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

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_reachability_walks.cpp:291

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

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

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_vertex_style.cpp:468

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

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

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

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

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

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

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

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_distance_facade.cpp:46

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

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

Graph::dijkstra
void dijkstra(const int &s, const int &si, const bool &computeCentralities=false, const bool &inverseWeights=false, const bool &dropIsolates=false)

Graph::numberOfTriples
qreal numberOfTriples(int v1)
Definition graph_reachability_walks.cpp:348

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

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

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

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

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

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_prestige.cpp:213

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

Graph::signalWebCrawlParse
void signalWebCrawlParse(QNetworkReply *reply)

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

Graph::randomizeThings
void randomizeThings()
Adds a little universal randomness :)
Definition graph_random_networks.cpp:22

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

Graph::relationCurrent
int relationCurrent()
Gets the current relation number.
Definition graph_relations.cpp:178

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

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

Graph::edgeAttributesImport
int edgeAttributesImport(const QStringList &headers, const QVector< QStringList > &rows, int srcColumn, int tgtColumn)
Imports custom attributes from a parsed table into existing edges.
Definition graph_edge_style.cpp:215

Graph::graphHasEdgeCustomAttributes
QStringList graphHasEdgeCustomAttributes() const
Returns a list of all unique custom attribute keys present across all enabled edges in the current gr...
Definition graph_edge_style.cpp:267

Graph::vertexCustomAttributes
QHash< QString, QString > vertexCustomAttributes(const int &v1) const
Retrieves the vertex at the position specified by the index v1 from the vpos map and calls its custom...
Definition graph_vertex_style.cpp:215

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

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

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

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

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_distance_cache.cpp:237

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

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

Graph::layoutEgoRadial
void layoutEgoRadial(const int egoVertex)
Ego-centered radial layout.
Definition graph_layouts_basic.cpp:648

Graph::ssspNthOrderIncrement
void ssspNthOrderIncrement(int dist)
Definition graph_distance_cache.cpp:303

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

Graph::graphGeodesicsCountCached
qreal graphGeodesicsCountCached() const
Returns the number of geodesics (shortest paths) accumulated by DistanceEngine, without recalculating...
Definition graph_distance_facade.cpp:156

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

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

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

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

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

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

Graph::ssspNthOrderEnd
H_f_i::const_iterator ssspNthOrderEnd() const
Definition graph_distance_cache.cpp:295

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_edges.cpp:474

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Graph::vertexFilterByCentrality
void vertexFilterByCentrality(const float threshold, const bool overThreshold, const IndexType centralityIndex)
Filters vertices by their score on the given centrality or prestige index.
Definition graph_node_filters.cpp:50

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

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

Graph::notConnectedPairsInsert
void notConnectedPairsInsert(int from, int to)
Definition graph_distance_cache.cpp:341

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

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

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

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)
Performs Hierarchical Cluster Analysis (HCA) and writes the results to an HTML report file.
Definition graph_reports.cpp:4472

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

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_io.cpp:42

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

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

Graph::edgeCustomAttributes
QHash< QString, QString > edgeCustomAttributes(const int &v1, const int &v2) const
Returns the custom attributes stored on edge v1→v2. Returns an empty hash if no attributes have been ...
Definition graph_edge_style.cpp:192

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

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

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

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_state_flags.cpp:25

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

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_edges.cpp:345

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_vertices.cpp:200

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

Graph::randomNetRegularCreate
bool randomNetRegularCreate(const int &N, const int &degree, const QString &mode, const bool &diag)
Creates a pseudo-random d-regular network.
Definition graph_random_networks.cpp:477

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

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

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_io.cpp:520

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

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

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

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

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

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

Graph::vertexReciprocalNeighborsSet
QSet< int > vertexReciprocalNeighborsSet(const int &v1)
Returns the set of all vertices reciprocally connected to vertex v1 in the current relation.
Definition graph_structure_metrics.cpp:68

Graph::progressCreate
void progressCreate(int max, const QString &msg)
Emits a signal to create a progress box in the UI with the given maximum value and message.
Definition graph_ui_facade.cpp:52

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

Graph::vertexFilterByAttribute
void vertexFilterByAttribute(const FilterCondition &cond)
Shows only vertices whose custom attribute satisfies cond; all other vertices are hidden.
Definition graph_node_filters.cpp:537

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

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

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, const QHash< QString, QString > &customAttributes=QHash< QString, QString >())
Creates a new vertex.
Definition graph_vertices.cpp:42

Graph::writeMatrix
bool 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)
Computes and writes the specified matrix of the social network to an HTML report file.
Definition graph_reports.cpp:5724

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 prominence distribution and delegates Bar chart rendering.
Definition graph_prominence_distribution.cpp:372

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

Graph::layoutForceDirected_F_att
qreal layoutForceDirected_F_att(const QString model, const qreal &dist, const qreal &optimalDistance)
Computes the attractive (spring) force between two adjacent vertices.
Definition graph_layouts_force.cpp:926

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

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

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

Graph::signalDatasetDescription
void signalDatasetDescription(QString)

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

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

Graph::edgeFilterByAttribute
void edgeFilterByAttribute(const FilterCondition &cond)
Hides all edges whose custom attribute does not satisfy cond.
Definition graph_edge_filters.cpp:235

Graph::setAverageDistanceCached
void setAverageDistanceCached(qreal v)
Definition graph_distance_cache.cpp:376

Graph::vertexCustomAttributesSet
void vertexCustomAttributesSet(const int &v1, const QHash< QString, QString > &customAttributes)
Sets custom attributes for a specified vertex.
Definition graph_vertex_style.cpp:614

Graph::computeOptimalDistance
qreal computeOptimalDistance(const int &V)
Computes the optimal inter-vertex distance for force-directed layouts.
Definition graph_layouts_force.cpp:899

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

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

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

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_relations.cpp:32

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

Graph::isCentralityIndexComputed
bool isCentralityIndexComputed(const IndexType index) const
Returns true if the given centrality/prestige index has been computed.
Definition graph_centrality.cpp:740

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

Graph::graphSumDistanceCached
qreal graphSumDistanceCached() const
Returns the sum of all finite geodesic distances accumulated by DistanceEngine, without recalculating...
Definition graph_distance_facade.cpp:147

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

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

Graph::verticesBegin
VList::const_iterator verticesBegin() const
iterator helpers
Definition graph_vertices.cpp:334

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_reports_settings.cpp:36

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

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_edges.cpp:239

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

Graph::slotCancelComputation
void slotCancelComputation()
Slot called by MainWindow when the user clicks Cancel in the progress dialog.
Definition graph_ui_facade.cpp:84

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

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

Graph::m_visibilityHistory
QStack< GraphVisibilitySnapshot > m_visibilityHistory
Definition graph.h:1321

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

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

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

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_io.cpp:217

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

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

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

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

Graph::ModStatus
ModStatus
Definition graph.h:384

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Graph::graphHasVertexCustomIcons
bool graphHasVertexCustomIcons() const
Returns true if at least one vertex has a 'custom' shape (therefore a custom icon).
Definition graph_vertex_style.cpp:162

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_layouts_basic.cpp:29

Graph::ssspStackPush
void ssspStackPush(int v)
Definition graph_distance_cache.cpp:280

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

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

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

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

Graph::ssspNthOrderValue
int ssspNthOrderValue(qreal dist) const
Definition graph_distance_cache.cpp:299

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

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

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

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

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

Graph::edgeFilterReset
void edgeFilterReset()
Re-enables all edges in the current relation.
Definition graph_edge_filters.cpp:152

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

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

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

Graph::Clustering
Clustering
Definition graph.h:398

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

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

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

Graph::graphTriadCensus
bool graphTriadCensus()
Conducts a triad census and updates QList::triadTypeFreqs, which is the list carrying all triad type ...
Definition graph_triad_census.cpp:25

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_edges.cpp:373

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

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

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_structure_metrics.cpp:337

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

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_distance_facade.cpp:97

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

Graph::vertexReciprocalNeighborsList
QList< int > vertexReciprocalNeighborsList(const int &v1)
Returns a list of all vertices reciprocally connected to vertex v1 in the current relation.
Definition graph_structure_metrics.cpp:52

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

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

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

Graph::randomNetScaleFreeCreate
bool randomNetScaleFreeCreate(const int &N, const int &power, const int &m0, const int &m, const qreal &alpha, const QString &mode)
Creates a Barabási–Albert scale-free random network.
Definition graph_random_networks.cpp:203

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

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

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

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_crawler.cpp:65

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

Graph::vertexColor
QColor vertexColor(const int &v) const
Graph::vertexColor.
Definition graph_vertex_style.cpp:265

Graph::isConnectedCached
bool isConnectedCached() const
Returns true if the graph is connected, without recalculating it.
Definition graph_distance_facade.cpp:138

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

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

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

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_vertex_style.cpp:43

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

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

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

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

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

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

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

Graph::ssspStackTop
int ssspStackTop() const
Definition graph_distance_cache.cpp:265

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

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

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

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_layouts_force.cpp:45

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

Graph::vertexFilterRestoreAll
void vertexFilterRestoreAll()
Restores vertex and edge visibility from the top snapshot on the history stack.
Definition graph_node_filters.cpp:639

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

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

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

Graph::layoutForceDirected_Eades_moveNodes
qreal layoutForceDirected_Eades_moveNodes(const qreal &c4)
Moves all vertices to their new positions as computed by the Eades Spring Embedder model.
Definition graph_layouts_force.cpp:1105

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

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

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_structure_metrics.cpp:24

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_vertices.cpp:424

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::graphDiameterCached
int graphDiameterCached() const
Returns the number of geodesics (shortest paths) in the graph, without recalculating it.
Definition graph_distance_facade.cpp:129

Graph::hasCalculatedTriadCensus
bool hasCalculatedTriadCensus() const
Definition graph.h:1122

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

Graph::relationsClear
void relationsClear()
Clears relationships in this Graph.
Definition graph_relations.cpp:261

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

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

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

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

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

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

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

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

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

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_canvas.cpp:79

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

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

Graph::resetDistanceAggregates
void resetDistanceAggregates()
Definition graph_distance_cache.cpp:366

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_distance_cache.cpp:30

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_edges.cpp:358

Graph::edgeRemoveSelectedAll
void edgeRemoveSelectedAll()
Removes all selected edges.
Definition graph_edges.cpp:416

Graph::vertexLabelsVisibilitySet
void vertexLabelsVisibilitySet(bool toggle)

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

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

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

Graph::ssspStackClear
void ssspStackClear()
Definition graph_distance_cache.cpp:252

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

Graph::visibilityHistoryEmpty
bool visibilityHistoryEmpty() const
Returns true if the visibility history stack is empty.
Definition graph_node_filters.cpp:724

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

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

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

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

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

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

Graph::setFileFormat
void setFileFormat(const int &fileFormat)
Definition graph_metadata.cpp:85

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_reports.cpp:5369

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

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

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

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

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

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_layouts_basic.cpp:154

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

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

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

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

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

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

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

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

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

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_centrality.cpp:26

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

Graph::vertexIsolatedAllToggle
void vertexIsolatedAllToggle(const bool &toggle)
Toggles the status of all isolated vertices (those without links)
Definition graph_vertices.cpp:1135

Graph::progressUpdate
void progressUpdate(int value)
Emits a signal to update the progress box in the UI with the given value.
Definition graph_ui_facade.cpp:61

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_layouts_basic.cpp:236

Graph::vertexPtr
GraphVertex * vertexPtr(const int v)
Definition graph_vertices.cpp:1205

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

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

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_edge_filters.cpp:190

Graph::vertexCustomAttributeSet
void vertexCustomAttributeSet(const int &v1, const QString &key, const QString &value)
Sets a single custom attribute key/value on vertex v1, leaving all other attributes untouched.
Definition graph_vertex_style.cpp:628

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

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

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

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

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

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

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

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

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

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_reachability_walks.cpp:228

Matrix
Definition matrix.h:115

MyEdge
Lightweight value type representing a directed or undirected edge.
Definition global.h:224

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

filter_condition.h
Defines the FilterCondition struct shared by all attribute-based filters.

global.h
Global definitions, constants, enumerations, and utility types for SocNetV.

NetworkRequestType
NetworkRequestType
Identifies the purpose of an outgoing network request.
Definition global.h:150

IndexType
IndexType
Centrality / prestige index identifiers.
Definition global.h:118

SUBGRAPH_CLIQUE
static const int SUBGRAPH_CLIQUE
Definition global.h:171

MATRIX_ADJACENCY
static const int MATRIX_ADJACENCY
Definition global.h:180

Directed
@ Directed
Definition global.h:108

ChartType
ChartType
Chart style for prominence distribution visualizations.
Definition global.h:138

SelectedEdge
QPair< int, int > SelectedEdge
Identifies a selected edge by its two endpoint vertex numbers.
Definition global.h:217

SOCNETV_USE_NAMESPACE
#define SOCNETV_USE_NAMESPACE
Definition global.h:28

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

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

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

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

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

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

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

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

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

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

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

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,...

FilterCondition
Describes a single attribute-based filter condition.
Definition filter_condition.h:24

Graph::GraphVisibilitySnapshot
Definition graph.h:411

Graph::GraphVisibilitySnapshot::nodeVisible
QHash< int, bool > nodeVisible
Definition graph.h:412

Graph::GraphVisibilitySnapshot::active
bool active
Definition graph.h:414

Graph::GraphVisibilitySnapshot::arcVisible
QHash< QPair< int, int >, bool > arcVisible
Definition graph.h:413

webcrawler.h