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>

#include <QLoggingCategory>

#include <atomic>

#include <functional>


#include "global.h"

#include "graph/filters/filter_condition.h"

#include "graph/filters/filter_spec.h"

#include "graph/filters/graph_query.h"

#include "graphvertex.h"

#include "matrix.h"

#include "parser.h"

#include "webcrawler.h"


// WS14: one logging category per src/graph/<domain>/ slice directory (centrality/, clustering/,

// distances/, layouts/, storage/, etc.), declared here since graph.h is already included by every

// slice .cpp, defined once in graph.cpp. Coarser than one-per-file (avoids ~60 near-empty categories

// for small files) but finer than one blanket category (keeps independent toggling per domain via

// QLoggingCategory::setFilterRules). lcGraph covers graph.cpp itself (the facade's own small file,

// distinct from the core/ slice). lcMatrix (src/matrix.cpp, unrelated file) is deliberately not

// reused here to avoid confusion with lcGraphMatrices (src/graph/matrices/).

Q_DECLARE_LOGGING_CATEGORY(lcGraph)

Q_DECLARE_LOGGING_CATEGORY(lcGraphCore)

Q_DECLARE_LOGGING_CATEGORY(lcStorage)

Q_DECLARE_LOGGING_CATEGORY(lcCentrality)

Q_DECLARE_LOGGING_CATEGORY(lcClustering)

Q_DECLARE_LOGGING_CATEGORY(lcDistances)

Q_DECLARE_LOGGING_CATEGORY(lcProminence)

Q_DECLARE_LOGGING_CATEGORY(lcReachability)

Q_DECLARE_LOGGING_CATEGORY(lcSimilarity)

Q_DECLARE_LOGGING_CATEGORY(lcLayouts)

Q_DECLARE_LOGGING_CATEGORY(lcGenerators)

Q_DECLARE_LOGGING_CATEGORY(lcGraphMatrices)

Q_DECLARE_LOGGING_CATEGORY(lcCohesion)

Q_DECLARE_LOGGING_CATEGORY(lcReporting)

Q_DECLARE_LOGGING_CATEGORY(lcFilters)

Q_DECLARE_LOGGING_CATEGORY(lcRelations)

Q_DECLARE_LOGGING_CATEGORY(lcGraphCrawler)

Q_DECLARE_LOGGING_CATEGORY(lcGraphUI)

Q_DECLARE_LOGGING_CATEGORY(lcGraphIO)


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

    void canvasSizeSetQuiet(const qreal &width, const qreal &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();

    void vertexFilterRemoveAt(int stackIndex);

    QList<FilterSpec> filterSpecList() const;

    bool visibilityHistoryEmpty() const;


    void vertexFilterByQuery(const GraphQuery &query);

    void edgeFilterByQuery(const GraphQuery &query);


    void edgeFilterByWeight(const qreal, const bool);

    void edgeFilterReset();


    void edgeFilterUnilateral(const bool &toggle);


    Graph *subgraphExtract(const QString &name,

                           const bool &includeCustomAttributes = true);


    Graph *subgraphExtractFromSelection(const QString &name,

                                        const bool &includeCustomAttributes = true);


    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 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 signalGraphDirectedChanged(const bool &directed);


    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


    // Bulk counterpart of signalSetEdgeVisibility (WS3 M2): a whole-graph operation like a

    // relation switch crosses to the GUI thread as one queued dispatch instead of one per edge.

    void signalSetEdgesVisibilityBatch(const QList<EdgeVisibilityChange> &changes);


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


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


    void signalLayoutFinished();


    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

        FilterSpec spec;                         // replay descriptor for arbitrary chip removal

    };


    /* 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(const QString &fileName);


    bool saveToUCINETDLFormat(const QString &fileName);


    bool saveToEdgeListWeightedFormat(const QString &fileName);


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


    bool vertexExists(const int &v1);

    int vertexIndexIfExists(const int &v1);


    bool vertexExists(const QString &label);

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


    // Plain (non-signal) relay points for GraphVertex, a QtCore-only value class holding a

    // Graph* rather than a QObject connection (WS3 M2). Each just emits the corresponding

    // signal below - this is what lets GraphVertex notify the UI layer without being a

    // QObject itself.

    void notifyEdgeVisibilityChanged(const int &relation, const int &source, const int &target,

                                     const bool &toggle, const bool &preserveReverseEdge = false,

                                     const int &edgeWeight = 1, const int &reverseEdgeWeight = 1);

    void notifyEdgesVisibilityBatch(const QList<EdgeVisibilityChange> &changes);


    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 edgeColorZeroInit(const QString &);  // #30: configurable zero-weight edge color

    void showZeroWeightEdgesSet(const bool &toggle); // #30: show/hide zero-weight edges


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

    bool isAnyRelationWeighted();


    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;


    int graphWeaklyConnectedComponents();


    int graphWeaklyConnectedComponentsCached() const;


    int graphStronglyConnectedComponents();


    int graphStronglyConnectedComponentsCached() const;


    const QHash<int,int> &vertexComponentId() const { return m_vertexComponentId; }


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

    // FACADE API (SUPPORTED): Vertex connectivity (Menger's theorem via max-flow, #7).

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


    enum class NodeConnectivityStatus

    {

        Ok,       // value holds the local vertex connectivity (>=0; 0 means unreachable)

        Adjacent, // source and target are directly connected by an edge - no finite vertex

                  // cut exists (Menger's theorem requires non-adjacency); value is meaningless

        Invalid   // source/target don't exist, or source == target

    };


    struct NodeConnectivityResult

    {

        NodeConnectivityStatus status = NodeConnectivityStatus::Invalid;

        int value = 0;

    };


    NodeConnectivityResult graphNodeConnectivity(int source, int target, bool respectDirection);


    int graphConnectivity(bool respectDirection);


    // WS6.7: read-only-by-convention accessors for kernel_matrix_v8's golden coverage.

    // Non-const because Matrix::item()/rows()/cols() are themselves non-const throughout.

    Matrix &matrixAdjacency() { return AM; }

    Matrix &matrixAdjacencyInverse() { return invAM; }

    Matrix &matrixDistances() { return DM; }

    Matrix &matrixReachability() { return XRM; }

    Matrix &matrixWalks() { return XM; }

    Matrix &matrixTotalWalks() { return XSM; }

    Matrix &matrixCliqueCoMembership() { return CLQM; }


    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 setReportsOutputFormat(const int &format);


    void writeDataSetToFile(const QString dir, const QString);


    void writeMatrixAdjacencyTo(QTextStream &os,

                                const bool &saveEdgeWeights = true);


    bool writeReciprocity(const QString fileName,

                          const bool considerWeights = false,

                          const int &format = ReportFormat::Html);


    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,

                     const int &format = ReportFormat::Html);


    void writeMatrixHTMLTable(QTextStream &outText, Matrix &M,

                              const bool &markDiag = true,

                              const bool &plain = false,

                              const bool &printInfinity = true,

                              const bool &dropIsolates = false);


    void writeMatrixCSVTable(QTextStream &outText, Matrix &M,

                             const bool &printInfinity = true,

                             const bool &dropIsolates = false);


    bool writeMatrixAdjacency(const QString fileName,

                              const bool &markDiag = true,

                              const int &format = ReportFormat::Html);


    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,

                                    const int &format = ReportFormat::Html);


    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,

                                       const int &format = ReportFormat::Html);


    bool writeMatrixSimilarityPearson(const QString fileName,

                                      const bool considerWeights,

                                      const QString &matrix = "adjacency",

                                      const QString &varLocation = "rows",

                                      const bool &diagonal = false,

                                      const int &format = ReportFormat::Html);


    bool writeEccentricity(const QString fileName,

                           const bool considerWeights = false,

                           const bool inverseWeights = false,

                           const bool dropIsolates = false,

                           const int &format = ReportFormat::Html);


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


    // Shared per-node score-table renderer for the centrality/prestige and (WS16 Step 3)

    // Reciprocity/Clustering Coefficient/Eccentricity report families. "Node" and "Label"

    // columns are fixed; dataColumnHeaders supplies the rest, in order. rowValues returns

    // that row's already-computed scores, in the same order as dataColumnHeaders - a value

    // equal to RAND_MAX renders as the infinity glyph, matching writeMatrixHTMLTable/

    // writeMatrixCSVTable's existing sentinel convention. isBlanked (optional; null means

    // "never blank", matching writeCentralityEigenvector's existing behaviour) decides

    // whether a row's data columns are replaced with a placeholder - e.g. dropped isolates -

    // preserving each report's current isolate-handling exactly rather than unifying it.

    // isSkipped (optional) omits the row entirely - distinct from isBlanked - matching

    // writeEccentricity()'s existing "don't print disabled nodes at all" behaviour.

    void writeScoreTableHTML(QTextStream &outText,

                             const QStringList &dataColumnHeaders,

                             const std::function<QVector<qreal>(GraphVertex *)> &rowValues,

                             const std::function<bool(GraphVertex *)> &isBlanked = nullptr,

                             const std::function<bool(GraphVertex *)> &isSkipped = nullptr);


    void writeScoreTableCSV(QTextStream &outText,

                            const QStringList &dataColumnHeaders,

                            const std::function<QVector<qreal>(GraphVertex *)> &rowValues,

                            const std::function<bool(GraphVertex *)> &isBlanked = nullptr,

                            const std::function<bool(GraphVertex *)> &isSkipped = nullptr);


    bool writeCentralityDegree(const QString,

                               const bool weights,

                               const bool dropIsolates,

                               const int &format = ReportFormat::Html);


    bool writeCentralityCloseness(const QString,

                                  const bool weights,

                                  const bool inverseWeights,

                                  const bool dropIsolates,

                                  const int &format = ReportFormat::Html);


    bool writeCentralityClosenessInfluenceRange(const QString,

                                                const bool weights,

                                                const bool inverseWeights,

                                                const bool dropIsolates,

                                                const int &format = ReportFormat::Html);


    bool writeCentralityBetweenness(const QString,

                                    const bool weights,

                                    const bool inverseWeights,

                                    const bool dropIsolates,

                                    const int &format = ReportFormat::Html);


    bool writeCentralityPower(const QString,

                              const bool weigths,

                              const bool inverseWeights,

                              const bool dropIsolates,

                              const int &format = ReportFormat::Html);


    bool writeCentralityStress(const QString,

                               const bool weigths,

                               const bool inverseWeights,

                               const bool dropIsolates,

                               const int &format = ReportFormat::Html);


    bool writeCentralityEccentricity(const QString,

                                     const bool weigths,

                                     const bool inverseWeights,

                                     const bool dropIsolates,

                                     const int &format = ReportFormat::Html);


    bool writeCentralityInformation(const QString,

                                    const bool weigths,

                                    const bool inverseWeights,

                                    const int &format = ReportFormat::Html);


    bool writeCentralityEigenvector(const QString,

                                    const bool &weigths = true,

                                    const bool &inverseWeights = false,

                                    const bool &dropIsolates = false,

                                    const int &format = ReportFormat::Html);


    bool writeCentralityKatz(const QString,

                             const qreal &alpha,

                             const bool &weigths = false,

                             const bool &inverseWeights = false,

                             const bool &dropIsolates = false,

                             const int &format = ReportFormat::Html);


    bool writeCentralityBonacich(const QString,

                                 const qreal &alpha,

                                 const qreal &beta,

                                 const bool &weigths = false,

                                 const bool &inverseWeights = false,

                                 const bool &dropIsolates = false,

                                 const int &format = ReportFormat::Html);


    bool writePrestigeDegree(const QString, const bool weights,

                             const bool dropIsolates,

                             const int &format = ReportFormat::Html);


    bool writePrestigeProximity(const QString, const bool weights,

                                const bool inverseWeights,

                                const bool dropIsolates,

                                const int &format = ReportFormat::Html);


    bool writePrestigePageRank(const QString, const bool Isolates = false,

                               const int &format = ReportFormat::Html);


    // HTML-only, permanently (WS16 Step 3): produces an equivalence matrix plus a dendrogram,

    // neither of which is a single flat table.

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


    // HTML-only, permanently (WS16 Step 3): writeCliqueCensus() combines 4 heterogeneous

    // sub-tables (clique list, actor-by-clique matrix, actor-by-actor co-membership matrix,

    // and a full hierarchical-clustering dendrogram sub-report) that don't reduce to one

    // flat CSV table.

    bool writeCliqueCensus(const QString &fileName,

                           const bool considerWeights);


    bool writeClusteringCoefficient(const QString, const bool,

                                    const int &format = ReportFormat::Html);


    bool writeTriadCensus(const QString, const bool,

                          const int &format = ReportFormat::Html);


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


    // WS5 A2: read-only accessors into m_apspDist/m_apspSigma (the flat-matrix APSP storage

    // DistanceEngine populates) for the current relation. Unlike graphDistanceGeodesic() above,

    // these never trigger a recompute - callers are expected to have already run

    // graphDistancesGeodesic() themselves. Returns RAND_MAX / 0 respectively if either vertex

    // number is unknown or nothing has been computed yet for the current relation.

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

    int apspShortestPaths(const int &v1, const int &v2);


    QMap<int, int> graphGeodesicDistanceDistribution(const bool &considerWeights = false,

                                                     const bool &inverseWeights = false);


    bool writeGeodesicDistribution(const QString &fileName,

                                   const bool &considerWeights = false,

                                   const bool &inverseWeights = false);


    QList<int> graphGeodesicShortestPath(const int &v1,

                                         const int &v2,

                                         const bool &considerWeights = false,

                                         const bool &inverseWeights = false);


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


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

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

    // Bulk-add n to the geodesics count — used by the post-parallel-loop reduction

    // so each thread contributes its total in one call instead of n individual increments.

    void addGeodesicsCount(int n);

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


    qreal estimateSpectralRadius(const bool &considerWeights = false,

                                 const bool &inverseWeights = false,

                                 const bool &dropIsolates = false);


    void centralityKatz(const qreal &alpha,

                        const bool &considerWeights = false,

                        const bool &inverseWeights = false,

                        const bool &dropIsolates = false);


    void centralityBonacich(const qreal &alpha,

                            const qreal &beta,

                            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 &dropIsolates = false,

                                const bool &considerWeights = false,

                                const bool &inverseWeights = false,

                                const bool &symmetrize = false);


    bool writeMatrixWalks(const QString &fn,

                          const int &length = 0,

                          const bool &simpler = false,

                          const int &format = ReportFormat::Html);


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


    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 runOnGuiThread(std::function<void()> fn);


    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:


    Graph *subgraphFromVertexList(const QList<int> &vertexNums,

                                   const QString &name,

                                   const bool &includeCustomAttributes = true);


    void applyVisibilitySnapshot(const GraphVisibilitySnapshot &snap);

    void vertexFilterReplaySpec(const FilterSpec &spec);


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


    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> 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, invAM, AM, invM, WM;

    Matrix XM, XSM, XRM, CLQM;


    // WS5 A2: relation-keyed flat-matrix APSP storage, replacing GraphVertex's per-vertex

    // QHash<int, QPair<int,qreal>>. Row = source vertex position, column = target vertex

    // position (see Graph::vertexIndexByNumber()/vertexAtIndex()), not vertex number.

    QHash<int, Matrix> m_apspDist;

    QHash<int, Matrix> m_apspSigma;


    H_StrToInt discreteDPs, discreteSDCs, discreteCCs, discreteBCs, discreteSCs;

    H_StrToInt discreteIRCCs, discreteECs, discreteEccentricities;

    H_StrToInt discretePCs, discreteICs, discretePRPs, discretePPs, discreteEVCs;

    H_StrToInt discreteCLCs, discreteKCs, discreteBPCs;


    QString m_reportsDataDir;

    int m_reportsRealPrecision;

    int m_reportsLabelLength;

    ChartType m_reportsChartType;

    ReportFormat m_reportsOutputFormat;


    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 meanKC, varianceKC;

    qreal meanBPC, varianceBPC;

    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 minKC, maxKC, sumKC;

    qreal m_lastKatzAlpha = -1;

    qreal minBPC, maxBPC, sumBPC;

    qreal m_lastBonacichAlpha = -1;

    qreal m_lastBonacichBeta = 0;

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

    int classesEVC, maxNodeEVC, minNodeEVC;

    int classesKC, maxNodeKC, minNodeKC;

    int classesBPC, maxNodeBPC, minNodeBPC;


    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 m_verticesCacheDropIsolates = false, m_verticesCacheCountAll = false;

    bool calculatedAdjacencyMatrix, calculatedDistances, calculatedCentralities;

    bool calculatedIsolates;

    bool calculatedEVC;

    bool calculatedKC;

    bool calculatedBPC;

    bool calculatedDP, calculatedDC, calculatedPP;

    bool calculatedIRCC, calculatedIC, calculatedPRP;

    bool calculatedTriad;

    bool calculatedGraphSymmetry, calculatedGraphReciprocity;

    bool calculatedGraphDensity, calculatedGraphWeighted;

    // Written by slotCancelComputation() (GUI thread, via Qt::DirectConnection) and read by

    // progressCanceled() (graphThread, mid-computation) - see WS15's P1 for why a plain bool and a

    // queued connection can't deliver this in time.

    std::atomic<bool> m_progressCanceled;

    bool m_graphIsDirected, m_graphIsSymmetric, m_graphIsWeighted, m_graphIsConnected;

    int m_graphWeaklyConnectedComponents;

    int m_graphStronglyConnectedComponents;

    QHash<int,int> m_vertexComponentId;


    int csRecDepth;


    QString m_fileName, m_graphName, initEdgeColor, initEdgeColorZero,

        initVertexColor, initVertexNumberColor, initVertexLabelColor;

    bool initShowZeroWeightEdges;

    QString initVertexShape, initVertexIconPath;

    QString htmlHead, htmlHeadLight, htmlEnd;


    QDateTime actualDateTime;

};


#endif

Chart
Definition chart.h:28

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

Graph::initEdgeColorZero
QString initEdgeColorZero
Definition graph.h:1648

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

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

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

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

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

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

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

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

Graph::signalRelationChangedToGW
void signalRelationChangedToGW(int)

Graph::writeMatrixWalks
bool writeMatrixWalks(const QString &fn, const int &length=0, const bool &simpler=false, const int &format=ReportFormat::Html)
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:3454

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

Graph::estimateSpectralRadius
qreal estimateSpectralRadius(const bool &considerWeights=false, const bool &inverseWeights=false, const bool &dropIsolates=false)
Estimates the adjacency matrix's spectral radius (dominant eigenvalue magnitude).
Definition graph_centrality.cpp:282

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

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, const int &format=ReportFormat::Html)
Computes and writes the specified matrix of the social network to an HTML report file.
Definition graph_reports.cpp:5489

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

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

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

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

Graph::vertexFilterRemoveAt
void vertexFilterRemoveAt(int stackIndex)
Removes the filter at stackIndex (0 = oldest) and replays the rest.
Definition graph_node_filters.cpp:749

Graph::classesCLC
int classesCLC
Definition graph.h:1596

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

Graph::canvasSizeSetQuiet
void canvasSizeSetQuiet(const qreal &width, const qreal &height)
Sets the canvas size without rescaling node positions.
Definition graph_canvas.cpp:70

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

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

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

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

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

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

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

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

Graph::DistanceEngine
friend class DistanceEngine
Definition graph.h:108

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

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

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

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

Graph::m_verticesCacheDropIsolates
bool m_verticesCacheDropIsolates
Definition graph.h:1626

Graph::calculatedBPC
bool calculatedBPC
Definition graph.h:1631

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

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

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

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

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

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

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

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

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

Graph::graphGeodesicDistanceDistribution
QMap< int, int > graphGeodesicDistanceDistribution(const bool &considerWeights=false, const bool &inverseWeights=false)
Returns a histogram of geodesic distances across all ordered vertex pairs.
Definition graph_distance_facade.cpp:95

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

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

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

Graph::m_graphStronglyConnectedComponents
int m_graphStronglyConnectedComponents
Definition graph.h:1643

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

Graph::m_lastBonacichBeta
qreal m_lastBonacichBeta
Definition graph.h:1578

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Graph::writeMatrixCSVTable
void writeMatrixCSVTable(QTextStream &outText, Matrix &M, const bool &printInfinity=true, const bool &dropIsolates=false)
Writes the matrix M as a comma-separated table to the specified text stream outText.
Definition graph_reports.cpp:6126

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

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

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

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

Graph::saveToEdgeListSimpleFormat
bool saveToEdgeListSimpleFormat(const QString &fileName)
Saves the active relation to a simple (unweighted) edge list file.
Definition graph_io.cpp:1369

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

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

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

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

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

Graph::setReportsOutputFormat
void setReportsOutputFormat(const int &format)
Sets the output format (HTML or CSV) new reports are written in.
Definition graph_reports_settings.cpp:79

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

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

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

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

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

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

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

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

Graph::writeCentralityCloseness
bool writeCentralityCloseness(const QString, const bool weights, const bool inverseWeights, const bool dropIsolates, const int &format=ReportFormat::Html)
Writes the closeness centralities to a file.
Definition graph_reports.cpp:1577

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

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

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

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

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

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

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

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

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

Graph::edgeColorZeroInit
void edgeColorZeroInit(const QString &)
Definition graph_edge_style.cpp:46

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

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

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

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

Graph::vertexFilterByQuery
void vertexFilterByQuery(const GraphQuery &query)
Shows only vertices whose custom attributes satisfy ALL conditions in query.
Definition graph_query_filters.cpp:31

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

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

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

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

Graph::writeScoreTableCSV
void writeScoreTableCSV(QTextStream &outText, const QStringList &dataColumnHeaders, const std::function< QVector< qreal >(GraphVertex *)> &rowValues, const std::function< bool(GraphVertex *)> &isBlanked=nullptr, const std::function< bool(GraphVertex *)> &isSkipped=nullptr)
CSV sibling of writeScoreTableHTML() - same column shape and semantics, comma-delimited,...
Definition graph_reports.cpp:480

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

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

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

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

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

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

Graph::discreteBPCs
H_StrToInt discreteBPCs
Definition graph.h:1530

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

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

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

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

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

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

Graph::graphStronglyConnectedComponentsCached
int graphStronglyConnectedComponentsCached() const
Definition graph_distance_cache.cpp:147

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

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

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

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

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

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

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

Graph::graphCliques
void graphCliques(QSet< int > R=QSet< int >(), QSet< int > P=QSet< int >(), QSet< int > X=QSet< int >())
Finds all maximal cliques in the graph using the Bron–Kerbosch algorithm with Tomita et al....
Definition graph_cliques.cpp:113

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

Graph::m_vertexComponentId
QHash< int, int > m_vertexComponentId
Definition graph.h:1644

Graph::writeReciprocity
bool writeReciprocity(const QString fileName, const bool considerWeights=false, const int &format=ReportFormat::Html)
Writes reciprocity report to filename.
Definition graph_reports.cpp:32

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

Graph::m_verticesCacheCountAll
bool m_verticesCacheCountAll
Definition graph.h:1626

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

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

Graph::matrixCliqueCoMembership
Matrix & matrixCliqueCoMembership()
Definition graph.h:876

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

Graph::graphWeaklyConnectedComponents
int graphWeaklyConnectedComponents()
Counts weakly connected components using BFS.
Definition graph_distance_facade.cpp:473

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

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

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

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

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

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

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

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

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

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

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

Graph::writePrestigePageRank
bool writePrestigePageRank(const QString, const bool Isolates=false, const int &format=ReportFormat::Html)
Writes the PageRank scores of vertices to a file.
Definition graph_reports.cpp:3259

Graph::graphWalksMatrixCreate
void graphWalksMatrixCreate(const int &N=0, const int &length=0, 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_matrix_reachability.cpp:101

Graph::writeCentralityClosenessInfluenceRange
bool writeCentralityClosenessInfluenceRange(const QString, const bool weights, const bool inverseWeights, const bool dropIsolates, const int &format=ReportFormat::Html)
Writes the "improved" closeness centrality indices to a file.
Definition graph_reports.cpp:1818

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

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

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

Graph::minBPC
qreal minBPC
Definition graph.h:1573

Graph::writeClusteringCoefficient
bool writeClusteringCoefficient(const QString, const bool, const int &format=ReportFormat::Html)
Writes the clustering coefficients to a file.
Definition graph_reports.cpp:3584

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

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

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

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

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

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

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

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

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

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

Graph::m_lastBonacichAlpha
qreal m_lastBonacichAlpha
Definition graph.h:1574

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

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

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

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

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

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

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

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::discretePRPs
H_StrToInt discretePRPs
Definition graph.h:1529

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

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

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

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

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

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

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

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

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

Graph::createMatrixReachability
void createMatrixReachability()
Creates the reachability matrix XRM.
Definition graph_matrix_reachability.cpp:24

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

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

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

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

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

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

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

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

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

Graph::centralityKatz
void centralityKatz(const qreal &alpha, const bool &considerWeights=false, const bool &inverseWeights=false, const bool &dropIsolates=false)
Computes Katz Centrality of each vertex, with attenuation factor alpha.
Definition graph_centrality_katz.cpp:60

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

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

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

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

Graph::minNodeKC
int minNodeKC
Definition graph.h:1598

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

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

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

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

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

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

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

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

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

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_matrix_distances.cpp:131

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

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

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

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

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

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

Graph::writePrestigeProximity
bool writePrestigeProximity(const QString, const bool weights, const bool inverseWeights, const bool dropIsolates, const int &format=ReportFormat::Html)
Writes the proximity prestige indices to a file.
Definition graph_reports.cpp:3076

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

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

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

Graph::varianceBPC
qreal varianceBPC
Definition graph.h:1553

Graph::runOnGuiThread
void runOnGuiThread(std::function< void()> fn)
Runs fn on the application's main/GUI thread, regardless of the calling thread.
Definition graph_ui_facade.cpp:53

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

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

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

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

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

Graph::addGeodesicsCount
void addGeodesicsCount(int n)
Definition graph_distance_cache.cpp:160

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

Graph::graphNodeConnectivity
NodeConnectivityResult graphNodeConnectivity(int source, int target, bool respectDirection)
Local vertex connectivity kappa(source, target): the minimum number of nodes, other than source and t...
Definition graph_connectivity.cpp:253

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

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

Graph::m_lastKatzAlpha
qreal m_lastKatzAlpha
Definition graph.h:1569

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

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

Graph::writeCentralityInformation
bool writeCentralityInformation(const QString, const bool weigths, const bool inverseWeights, const int &format=ReportFormat::Html)
Writes the information centralities to file.
Definition graph_reports.cpp:524

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

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

Graph::maxNodeKC
int maxNodeKC
Definition graph.h:1598

Graph::minNodeBPC
int minNodeBPC
Definition graph.h:1599

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

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

Graph::apspDistance
qreal apspDistance(const int &v1, const int &v2)
Returns the already-computed geodesic distance from vertex v1 to vertex v2, for the current relation,...
Definition graph_distance_facade.cpp:51

Graph::m_relationsDirected
QList< bool > m_relationsDirected
Definition graph.h:1489

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

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

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

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

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

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

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

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

Graph::vertexFilterReplaySpec
void vertexFilterReplaySpec(const FilterSpec &spec)
Re-applies one filter from its stored replay parameters.
Definition graph_node_filters.cpp:782

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

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

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

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::clusteringCoefficient
qreal clusteringCoefficient()
Computes local clustering coefficients and returns the network average Clustering Coefficient.
Definition graph_clustering_coefficients.cpp:241

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

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

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

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

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

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

Graph::m_reportsOutputFormat
ReportFormat m_reportsOutputFormat
Definition graph.h:1536

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::classesSDC
int classesSDC
Definition graph.h:1585

Graph::edgeFilterByQuery
void edgeFilterByQuery(const GraphQuery &query)
Shows only edges whose custom attributes satisfy ALL conditions in query.
Definition graph_query_filters.cpp:142

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

Graph::vertexComponentId
const QHash< int, int > & vertexComponentId() const
Definition graph.h:845

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

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

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

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

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

Graph::sumBPC
qreal sumBPC
Definition graph.h:1573

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

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

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

Graph::subgraphFromVertexList
Graph * subgraphFromVertexList(const QList< int > &vertexNums, const QString &name, const bool &includeCustomAttributes=true)
Core helper: builds an independent Graph copy from an explicit list of vertex numbers.
Definition graph_subgraphs.cpp:41

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

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

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

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

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

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

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

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

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

Graph::graphGeodesicShortestPath
QList< int > graphGeodesicShortestPath(const int &v1, const int &v2, const bool &considerWeights=false, const bool &inverseWeights=false)
Reconstructs one shortest path from vertex v1 to vertex v2.
Definition graph_distance_facade.cpp:232

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

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

Graph::graphWeaklyConnectedComponentsCached
int graphWeaklyConnectedComponentsCached() const
Definition graph_distance_cache.cpp:146

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

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

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

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

Graph::minKC
qreal minKC
Definition graph.h:1568

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

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::matrixAdjacencyInverse
Matrix & matrixAdjacencyInverse()
Definition graph.h:871

Graph::meanKC
qreal meanKC
Definition graph.h:1552

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

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

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

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

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

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

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

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

Graph::notifyEdgesVisibilityBatch
void notifyEdgesVisibilityBatch(const QList< EdgeVisibilityChange > &changes)
Plain relay to signalSetEdgesVisibilityBatch, for GraphVertex to notify the UI layer of many edges' v...
Definition graph_edges.cpp:363

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

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

Graph::classesKC
int classesKC
Definition graph.h:1598

Graph::matrixWalks
Matrix & matrixWalks()
Definition graph.h:874

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

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

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

Graph::apspShortestPaths
int apspShortestPaths(const int &v1, const int &v2)
Returns the already-computed number of shortest paths from vertex v1 to vertex v2,...
Definition graph_distance_facade.cpp:68

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

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

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

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

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

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

Graph::graphConnectivity
int graphConnectivity(bool respectDirection)
Global vertex connectivity kappa(G): the minimum, over every non-adjacent pair of vertices,...
Definition graph_connectivity.cpp:316

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::writeCentralityBetweenness
bool writeCentralityBetweenness(const QString, const bool weights, const bool inverseWeights, const bool dropIsolates, const int &format=ReportFormat::Html)
Writes Betweenness centralities to file.
Definition graph_reports.cpp:2007

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

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

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

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

Graph::maxKC
qreal maxKC
Definition graph.h:1568

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

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

Graph::writeCentralityDegree
bool writeCentralityDegree(const QString, const bool weights, const bool dropIsolates, const int &format=ReportFormat::Html)
Writes the Degree Centrality to a file.
Definition graph_reports.cpp:1337

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

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

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

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

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

Graph::signalLayoutFinished
void signalLayoutFinished()

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

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

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

Graph::saveToUCINETDLFormat
bool saveToUCINETDLFormat(const QString &fileName)
Saves the current graph to a UCINET DL file (FULLMATRIX format).
Definition graph_io.cpp:1205

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

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

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

Graph::filterSpecList
QList< FilterSpec > filterSpecList() const
Returns the FilterSpec list in application order (oldest first).
Definition graph_node_filters.cpp:829

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

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

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

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

Graph::subgraphExtractFromSelection
Graph * subgraphExtractFromSelection(const QString &name, const bool &includeCustomAttributes=true)
Extracts currently selected nodes and their inter-edges into an independent Graph copy.
Definition graph_subgraphs.cpp:194

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

Graph::m_progressCanceled
std::atomic< bool > m_progressCanceled
Definition graph.h:1640

Graph::signalWebCrawlParse
void signalWebCrawlParse(QNetworkReply *reply)

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

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

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

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

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

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

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

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

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::matrixReachability
Matrix & matrixReachability()
Definition graph.h:873

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Graph::signalSetEdgesVisibilityBatch
void signalSetEdgesVisibilityBatch(const QList< EdgeVisibilityChange > &changes)

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

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

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

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

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

Graph::classesBPC
int classesBPC
Definition graph.h:1599

Graph::writeMatrixSimilarityPearson
bool writeMatrixSimilarityPearson(const QString fileName, const bool considerWeights, const QString &matrix="adjacency", const QString &varLocation="rows", const bool &diagonal=false, const int &format=ReportFormat::Html)
Calls Graph::createMatrixSimilarityPearson() and writes Pearson Correlation Coefficients to given fil...
Definition graph_reports.cpp:4989

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

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

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

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

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

Graph::maxNodeBPC
int maxNodeBPC
Definition graph.h:1599

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

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

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

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

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

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

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

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

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

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

Graph::isWeighted
bool isWeighted()
Returns true if the current relation has at least one edge with weight other than 0 or 1 (i....
Definition graph_state_flags.cpp:33

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

Graph::m_apspDist
QHash< int, Matrix > m_apspDist
Definition graph.h:1523

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

Graph::writeCentralityKatz
bool writeCentralityKatz(const QString, const qreal &alpha, const bool &weigths=false, const bool &inverseWeights=false, const bool &dropIsolates=false, const int &format=ReportFormat::Html)
Writes the Katz Centrality report to a file, then displays it.
Definition graph_reports.cpp:953

Graph::graphStronglyConnectedComponents
int graphStronglyConnectedComponents()
Counts strongly connected components using Tarjan's algorithm.
Definition graph_distance_facade.cpp:568

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::saveToEdgeListWeightedFormat
bool saveToEdgeListWeightedFormat(const QString &fileName)
Saves the active relation to a weighted edge list file.
Definition graph_io.cpp:1302

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

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

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

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, const int &format=ReportFormat::Html)
Writes similarity matrix based on a matching measure to given html file.
Definition graph_reports.cpp:4798

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

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

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

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

Graph::subgraphExtract
Graph * subgraphExtract(const QString &name, const bool &includeCustomAttributes=true)
Extracts currently visible (non-filtered) nodes and their inter-edges into an independent Graph copy.
Definition graph_subgraphs.cpp:164

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

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

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

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

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

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

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::writeEccentricity
bool writeEccentricity(const QString fileName, const bool considerWeights=false, const bool inverseWeights=false, const bool dropIsolates=false, const int &format=ReportFormat::Html)
Writes the Eccentricity report to file.
Definition graph_reports.cpp:226

Graph::matrixTotalWalks
Matrix & matrixTotalWalks()
Definition graph.h:875

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

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

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

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

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

Graph::writeCentralityPower
bool writeCentralityPower(const QString, const bool weigths, const bool inverseWeights, const bool dropIsolates, const int &format=ReportFormat::Html)
Writes Power Centralities to a file.
Definition graph_reports.cpp:2614

Graph::isAnyRelationWeighted
bool isAnyRelationWeighted()
Returns true if any relation in the graph has at least one edge with weight other than 0 or 1.
Definition graph_state_flags.cpp:84

Graph::signalDatasetDescription
void signalDatasetDescription(QString)

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

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

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

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

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

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

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

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

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

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

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

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

Graph::showZeroWeightEdgesSet
void showZeroWeightEdgesSet(const bool &toggle)
Definition graph_edge_style.cpp:52

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

Graph::applyVisibilitySnapshot
void applyVisibilitySnapshot(const GraphVisibilitySnapshot &snap)
Restores vertex and edge visibility to the state recorded in snap.
Definition graph_node_filters.cpp:676

Graph::discreteCLCs
H_StrToInt discreteCLCs
Definition graph.h:1530

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::centralityBonacich
void centralityBonacich(const qreal &alpha, const qreal &beta, const bool &considerWeights=false, const bool &inverseWeights=false, const bool &dropIsolates=false)
Computes Bonacich Power Centrality of each vertex, with parameters alpha and beta.
Definition graph_centrality_bonacich.cpp:55

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

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

Graph::edgeFilterByWeight
void edgeFilterByWeight(const qreal, const bool)
Hides edges whose weight does not satisfy the threshold condition.
Definition graph_edge_filters.cpp:32

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

Graph::writeScoreTableHTML
void writeScoreTableHTML(QTextStream &outText, const QStringList &dataColumnHeaders, const std::function< QVector< qreal >(GraphVertex *)> &rowValues, const std::function< bool(GraphVertex *)> &isBlanked=nullptr, const std::function< bool(GraphVertex *)> &isSkipped=nullptr)
Renders a per-node score table as a sortable HTML.
Definition graph_reports.cpp:400

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

Graph::sumKC
qreal sumKC
Definition graph.h:1568

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

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

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

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::meanBPC
qreal meanBPC
Definition graph.h:1553

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

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

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

Graph::ModStatus
ModStatus
Definition graph.h:425

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

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

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

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

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

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

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

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

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

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

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

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

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

Graph::writeCentralityBonacich
bool writeCentralityBonacich(const QString, const qreal &alpha, const qreal &beta, const bool &weigths=false, const bool &inverseWeights=false, const bool &dropIsolates=false, const int &format=ReportFormat::Html)
Definition graph_reports.cpp:1132

Graph::calculatedKC
bool calculatedKC
Definition graph.h:1630

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::writeMatrixDissimilarities
bool writeMatrixDissimilarities(const QString fileName, const QString &metricStr, const QString &varLocation, const bool &diagonal, const bool &considerWeights, const int &format=ReportFormat::Html)
Writes dissimilarity matrix based on a metric/measure to given html file.
Definition graph_reports.cpp:4646

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

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

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

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

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

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

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

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

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

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

Graph::signalGraphDirectedChanged
void signalGraphDirectedChanged(const bool &directed)

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

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

Graph::matrixDistances
Matrix & matrixDistances()
Definition graph.h:872

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

Graph::Clustering
Clustering
Definition graph.h:439

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

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

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

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::NodeConnectivityStatus
NodeConnectivityStatus
Definition graph.h:851

Graph::NodeConnectivityStatus::Invalid
@ Invalid
Definition graph.h:855

Graph::NodeConnectivityStatus::Adjacent
@ Adjacent
Definition graph.h:853

Graph::NodeConnectivityStatus::Ok
@ Ok
Definition graph.h:852

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

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

Graph::writeGeodesicDistribution
bool writeGeodesicDistribution(const QString &fileName, const bool &considerWeights=false, const bool &inverseWeights=false)
Writes a geodesic distance distribution report to an HTML file.
Definition graph_distance_facade.cpp:143

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

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

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

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

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

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

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

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

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

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

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

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

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

Graph::Graph
Graph(const int &reserveVerticesSize=5000, const int &reserveEdgesPerVertexSize=500)
Constructs a Graph.
Definition graph.cpp:66

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

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

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

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

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

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

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

Graph::varianceKC
qreal varianceKC
Definition graph.h:1552

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

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

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

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

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

Graph::discreteKCs
H_StrToInt discreteKCs
Definition graph.h:1530

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

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

Graph::notifyEdgeVisibilityChanged
void notifyEdgeVisibilityChanged(const int &relation, const int &source, const int &target, const bool &toggle, const bool &preserveReverseEdge=false, const int &edgeWeight=1, const int &reverseEdgeWeight=1)
Plain relay to signalSetEdgeVisibility, for GraphVertex (a QtCore-only value class,...
Definition graph_edges.cpp:351

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

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

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

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

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

Graph::matrixAdjacency
Matrix & matrixAdjacency()
Definition graph.h:870

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

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

Graph::saveToDotFormat
bool saveToDotFormat(const QString &fileName)
Saves the active graph (current relation) to a GraphViz DOT file.
Definition graph_io.cpp:582

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

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

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

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

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

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

Graph::writePrestigeDegree
bool writePrestigeDegree(const QString, const bool weights, const bool dropIsolates, const int &format=ReportFormat::Html)
Writes the Degree Prestige of each node to a file.
Definition graph_reports.cpp:2839

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

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

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

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

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

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

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

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

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

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

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

Graph::writeTriadCensus
bool writeTriadCensus(const QString, const bool, const int &format=ReportFormat::Html)
Definition graph_reports.cpp:3745

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

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

Graph::vertexLabelsVisibilitySet
void vertexLabelsVisibilitySet(bool toggle)

Graph::maxBPC
qreal maxBPC
Definition graph.h:1573

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

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

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

Graph::writeCentralityStress
bool writeCentralityStress(const QString, const bool weigths, const bool inverseWeights, const bool dropIsolates, const int &format=ReportFormat::Html)
Writes the Stress centralities to a file.
Definition graph_reports.cpp:2241

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

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

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

Graph::vertexIndexIfExists
int vertexIndexIfExists(const int &v1)
Returns the internal position of the given vertex in m_graph, if it exists.
Definition graph_vertices.cpp:720

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

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

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

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

Graph::m_graphWeaklyConnectedComponents
int m_graphWeaklyConnectedComponents
Definition graph.h:1642

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

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

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

Graph::initShowZeroWeightEdges
bool initShowZeroWeightEdges
Definition graph.h:1650

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

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

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

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

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

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

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

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

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

Graph::writeCentralityEccentricity
bool writeCentralityEccentricity(const QString, const bool weigths, const bool inverseWeights, const bool dropIsolates, const int &format=ReportFormat::Html)
Writes the Eccentricity centralities (aka Harary Graph Centrality) to a file.
Definition graph_reports.cpp:2433

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

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

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

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

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

Graph::m_apspSigma
QHash< int, Matrix > m_apspSigma
Definition graph.h:1524

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

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

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

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

Graph::writeMatrixAdjacency
bool writeMatrixAdjacency(const QString fileName, const bool &markDiag=true, const int &format=ReportFormat::Html)
Definition graph_reports.cpp:6239

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

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

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

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

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

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

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

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

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

GraphVertex
Plain QtCore value class (not a QObject, WS3 M2) representing a vertex and its adjacency....
Definition graphvertex.h:55

Matrix
General-purpose dense matrix (adjacency, distance, similarity, sociomatrix, etc.),...
Definition matrix.h:71

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

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

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.

filter_spec.h
Replay descriptor stored alongside each GraphVisibilitySnapshot.

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

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

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

SUBGRAPH_CLIQUE
static const int SUBGRAPH_CLIQUE
Definition global.h:185

MATRIX_ADJACENCY
static const int MATRIX_ADJACENCY
Definition global.h:194

ReportFormat
ReportFormat
Output format for analysis reports: a full HTML document (default), or a lean, table-only CSV file (n...
Definition global.h:154

Html
@ Html
Definition global.h:155

Directed
@ Directed
Definition global.h:108

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

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

SOCNETV_USE_NAMESPACE
#define SOCNETV_USE_NAMESPACE
Definition global.h:28

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

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

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

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

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

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

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

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

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

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

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

graph_query.h
Defines GraphQuery — a multi-condition AND filter applied as one chip.

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

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

FilterSpec
Records how to re-apply one filter operation from scratch.
Definition filter_spec.h:36

Graph::GraphVisibilitySnapshot
Definition graph.h:452

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

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

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

Graph::GraphVisibilitySnapshot::spec
FilterSpec spec
Definition graph.h:456

Graph::NodeConnectivityResult
Definition graph.h:859

Graph::NodeConnectivityResult::value
int value
Definition graph.h:861

Graph::NodeConnectivityResult::status
NodeConnectivityStatus status
Definition graph.h:860

GraphQuery
A compound AND-logic filter applied in one operation (one snapshot, one chip).
Definition graph_query.h:28

webcrawler.h
Declares the WebCrawler class for extracting and processing network data from web pages and online re...