Class List

Here are the classes, structs, unions and interfaces with brief descriptions:

[detail level 123]

Ncli
CCliConfig
NSocNetV
NIO
CIGraphParseSink	Explicit mutation surface for parse-time graph construction
CGraphParseSinkGraph	Forwards parse mutations directly into an existing Graph instance
NTableImport	Free functions that parse tabular files (CSV / JSON) into an in-memory ParsedTable that can be fed to Graph::vertexAttributesImport() or Graph::edgeAttributesImport()
CParsedTable	In-memory representation of a parsed tabular file
CActor	The Actor struct Used while parsing edge lists
CCentralityScratchFinalize	Scratch for the finalize() phase — the single-threaded pass that runs once after runAllSources() completes, scanning every vertex to compute connectivity, group-level aggregates, and normalised (standardised) centrality scores from the raw per-vertex values runAllSources() already wrote. Distinct from CentralityScratchSSSP because these values are only meaningful for this one post-loop scan, not during the per-source SSSP pass itself
CCentralityScratchSSSP	Per-run scratch for centrality values computed once per SSSP source, before the parallel per-source loop existed to own its own copy (see ThreadLocalState::pss for the per-thread equivalent used inside runAllSources()'s blockingMap lambda)
CChart
CClickedEdge	Carries the identity and type of a clicked edge
CCompareActors	The CompareActors class Implements a min-priority queue Used while parsing weighted edge lists
CDialogBulkEdit
CDialogCentralityBonacich
CDialogCentralityKatz
CDialogClusteringHierarchical
CDialogDataSetSelect
CDialogDissimilarities
CDialogEdgeDichotomization
CDialogEdgeEdit
CDialogExportImage
CDialogExportPDF
CDialogFilterByAttribute
CDialogFilterEdgesByWeight
CDialogFilterNodesByCentrality
CDialogImportAttributes	Modal dialog that lets the user pick a CSV or JSON file and map its columns to graph node/edge identifiers before importing attributes
CDialogNodeEdit
CDialogNodeFind
CDialogPreviewFile
CDialogQueryBuilder	Visual query builder that composes a multi-condition AND filter
CConditionRow
CDialogRandErdosRenyi
CDialogRandLattice
CDialogRandRegular
CDialogRandScaleFree
CDialogRandSmallWorld
CDialogSettings
CDialogSimilarityMatches
CDialogSimilarityPearson
CDialogSystemInfo
CDialogWebCrawler
CDistanceEngine
CDistanceScratch	Per-run scratch state for DistanceEngine::compute(), scoped to one compute() call
CEdgeTableModel	Table model that caches edge data for the current relation from Graph and writes back via the Graph API
CEdgeRow
CEdgeVisibilityChange	One edge's visibility change, batched with others in signalSetEdgesVisibilityBatch (WS3 M2) so a bulk operation (e.g. a relation switch touching every edge) crosses from graphThread to the GUI thread as a single queued dispatch instead of one per edge
CFilterBarWidget	Thin strip between toolbar and canvas showing one chip per active filter
CChipData
CFilterCondition	Describes a single attribute-based filter condition
CFilterSpec	Records how to re-apply one filter operation from scratch
CGraph	The Graph class This is the main class for a Graph, used in conjuction with GraphVertex, Parser and Matrix objects. Graph class methods are the interface to various analysis algorithms GraphVertex class holds each vertex data (colors, strings, statistics, etc) Matrix class holds the adjacency matrix of the network. Parser class loads files of networks
CGraphVisibilitySnapshot
CNodeConnectivityResult
CGraphDistance	Holds a (target, distance) pair for use in Dijkstra's priority queue
CGraphDistanceProgressSink
CGraphDistancesCompare	Min-priority comparator for GraphDistance (used in std::priority_queue)
CGraphicsEdge
CGraphicsEdgeLabel
CGraphicsEdgeWeight
CGraphicsGuide
CGraphicsNode
CGraphicsNodeLabel
CGraphicsNodeNumber
CGraphicsWidget
CGraphQuery	A compound AND-logic filter applied in one operation (one snapshot, one chip)
CGraphTableWidget	A QWidget containing a QTabWidget with two tabs — Nodes and Edges — each backed by a sortable, searchable table view
CGraphVertex	Plain QtCore value class (not a QObject, WS3 M2) representing a vertex and its adjacency. Notifies the UI layer of edge-visibility changes via a plain call to its owning Graph (Graph::notifyEdgeVisibilityChanged / notifyEdgesVisibilityBatch) rather than emitting its own signal
CHeadlessLoadResult
CIDistanceProgressSink
CMainWindow	The base window of SocNetV contains all widgets and functionality
CMatrix	General-purpose dense matrix (adjacency, distance, similarity, sociomatrix, etc.), used throughout SocNetV wherever a network needs to be represented or analyzed as an N x M grid of numbers
CMyEdge	Lightweight value type representing a directed or undirected edge
CNodeTableModel	Table model that caches node data from Graph and writes back via the Graph API
CNodeRow
CNullDistanceProgressSink
CPairVF	(value, frequency) pair, used in distribution charts
CPairVFCompare	Min-priority comparator for PairVF (used in std::priority_queue)
CParser	Defines a class for network file loading and parsing
CParseConfig	ParseConfig boundary - the immutable config object
CPerSourceScratch
CTextEditor
CThreadLocalState
CWebCrawler	The WebCrawler class Parses HTML code it receives, locates urls inside it and puts them into a url queue (passed from the parent) while emitting signals to the parent to create new nodes and edges between them