maths
Geometry, graphs and interpolation
Loading...
Searching...
No Matches
Graph< T, Equal, Kind > Class Template Reference

#include <graph.hpp>

Public Member Functions

 Graph ()=default
 
int addNode (const T &value)
 
void addEdge (int from, int to, double weight=0.0)
 
void clear ()
 
void reserveNodes (std::size_t n)
 
void reserveEdges (std::size_t n)
 
const std::vector< T > & nodes () const
 
const std::vector< Link > & edges () const
 
const T & node (int i) const
 
std::size_t nodeCount () const
 
std::size_t edgeCount () const
 
bool empty () const
 
std::vector< int > neighbors (int idx) const
 
std::vector< int > successors (int idx) const
 
std::vector< int > predecessors (int idx) const
 
Graph mst () const
 
Graph difference (const Graph &other) const
 
Graph unionWith (const Graph &other) const
 
std::vector< std::vector< int > > connectedComponents () const
 
std::vector< int > bfs (int start) const
 

Static Public Member Functions

static constexpr bool isDirected ()
 
template<typename Weight = void>
static Graph fromPairs (const std::vector< std::pair< T, T > > &pairs)
 

Constructor & Destructor Documentation

◆ Graph()

template<typename T , typename Equal = void, GraphKind Kind = GraphKind::Undirected>
Graph< T, Equal, Kind >::Graph ( )
default

Member Function Documentation

◆ addEdge()

template<typename T , typename Equal = void, GraphKind Kind = GraphKind::Undirected>
void Graph< T, Equal, Kind >::addEdge ( int  from,
int  to,
double  weight = 0.0 
)
inline

◆ addNode()

template<typename T , typename Equal = void, GraphKind Kind = GraphKind::Undirected>
int Graph< T, Equal, Kind >::addNode ( const T &  value)
inline

◆ bfs()

template<typename T , typename Equal = void, GraphKind Kind = GraphKind::Undirected>
std::vector< int > Graph< T, Equal, Kind >::bfs ( int  start) const
inline

◆ clear()

template<typename T , typename Equal = void, GraphKind Kind = GraphKind::Undirected>
void Graph< T, Equal, Kind >::clear ( )
inline

◆ connectedComponents()

template<typename T , typename Equal = void, GraphKind Kind = GraphKind::Undirected>
std::vector< std::vector< int > > Graph< T, Equal, Kind >::connectedComponents ( ) const
inline

◆ difference()

template<typename T , typename Equal = void, GraphKind Kind = GraphKind::Undirected>
Graph Graph< T, Equal, Kind >::difference ( const Graph< T, Equal, Kind > &  other) const
inline

◆ edgeCount()

template<typename T , typename Equal = void, GraphKind Kind = GraphKind::Undirected>
std::size_t Graph< T, Equal, Kind >::edgeCount ( ) const
inline

◆ edges()

template<typename T , typename Equal = void, GraphKind Kind = GraphKind::Undirected>
const std::vector< Link > & Graph< T, Equal, Kind >::edges ( ) const
inline

◆ empty()

template<typename T , typename Equal = void, GraphKind Kind = GraphKind::Undirected>
bool Graph< T, Equal, Kind >::empty ( ) const
inline

◆ fromPairs()

template<typename T , typename Equal = void, GraphKind Kind = GraphKind::Undirected>
template<typename Weight = void>
static Graph Graph< T, Equal, Kind >::fromPairs ( const std::vector< std::pair< T, T > > &  pairs)
inlinestatic

◆ isDirected()

template<typename T , typename Equal = void, GraphKind Kind = GraphKind::Undirected>
static constexpr bool Graph< T, Equal, Kind >::isDirected ( )
inlinestaticconstexpr

◆ mst()

template<typename T , typename Equal = void, GraphKind Kind = GraphKind::Undirected>
Graph Graph< T, Equal, Kind >::mst ( ) const
inline

◆ neighbors()

template<typename T , typename Equal = void, GraphKind Kind = GraphKind::Undirected>
std::vector< int > Graph< T, Equal, Kind >::neighbors ( int  idx) const
inline

◆ node()

template<typename T , typename Equal = void, GraphKind Kind = GraphKind::Undirected>
const T & Graph< T, Equal, Kind >::node ( int  i) const
inline

◆ nodeCount()

template<typename T , typename Equal = void, GraphKind Kind = GraphKind::Undirected>
std::size_t Graph< T, Equal, Kind >::nodeCount ( ) const
inline

◆ nodes()

template<typename T , typename Equal = void, GraphKind Kind = GraphKind::Undirected>
const std::vector< T > & Graph< T, Equal, Kind >::nodes ( ) const
inline

◆ predecessors()

template<typename T , typename Equal = void, GraphKind Kind = GraphKind::Undirected>
std::vector< int > Graph< T, Equal, Kind >::predecessors ( int  idx) const
inline

◆ reserveEdges()

template<typename T , typename Equal = void, GraphKind Kind = GraphKind::Undirected>
void Graph< T, Equal, Kind >::reserveEdges ( std::size_t  n)
inline

◆ reserveNodes()

template<typename T , typename Equal = void, GraphKind Kind = GraphKind::Undirected>
void Graph< T, Equal, Kind >::reserveNodes ( std::size_t  n)
inline

◆ successors()

template<typename T , typename Equal = void, GraphKind Kind = GraphKind::Undirected>
std::vector< int > Graph< T, Equal, Kind >::successors ( int  idx) const
inline

◆ unionWith()

template<typename T , typename Equal = void, GraphKind Kind = GraphKind::Undirected>
Graph Graph< T, Equal, Kind >::unionWith ( const Graph< T, Equal, Kind > &  other) const
inline

The documentation for this class was generated from the following file: