C / C++ API Reference

The C++ classes (api/cpp/phasiccpp.h, api/cpp/scc_graph.h) and the C core (api/c/phasic.h) that the Python API is built on. The Python Graph is the C++ phasic::Graph; where a C++ method has a Python counterpart it links across to the Python reference.

C++ Classes

phasic::Graph
phasic::Vertex	Represents a vertex (state) in a phase-type graph.
phasic::Edge	Represents a directed edge between two vertices in a phase-type graph.
phasic::ParameterizedEdge	Represents a parameterized edge with coefficient vector.
phasic::PhaseTypeDistribution	Matrix representation of a phase-type distribution.
phasic::ProbabilityDistributionContext	Context for iterative computation of continuous phase-type distributions.
phasic::DPHProbabilityDistributionContext
phasic::AnyProbabilityDistributionContext	Base class for probability distribution contexts (continuous or discrete).
phasic::SCCGraph	Strongly Connected Component (SCC) decomposition of a graph.
phasic::SCCVertex	Single strongly connected component vertex.

C API

AVL trees	Balanced binary search trees used to index vertices by their state vector. (6 functions)
Symbolic expression system	The symbolic expression DAG underlying parameterized graph elimination. (34 functions)
Trace-based elimination	Record-once / evaluate-many elimination traces and their on-disk caching. (8 functions)
Strongly connected components	SCC decomposition, synthetic-graph construction, and parallel PRC composition. (14 functions)
Reward-compute graph & on-disk cache	Symbolic reward-compute graphs and their persistent (rev-3) parameterized cache. (12 functions)
Parameterized weights & formula tape	Updating edge weights / the initial probability vector, and the per-edge weight-formula bytecode tape. (8 functions)
Random sampling	Forward sampling of absorption times, jumps, sample paths, and stop vertices. (11 functions)
Distributions & forward contexts	PDF/CDF/PMF, Laplace transform, normalization, and the forward-stepping probability-distribution contexts. (13 functions)
Moments, sojourn & waiting time	Expected waiting time, expected sojourn times, and graph defect. (4 functions)
Reward transforms	Reward transformation of continuous and discrete phase-type graphs. (2 functions)
Graph construction & core	Creating graphs, vertices and edges; cloning, validation, and topology. (20 functions)