aGrUM 3.1.1
a C++ library for (probabilistic) graphical models
graphs Directory Reference
Directory dependency graph for graphs:

Directories

 
algorithms
 
parts

Files

 
cliqueGraph.cpp
 source of basic clique graphs (join trees, etc)
 
cliqueGraph.h
 Basic class for all graphs of cliques (join trees, etc).
 
cliqueGraph_inl.h
 inline source of basic clique graphs
 
DAG.cpp
 Source implementation of Base classes for directed acyclic graphs.
 
DAG.h
 Base classes for directed acyclic graphs.
 
DAG_inl.h
 Inline implementation of Base classes for directed acylic graphs.
 
diGraph.cpp
 Source implementation of Base classes for oriented graphs.
 
diGraph.h
 Base classes for oriented graphs.
 
diGraph_inl.h
 Inline implementation of Base classes for oriented graphs.
 
fastGraph.cpp
 
fastGraph.h
 Builds a graph from a "fast" DOT-like textual description.
 
fastGraph_tpl.h
 
graphConcepts.cpp
 
graphConcepts.h
 C++20 concepts for aGrUM graph interfaces.
 
graphConcepts_inl.h
 
graphElements.cpp
 Outlined implementation of directed and undirected edges.
 
graphElements.h
 some utils for topology : NodeId, Edge, Arc and consorts ...
 
graphElements_inl.h
 Inlined implementation of directed and undirected edges.
 
mixedGraph.cpp
 Source implementation of Base classes for undirected graphs.
 
mixedGraph.h
 Base classes for mixed directed/undirected graphs.
 
mixedGraph_inl.h
 Inline implementation of Base classes for mixed graphs.
 
PAG.cpp
 Partial Ancestral Graph (PAG) — implementation.
 
PAG.h
 Partial Ancestral Graph (PAG) — graph type for FCI output.
 
PDAG.cpp
 Source implementation of Base classes for partially directed acyclic graphs.
 
PDAG.h
 Base classes for partially directed acyclic graphs.
 
PDAG_inl.h
 Inline implementation of Base classes for directed acylic graphs.
 
undiGraph.cpp
 Source implementation of Base classes for undirected graphs.
 
undiGraph.h
 Base classes for undirected graphs.
 
undiGraph_inl.h
 Inline implementation of Base classes for undirected graphs.