#include <DirectedMultiGraph.hpp>
Inheritance diagram for graph::DirectedMultiGraph< TNode, TEdge >:
Collaboration diagram for graph::DirectedMultiGraph< 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, std::multimap< TNode, TEdge > > & | getSuccessorList () const & |
| ext::map< TNode, std::multimap< TNode, TEdge > > && | getSuccessorList () && |
| const ext::map< TNode, std::multimap< TNode, TEdge > > & | getPredecessorList () const & |
| ext::map< TNode, std::multimap< TNode, TEdge > > && | getPredecessorList () && |
| auto | operator<=> (const DirectedMultiGraph &other) const |
| bool | operator== (const DirectedMultiGraph &other) const |
| void | operator>> (ext::ostream &ostream) const override |
| virtual void | addNode (const TNode &n) |
| virtual void | addNode (TNode &&n) |
| template<typename ... Params> | |
| void | addNode (Params &&... params) |
| virtual bool | addEdge (const TEdge &e) |
| virtual bool | addEdge (TEdge &&e) |
| template<typename ... Params> | |
| bool | addEdge (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, std::multimap< TNode, TEdge > > | m_succ_list |
| ext::map< TNode, std::multimap< TNode, TEdge > > | m_pred_list |
Member Typedef Documentation
◆ edge_type
template<typename TNode , typename TEdge >
| using graph::DirectedMultiGraph< TNode, TEdge >::edge_type = TEdge |
◆ node_type
template<typename TNode , typename TEdge >
| using graph::DirectedMultiGraph< TNode, TEdge >::node_type = TNode |
Member Function Documentation
◆ addEdge() [1/3]
template<typename TNode , typename TEdge >
|
virtual |
Here is the call graph for this function:
◆ addEdge() [2/3]
template<typename TNode , typename TEdge >
template<typename... Params>
| bool graph::DirectedMultiGraph< TNode, TEdge >::addEdge | ( | Params &&... | params | ) |
◆ addEdge() [3/3]
template<typename TNode , typename TEdge >
|
virtual |
Here is the call graph for this function:
◆ addNode() [1/3]
template<typename TNode , typename TEdge >
|
virtual |
◆ addNode() [2/3]
template<typename TNode , typename TEdge >
template<typename... Params>
| void graph::DirectedMultiGraph< TNode, TEdge >::addNode | ( | Params &&... | params | ) |
◆ addNode() [3/3]
template<typename TNode , typename TEdge >
|
virtual |
◆ edgeCount()
template<typename TNode , typename TEdge >
|
overridevirtual |
Implements graph::GraphInterface< TNode, TEdge >.
◆ getEdges()
template<typename TNode , typename TEdge >
|
overridevirtual |
Implements graph::GraphInterface< TNode, TEdge >.
◆ getNodes()
template<typename TNode , typename TEdge >
|
overridevirtual |
Implements graph::GraphInterface< TNode, TEdge >.
◆ getPredecessorList() [1/2]
template<typename TNode , typename TEdge >
| ext::map< TNode, std::multimap< TNode, TEdge > > && graph::DirectedMultiGraph< TNode, TEdge >::getPredecessorList | ( | ) | && |
◆ getPredecessorList() [2/2]
template<typename TNode , typename TEdge >
| const ext::map< TNode, std::multimap< TNode, TEdge > > & graph::DirectedMultiGraph< TNode, TEdge >::getPredecessorList | ( | ) | const & |
Here is the caller graph for this function:
◆ getSuccessorList() [1/2]
template<typename TNode , typename TEdge >
| ext::map< TNode, std::multimap< TNode, TEdge > > && graph::DirectedMultiGraph< TNode, TEdge >::getSuccessorList | ( | ) | && |
◆ getSuccessorList() [2/2]
template<typename TNode , typename TEdge >
| const ext::map< TNode, std::multimap< TNode, TEdge > > & graph::DirectedMultiGraph< TNode, TEdge >::getSuccessorList | ( | ) | const & |
Here is the caller graph for this function:
◆ name()
template<typename TNode , typename TEdge >
|
overridevirtual |
Implements graph::GraphInterface< TNode, TEdge >.
◆ nodeCount()
template<typename TNode , typename TEdge >
|
overridevirtual |
Implements graph::GraphInterface< TNode, TEdge >.
◆ operator<=>()
template<typename TNode , typename TEdge >
|
inline |
Here is the call graph for this function:
◆ operator==()
template<typename TNode , typename TEdge >
|
inline |
Here is the call graph for this function:
◆ operator>>()
template<typename TNode , typename TEdge >
|
overridevirtual |
Implements graph::GraphBase.
◆ predecessorEdges()
template<typename TNode , typename TEdge >
|
overridevirtual |
Implements graph::GraphInterface< TNode, TEdge >.
◆ predecessors()
template<typename TNode , typename TEdge >
|
overridevirtual |
Implements graph::GraphInterface< TNode, TEdge >.
◆ successorEdges()
template<typename TNode , typename TEdge >
|
overridevirtual |
Implements graph::GraphInterface< TNode, TEdge >.
◆ successors()
template<typename TNode , typename TEdge >
|
overridevirtual |
Implements graph::GraphInterface< TNode, TEdge >.
Field Documentation
◆ m_pred_list
template<typename TNode , typename TEdge >
|
protected |
◆ m_succ_list
template<typename TNode , typename TEdge >
|
protected |
The documentation for this class was generated from the following file:
- alib2graph_data/src/graph/directed/DirectedMultiGraph.hpp
