Algorithms Library Toolkit: graph::MixedGraph< TNode, TEdge > Class Template Reference

Algorithms Library Toolkit

A toolkit for algorithms, especially for algorithms on formal languages

#include <MixedGraph.hpp>

Inheritance diagram for graph::MixedGraph< TNode, TEdge >:

Collaboration diagram for graph::MixedGraph< TNode, TEdge >:

Public Types
using	node_type = TNode

using	edge_type = TEdge

Public Types inherited from graph::GraphInterface< TNode, TEdge >
using	node_type = TNode

using	edge_type = TEdge

Public Member Functions
const ext::map< TNode, ext::map< TNode, TEdge > > &	getAdjacencyList () const &

ext::map< TNode, ext::map< TNode, TEdge > > &&	getAdjacencyList () &&

const ext::map< TNode, ext::map< TNode, TEdge > > &	getSuccessorList () const &

ext::map< TNode, ext::map< TNode, TEdge > > &&	getSuccessorList () &&

const ext::map< TNode, ext::map< TNode, TEdge > > &	getPredecessorList () const &

ext::map< TNode, ext::map< TNode, TEdge > > &&	getPredecessorList () &&

auto	operator<=> (const MixedGraph &other) const

bool	operator== (const MixedGraph &other) const

void	operator>> (ext::ostream &ostream) const override

void	addNode (const TNode &n)

void	addNode (TNode &&n)

template<typename ... Params>
void	addNode (Params &&... params)

bool	addEdge (const TEdge &e)

bool	addEdge (TEdge &&e)

template<typename ... Params>
bool	addEdge (Params &&... params)

bool	addArc (const TEdge &e)

bool	addArc (TEdge &&e)

template<typename ... Params>
bool	addArc (Params &&... params)

size_t	nodeCount () const override

size_t	edgeCount () const override

ext::set< TNode >	getNodes () const override

ext::vector< TEdge >	getEdges () const override

ext::set< TNode >	successors (const TNode &n) const override

ext::vector< TEdge >	successorEdges (const TNode &n) const override

ext::set< TNode >	predecessors (const TNode &n) const override

ext::vector< TEdge >	predecessorEdges (const TNode &n) const override

std::string	name () const override

Public Member Functions inherited from graph::GraphBase
virtual	~GraphBase () noexcept=default

Protected Attributes
ext::map< TNode, ext::map< TNode, TEdge > >	m_adjacency_list

ext::map< TNode, ext::map< TNode, TEdge > >	m_succ_list

ext::map< TNode, ext::map< TNode, TEdge > >	m_pred_list

Member Typedef Documentation

◆ edge_type

template<typename TNode , typename TEdge >

using graph::MixedGraph< TNode, TEdge >::edge_type = TEdge

◆ node_type

template<typename TNode , typename TEdge >

using graph::MixedGraph< TNode, TEdge >::node_type = TNode

Member Function Documentation

◆ addArc() [1/3]

template<typename TNode , typename TEdge >

bool graph::MixedGraph< TNode, TEdge >::addArc ( const TEdge & e )

Here is the call graph for this function:

◆ addArc() [2/3]

template<typename TNode , typename TEdge >

template<typename... Params>

bool graph::MixedGraph< TNode, TEdge >::addArc ( Params &&... params )

◆ addArc() [3/3]

template<typename TNode , typename TEdge >

bool graph::MixedGraph< TNode, TEdge >::addArc ( TEdge && e )

Here is the call graph for this function:

◆ addEdge() [1/3]

template<typename TNode , typename TEdge >

bool graph::MixedGraph< TNode, TEdge >::addEdge ( const TEdge & e )

Here is the call graph for this function:

◆ addEdge() [2/3]

template<typename TNode , typename TEdge >

template<typename... Params>

bool graph::MixedGraph< TNode, TEdge >::addEdge ( Params &&... params )

◆ addEdge() [3/3]

template<typename TNode , typename TEdge >

bool graph::MixedGraph< TNode, TEdge >::addEdge ( TEdge && e )

Here is the call graph for this function:

◆ addNode() [1/3]

template<typename TNode , typename TEdge >

void graph::MixedGraph< TNode, TEdge >::addNode ( const TNode & n )

◆ addNode() [2/3]

template<typename TNode , typename TEdge >

template<typename... Params>

void graph::MixedGraph< TNode, TEdge >::addNode ( Params &&... params )

◆ addNode() [3/3]

template<typename TNode , typename TEdge >

void graph::MixedGraph< TNode, TEdge >::addNode ( TNode && n )

◆ edgeCount()

template<typename TNode , typename TEdge >

size_t graph::MixedGraph< TNode, TEdge >::edgeCount

overridevirtual

Implements graph::GraphInterface< TNode, TEdge >.

◆ getAdjacencyList() [1/2]

template<typename TNode , typename TEdge >

ext::map< TNode, ext::map< TNode, TEdge > > && graph::MixedGraph< TNode, TEdge >::getAdjacencyList ( ) &&

◆ getAdjacencyList() [2/2]

template<typename TNode , typename TEdge >

const ext::map< TNode, ext::map< TNode, TEdge > > & graph::MixedGraph< TNode, TEdge >::getAdjacencyList ( ) const &

Here is the caller graph for this function:

◆ getEdges()

template<typename TNode , typename TEdge >

ext::vector< TEdge > graph::MixedGraph< TNode, TEdge >::getEdges

overridevirtual

Implements graph::GraphInterface< TNode, TEdge >.

◆ getNodes()

template<typename TNode , typename TEdge >

ext::set< TNode > graph::MixedGraph< TNode, TEdge >::getNodes

overridevirtual

Implements graph::GraphInterface< TNode, TEdge >.

◆ getPredecessorList() [1/2]

template<typename TNode , typename TEdge >

ext::map< TNode, ext::map< TNode, TEdge > > && graph::MixedGraph< TNode, TEdge >::getPredecessorList ( ) &&

◆ getPredecessorList() [2/2]

template<typename TNode , typename TEdge >

const ext::map< TNode, ext::map< TNode, TEdge > > & graph::MixedGraph< TNode, TEdge >::getPredecessorList ( ) const &

Here is the caller graph for this function:

◆ getSuccessorList() [1/2]

template<typename TNode , typename TEdge >

ext::map< TNode, ext::map< TNode, TEdge > > && graph::MixedGraph< TNode, TEdge >::getSuccessorList ( ) &&

◆ getSuccessorList() [2/2]

template<typename TNode , typename TEdge >

const ext::map< TNode, ext::map< TNode, TEdge > > & graph::MixedGraph< TNode, TEdge >::getSuccessorList ( ) const &

Here is the caller graph for this function:

◆ name()

template<typename TNode , typename TEdge >

std::string graph::MixedGraph< TNode, TEdge >::name

overridevirtual

Implements graph::GraphInterface< TNode, TEdge >.

◆ nodeCount()

template<typename TNode , typename TEdge >

size_t graph::MixedGraph< TNode, TEdge >::nodeCount

overridevirtual

Implements graph::GraphInterface< TNode, TEdge >.

◆ operator<=>()

template<typename TNode , typename TEdge >

auto graph::MixedGraph< TNode, TEdge >::operator<=> ( const MixedGraph< TNode, TEdge > & other ) const

inline

Here is the call graph for this function:

◆ operator==()

template<typename TNode , typename TEdge >

bool graph::MixedGraph< TNode, TEdge >::operator== ( const MixedGraph< TNode, TEdge > & other ) const

inline

Here is the call graph for this function:

◆ operator>>()

template<typename TNode , typename TEdge >

void graph::MixedGraph< TNode, TEdge >::operator>> ( ext::ostream & ostream ) const

overridevirtual

Implements graph::GraphBase.

◆ predecessorEdges()

template<typename TNode , typename TEdge >

ext::vector< TEdge > graph::MixedGraph< TNode, TEdge >::predecessorEdges ( const TNode & n ) const

overridevirtual

Implements graph::GraphInterface< TNode, TEdge >.

◆ predecessors()

template<typename TNode , typename TEdge >

ext::set< TNode > graph::MixedGraph< TNode, TEdge >::predecessors ( const TNode & n ) const

overridevirtual

Implements graph::GraphInterface< TNode, TEdge >.

◆ successorEdges()

template<typename TNode , typename TEdge >

ext::vector< TEdge > graph::MixedGraph< TNode, TEdge >::successorEdges ( const TNode & n ) const

overridevirtual

Implements graph::GraphInterface< TNode, TEdge >.

◆ successors()

template<typename TNode , typename TEdge >

ext::set< TNode > graph::MixedGraph< TNode, TEdge >::successors ( const TNode & n ) const

overridevirtual

Implements graph::GraphInterface< TNode, TEdge >.

Field Documentation

◆ m_adjacency_list

template<typename TNode , typename TEdge >

ext::map<TNode, ext::map<TNode, TEdge> > graph::MixedGraph< TNode, TEdge >::m_adjacency_list

protected

◆ m_pred_list

template<typename TNode , typename TEdge >

ext::map<TNode, ext::map<TNode, TEdge> > graph::MixedGraph< TNode, TEdge >::m_pred_list

protected

◆ m_succ_list

template<typename TNode , typename TEdge >

ext::map<TNode, ext::map<TNode, TEdge> > graph::MixedGraph< TNode, TEdge >::m_succ_list

protected

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

alib2graph_data/src/graph/GraphFeatures.hpp
alib2graph_data/src/graph/mixed/MixedGraph.hpp