![]() |
Code Documentation 3.7
Social Network Visualizer
|
Implements the DistanceEngine class for computing geodesic distances and centralities in the graph. More...
#include "engine/distance_engine.h"#include "graph.h"#include "engine/graph_distance_progress_sink.h"#include "engine/thread_local_state.h"#include <QDebug>#include <QLoggingCategory>#include <QMutex>#include <QThread>#include <QtConcurrent/QtConcurrent>#include <cstdlib>#include <queue>
Classes | |
| struct | DistanceScratch |
| Per-run scratch state for DistanceEngine::compute(), scoped to one compute() call. More... | |
| struct | CentralityScratchSSSP |
| 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). More... | |
| struct | CentralityScratchFinalize |
| 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. More... | |
Implements the DistanceEngine class for computing geodesic distances and centralities in the graph.