#include <ogdf/graphalg/matching_blossom/Cycle.h>
|
std::vector< long > | indexOf (std::vector< node > nodesToFind) |
| Get the indices of the edges before nodesToFind in edge order. For the startNode, size() - 1 is returned. More...
|
|
Definition at line 43 of file Cycle.h.
◆ Cycle()
ogdf::matching_blossom::Cycle::Cycle |
( |
edge |
startEdge | ) |
|
◆ addEdge()
void ogdf::matching_blossom::Cycle::addEdge |
( |
edge |
e | ) |
|
Use this method to add edges in cycle order.
◆ contains()
bool ogdf::matching_blossom::Cycle::contains |
( |
node |
v | ) |
|
Whether the cycle contains the node v
or not.
◆ edgeOrder()
const std::vector<edge>& ogdf::matching_blossom::Cycle::edgeOrder |
( |
| ) |
|
◆ indexOf() [1/3]
long ogdf::matching_blossom::Cycle::indexOf |
( |
node |
u | ) |
|
Get the index of the edge before u
in edge order. If u
is the startNode, size() - 1
is returned.
◆ indexOf() [2/3]
std::tuple<long, long> ogdf::matching_blossom::Cycle::indexOf |
( |
node |
u, |
|
|
node |
v |
|
) |
| |
Get the indices of the edges before u
and v
in edge order. For the startNode, size() - 1
is returned.
◆ indexOf() [3/3]
std::vector<long> ogdf::matching_blossom::Cycle::indexOf |
( |
std::vector< node > |
nodesToFind | ) |
|
|
private |
Get the indices of the edges before nodesToFind
in edge order. For the startNode, size() - 1
is returned.
◆ nodes()
const std::unordered_set<node>& ogdf::matching_blossom::Cycle::nodes |
( |
| ) |
|
◆ startNode()
node ogdf::matching_blossom::Cycle::startNode |
( |
| ) |
|
The first node of the cycle in edge order.
◆ m_edgeOrder
std::vector<edge> ogdf::matching_blossom::Cycle::m_edgeOrder |
|
private |
◆ m_nodes
std::unordered_set<node> ogdf::matching_blossom::Cycle::m_nodes |
|
private |
The documentation for this class was generated from the following file:
- include/ogdf/graphalg/matching_blossom/Cycle.h