### start()

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00262.html

Starts the execution of the matching algorithm.

```APIDOC
## start()

### Description
This function starts the algorithm.

### Precondition
`init()` must be called before using this function.

### Method
`bool start()`
```

--------------------------------

### start()

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00684.html

Initializes or starts the Breadth-First Search process.

```APIDOC
## start()

### Description
Initializes or starts the Breadth-First Search process.

### Method
[Implicitly defined by class context]

### Parameters
None

### Response
[Response details not available in source]
```

--------------------------------

### start

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00755.html

Starts the DFS.

```APIDOC
## start

### Description
Starts the DFS.

### Method
[Method Signature]

### Parameters
None
```

```APIDOC
## start

### Description
Starts the DFS towards a target node.

### Method
[Method Signature]

### Parameters
#### Path Parameters
- **t** (Node) - The target node.
```

--------------------------------

### start ()

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00766.html

Starts the DFS traversal.

```APIDOC
## start ()

### Description
Starts the DFS traversal.

### Method
`start()`
```

--------------------------------

### start

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a01079.html

Starts the pathfinding process from a given node.

```APIDOC
## start

### Description
Starts the pathfinding process from a given node.

### Method
start

### Parameters
- **t** (const Node &) - The target node.
- **k** (int) - The number of paths to find (default is 2).
```

--------------------------------

### start

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00821.html

Starts the matching process.

```APIDOC
## start()

### Description
Starts the matching process.

### Inline
inline
```

--------------------------------

### start()

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00261.html

Starts the execution of the maximum weighted matching algorithm.

```APIDOC
## start()

### Description
Starts the algorithm. This function begins the process of finding the maximum weighted matching.

### Method
void start()
```

--------------------------------

### start

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a01072.html

Starts the pathfinding process from a target node.

```APIDOC
## start(const Node &t, int k=2)

### Description
Initiates the pathfinding process, typically used internally after initialization, targeting node `t` for `k` paths.

### Method
start

### Parameters
- **t** (const Node &) - The target node.
- **k** (int) - The number of paths to find (default is 2).
```

--------------------------------

### start

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00393.html

Initiates the algorithm execution with different starting conditions.

```APIDOC
## start (no arguments)

### Description
Executes the algorithm to process all nodes.

### Method
void start()
```

```APIDOC
## start (target node)

### Description
Executes the algorithm until a specified target node is reached.

### Method
void start(Node t)

### Parameters
#### Path Parameters
- **t** (Node) - The target node to reach.
```

```APIDOC
## start (NodeBoolMap)

### Description
Executes the algorithm until a condition specified by a NodeBoolMap is met.

### Method
Node start(const NodeBoolMap &nm)

### Parameters
#### Path Parameters
- **nm** (const NodeBoolMap&) - A constant reference to a NodeBoolMap defining the stopping condition.
```

--------------------------------

### start

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00691.html

Starts the BfsVisitor process with a given node.

```APIDOC
## start

### Description
Starts the BfsVisitor process with a given node.

### Method
(Implicitly called by the visitor pattern)

### Parameters
* **node** (const Node &) - The starting node.

### Response
(No specific response documented)
```

--------------------------------

### start (no parameters)

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00694.html

Starts the BFS traversal.

```APIDOC
## start (no parameters)

### Description
Starts the BFS traversal.

### Method
start()

### Response
#### Success Response (200)
- [Response fields]
```

--------------------------------

### start

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00751.html

Starts the DFS traversal.

```APIDOC
## start ()

### Description
Starts the DFS traversal.

### Method
[Implicitly defined by class context]
```

--------------------------------

### start (nm)

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00694.html

Starts the BFS traversal using NM.

```APIDOC
## start (nm)

### Description
Starts the BFS traversal using NM.

### Method
start(const NM &nm)

### Parameters
#### Path Parameters
- **nm** (const NM &) - Description of parameter nm.

### Response
#### Success Response (200)
- [Response fields]
```

--------------------------------

### start()

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00260.html

Starts the execution of the algorithm. Requires `init()` to be called first.

```APIDOC
## start()

### Description
Begins the execution of the maximum weighted fractional matching algorithm.

### Precondition
`init()` must be called before using this function.
```

--------------------------------

### start

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00753.html

Starts the DFS traversal.

```APIDOC
## start

### Description
Starts the DFS traversal.

### Method
[Method Signature]

### Parameters
None
```

--------------------------------

### start (no arguments)

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00767.html

Starts the traversal.

```APIDOC
## start (no arguments)

### Description
Starts the traversal.

### Method
start()

### Endpoint
[Endpoint not specified]
```

--------------------------------

### start

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00772.html

Initializes the starting point for the Dijkstra algorithm.

```APIDOC
## start

### Description
Initializes the starting point for the Dijkstra algorithm.

### Method
start

### Returns
(void)
```

--------------------------------

### start (no arguments)

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00748.html

Starts the DFS traversal.

```APIDOC
## start (no arguments)

### Description
Starts the DFS traversal.

### Method
`start()`
```

--------------------------------

### initStart

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00802.html

Starts the initialization process.

```APIDOC
## initStart

### Description
Starts the initialization process.

### Method
`initStart()`
```

--------------------------------

### start

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a01008.html

Initializes the search process.

```APIDOC
## start

### Description
Initializes the search process. This overload might start with default parameters.

### Method
(Initialization method)

### Parameters
None
```

```APIDOC
## start

### Description
Initializes the search process, targeting a specific destination node.

### Method
(Initialization method)

### Parameters
- **dest** (Node) - The destination node for the search.
```

```APIDOC
## start

### Description
Initializes the search process using a provided node-boolean map.

### Method
(Initialization method)

### Parameters
- **nm** (const NodeBoolMap &) - A constant reference to a NodeBoolMap to initialize the search.
```

--------------------------------

### start

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a01010.html

Initializes the search process.

```APIDOC
## start

### Description
Initializes the search process.

### Method
`start()`
```

```APIDOC
## start

### Description
Initializes the search process towards a destination node.

### Method
`start(Node dest)`
```

```APIDOC
## start

### Description
Initializes the search process with a given node boolean map.

### Method
`start(const NodeBoolMap &nm)`
```

--------------------------------

### start()

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/functions_func_0x73.html

Starts various graph algorithms like MaxCardinalitySearch, Timer, BfsVisit, MinCostArborescence, Suurballe, NagamochiIbaraki, MaxWeightedPerfectFractionalMatching, Dfs, BellmanFord, Dijkstra, and EdmondsKarp.

```APIDOC
## start()

### Description
Starts various graph algorithms including MaxCardinalitySearch, Timer, BfsVisit, MinCostArborescence, Suurballe, NagamochiIbaraki, MaxWeightedPerfectFractionalMatching, Dfs, BellmanFord, Dijkstra, and EdmondsKarp.

### Method
N/A

### Endpoint
N/A

### Parameters
N/A

### Request Body
N/A

### Response
N/A

### Request Example
N/A

### Response Example
N/A
```

--------------------------------

### Start Algorithm

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00257.html

Starts the algorithm to compute a fractional matching. Optionally performs postprocessing.

```APIDOC
## Start Algorithm

### Description
Starts the algorithm and computes a fractional matching. Postprocessing can be optionally performed.

### Signature
void start(bool postprocess=true)

### Parameters
- **postprocess**: A boolean indicating whether to perform postprocessing after computation (default is true).
```

--------------------------------

### start(const NodeBoolMap &nm)

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00684.html

Initializes or starts the Breadth-First Search process using a provided NodeBoolMap.

```APIDOC
## start(const NodeBoolMap &nm)

### Description
Initializes or starts the Breadth-First Search process using a provided NodeBoolMap.

### Method
[Implicitly defined by class context]

### Parameters
#### Path Parameters
- **nm** (const NodeBoolMap &) - Description not available

### Response
[Response details not available in source]
```

--------------------------------

### start

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00751.html

Starts the DFS traversal towards a target node.

```APIDOC
## start (Node t)

### Description
Starts the DFS traversal towards a target node.

### Method
[Implicitly defined by class context]

### Parameters
#### Path Parameters
- **t** (Node) - Description not available
```

--------------------------------

### start

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00385.html

Executes the algorithm.

```APIDOC
## start

### Description
Executes the algorithm.

### Method
bool start()
```

--------------------------------

### start

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/functions_0x73.html

Starts an algorithm or process. Overloaded for various algorithms.

```APIDOC
## start()

### Description
Starts an algorithm or process.

### Overloads
- [MaxCardinalitySearch< GR, CAP, TR >](a00255.html#a26cb87dd67f1b37bbdb2424688311023)
- [NagamochiIbaraki< GR, CM, TR >](a00271.html#a60de64d75454385b23995437f1d72669)
- [MinCostArborescence< GR, CM, TR >](a00264.html#a60de64d75454385b23995437f1d72669)
- [BellmanFord< GR, LEN, TR >](a00045.html#a60de64d75454385b23995437f1d72669)
- [Timer](a00423.html#a60de64d75454385b23995437f1d72669)
- [Bfs< GR, TR >](a00051.html#a8b8de9dfc16e4b3cb6b38733e82f6449)
- [BfsVisitor< GR >](a00055.html#af763d0c0856194421ebd6ccc73b921c3)
- [MaxWeightedFractionalMatching< GR, WM >](a00260.html#a60de64d75454385b23995437f1d72669)
- [BfsVisit< GR, VS, TR >](a00053.html#a8b8de9dfc16e4b3cb6b38733e82f6449)
- [Circulation< GR, LM, UM, SM, TR >](a00078.html#aad5997aaaa2d622f0ca57f8b24a51a7b)
- [Dfs< GR, TR >](a00119.html#a60de64d75454385b23995437f1d72669)
- [DfsVisitor< GR >](a00123.html#af763d0c0856194421ebd6ccc73b921c3)
- [MaxCardinalitySearch< GR, CAP, TR >](a00255.html#a60de64d75454385b23995437f1d72669)
- [DfsVisit< GR, VS, TR >](a00121.html#a8b8de9dfc16e4b3cb6b38733e82f6449)
- [MaxWeightedPerfectMatching< GR, WM >](a00263.html#aad5997aaaa2d622f0ca57f8b24a51a7b)
- [DfsVisit< GR, VS, TR >](a00121.html#a0306ffe17dfaf127245ad33dbd9c7c63)
- [Dijkstra< GR, LEN, TR >](a00133.html#a60de64d75454385b23995437f1d72669)
- [EdmondsKarp< GR, CAP, TR >](a00152.html#a60de64d75454385b23995437f1d72669)
- [MaxFractionalMatching< GR, TR >](a00257.html#a2b87bbc0b9cbd0fd9f193bee71984810)
- [DfsVisit< GR, VS, TR >](a00121.html#a60de64d75454385b23995437f1d72669)
- [MaxWeightedPerfectFractionalMatching< GR, WM >](a00262.html#aad5997aaaa2d622f0ca57f8b24a51a7b)
- [MaxWeightedMatching< GR, WM >](a00261.html#a60de64d75454385b23995437f1d72669)
- [MaxCardinalitySearch< GR, CAP, TR >](a00255.html#ac63ebb11ff26c825dc40bed7d909b5fb)
- [Dijkstra< GR, LEN, TR >](a00133.html#a8b8de9dfc16e4b3cb6b38733e82f6449)
- [Suurballe< GR, LEN, TR >](a00420.html#a9d42cea8a927e065105207778790cc69)
- [BfsVisit< GR, VS, TR >](a00053.html#a60de64d75454385b23995437f1d72669)
- [Bfs< GR, TR >](a00051.html#acf9ccb55c64065301a4e11f13e4d05fb)
```

--------------------------------

### Compile and Run Bookshelf Parser Example

Source: https://github.com/limbo018/limbo/blob/master/docs/parsers/Bookshelf.md

Commands to compile and run a C++ example using the Bookshelf parser. Ensure LIMBO_DIR is set to the library's installation path.

```bash
g++ -o test_bison test_bison.cpp -I $LIMBO_DIR/include -L $LIMBO_DIR/lib -lbookshelfparser
./test_bison benchmarks/simple/acc64.aux
```

--------------------------------

### run

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00257.html

A shortcut for calling init() and then start().

```APIDOC
## run

### Description
Just a shortcut for the next code:
* init();
* start();

### Parameters
- **postprocess** (bool) - Optional - If true, the algorithm postprocesses the matching to contain only matching edges and half-value odd cycles after the push-relabel algorithm.
```

--------------------------------

### start (NodeBoolMap)

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00675.html

Starts the BFS using a NodeBoolMap. This function is inline.

```APIDOC
## start (NodeBoolMap)

### Description
Initializes the BFS traversal using a provided Node-Boolean map (`nm`).

### Method
`start(const NodeBoolMap &nm)`

### Parameters
*   **nm** (const NodeBoolMap &) - The map defining initial node states.
```

--------------------------------

### Timer Constructor Example

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00423.html

Initializes a Timer object. The 'run' parameter indicates whether the timer should start immediately upon construction.

```cpp
Timer(bool _run_ = true)
```

--------------------------------

### Initialization and Setup

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00045.html

Functions to initialize the algorithm, add source nodes, and set up the length map.

```APIDOC
## init

### Description
Initializes the internal data structures for the Bellman-Ford algorithm.

### Signature
void init(const Value value = OperationTraits::infinity())

### Parameters
- **value** (Value): The initial value for nodes, defaults to infinity.
```

```APIDOC
## addSource

### Description
Adds a new source node to the graph for the algorithm.

### Signature
void addSource(Node source, Value dst = OperationTraits::zero())

### Parameters
- **source** (Node): The source node to add.
- **dst** (Value): The initial distance to the source node, defaults to zero.
```

```APIDOC
## lengthMap

### Description
Sets the length map to be used by the algorithm.

### Signature
BellmanFord& lengthMap(const LengthMap& map)

### Parameters
- **map** (LengthMap): The length map to set.

### Returns
Returns `(*this)` to allow chaining.
```

--------------------------------

### start

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00783.html

Initializes the Dijkstra algorithm.

```APIDOC
## start

### Description
Initializes the Dijkstra algorithm, preparing it for pathfinding operations. This overload likely sets up internal data structures without a specific starting point.

### Method
inline
```

--------------------------------

### start

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00680.html

Initializes the Breadth-First Search starting from a given node or map.

```APIDOC
## start(Node t)

### Description
Initializes the Breadth-First Search starting from a given node.

### Method
[Implicit method call]

### Endpoint
[N/A]

### Parameters
#### Path Parameters
- **t** (Node) - Description not available

### Request Example
None

### Response
None
```

```APIDOC
## start(const NodeBoolMap &nm)

### Description
Initializes the Breadth-First Search starting from a given node-boolean map.

### Method
[Implicit method call]

### Endpoint
[N/A]

### Parameters
#### Path Parameters
- **nm** (const NodeBoolMap &) - Description not available

### Request Example
None

### Response
None
```

--------------------------------

### Initialization and Setup

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00343.html

Functions for initializing the algorithm's data structures and adding source nodes.

```APIDOC
## init

### Description
Initializes the internal data structures for the algorithm.

### Signature
void init()

```

```APIDOC
## addSource

### Description
Adds a new source node to the algorithm with an optional capacity.

### Signature
void addSource(Node source, Value capacity = 0)

### Parameters
- **source** (Node) - The source node to add.
- **capacity** (Value) - The capacity of the source node (optional, defaults to 0).

```

--------------------------------

### Compile and Run DefParser Example

Source: https://github.com/limbo018/limbo/blob/master/docs/parsers/Def.md

Instructions for compiling and running the DefParser test adaptation. Ensure the LIMBO_DIR environment variable is set to the library's installation path.

```bash
g++ -o test_adapt test_adapt.cpp -I $LIMBO_DIR/include -L $LIMBO_DIR/lib -ldefparseradapt
./test_adapt benchmarks/simple.def
```

--------------------------------

### start

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00368.html

Executes the algorithm starting from a target node with an optional iteration count.

```APIDOC
## start

### Description
Execute the algorithm.

### Signature
int start(const Node &t, int k=2)
```

--------------------------------

### Counting Arcs Between Two Nodes

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00017.html

This example demonstrates how to count all arcs between two nodes (u and v) using the AllArcLookUp class. It iterates through all arcs starting from the first one found by the operator() until no more arcs are returned.

```cpp
AllArcLookUp<ListDigraph> ae(g);
...
int n = 0;
for(Arc a = ae(u,v); a != INVALID; a=ae(u,v,a)) n++;

```

--------------------------------

### fullInit

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a01072.html

Performs a full initialization starting from a source node.

```APIDOC
## fullInit(const Node &s)

### Description
Performs a full initialization of the algorithm, starting from the source node `s`.

### Method
fullInit

### Parameters
- **s** (const Node &) - The source node.
```

--------------------------------

### Basic Timer Usage Example

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00423.html

Demonstrates the basic usage of the Timer class for measuring execution time of functions. Include the necessary headers and instantiate the Timer. The overloaded output operator << displays the elapsed time. Use restart() to reset and start the timer for subsequent measurements.

```cpp
#include<lemon/time_measure.h>

#include<iostream>

int main()
{

...

Timer t;
doSomething();
std::cout << t << '\n';
t.restart();
doSomethingElse();
std::cout << t << '\n';

...

}
```

--------------------------------

### start ()

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a01012.html

Initializes the search process with default parameters.

```APIDOC
## start ()

### Description
Initializes the search process with default parameters.

### Signature
void start()

### Inline
Yes
```

--------------------------------

### start (single source)

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00693.html

Starts the BFS traversal from a given source node.

```APIDOC
## start (single source)

### Description
Starts the BFS traversal from a given source node.

### Method
start(Node s)

### Parameters
#### Path Parameters
- **s** (Node) - The source node to start the traversal from.
```

--------------------------------

### start (no args)

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00378.html

Executes the shortest path algorithm completely from all sources.

```APIDOC
void 
[start](a00133.html#a60de64d75454385b23995437f1d72669) ()
```

--------------------------------

### Count Arcs Between Two Nodes using DynArcLookUp

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00143.html

This example demonstrates how to count the number of parallel arcs between two nodes (u and v) using the DynArcLookUp class. It iterates through all arcs from u to v, starting from an invalid arc, and increments a counter for each valid arc found.

```c++
DynArcLookUp<ListDigraph> ae(g);
...
int n = 0;
for(Arc a = ae(u,v); a != INVALID; a = ae(u,v,a)) n++;

```

--------------------------------

### start (no arguments)

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00119.html

Executes the DFS algorithm starting from the root(s) of the graph.

```APIDOC
## start

### Description
Executes the DFS algorithm starting from the root(s) of the graph.

### Method
`start()`

### Parameters
None

### Returns
None
```

--------------------------------

### Initialization and Configuration

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00255.html

Methods for initializing the algorithm and setting up necessary data structures like the heap and cardinality maps.

```APIDOC
## MaxCardinalitySearch::init()

### Description
Initializes the internal data structures required for the algorithm.

### Method
void

### Endpoint
init()

## MaxCardinalitySearch::cardinalityMap

### Description
Sets the map storing the cardinalities calculated by the algorithm.

### Method
template<typename GR, typename CAP, typename TR>
MaxCardinalitySearch &cardinalityMap(CardinalityMap &m)

### Endpoint
cardinalityMap(CardinalityMap &m)

## MaxCardinalitySearch::processedMap

### Description
Sets the map storing the processed nodes.

### Method
template<typename GR, typename CAP, typename TR>
MaxCardinalitySearch &processedMap(ProcessedMap &m)

### Endpoint
processedMap(ProcessedMap &m)

## MaxCardinalitySearch::heap

### Description
Sets the heap and the cross reference used by the algorithm.

### Method
template<typename GR, typename CAP, typename TR>
MaxCardinalitySearch &heap(Heap &hp, HeapCrossRef &cr)

### Endpoint
heap(Heap &hp, HeapCrossRef &cr)

```

--------------------------------

### initStart

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00801.html

Starts the initialization process.

```APIDOC
## initStart

### Description
Starts the initialization process.

### Method
inline
```

--------------------------------

### Start Perfect Algorithm

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00257.html

Starts the algorithm to compute a perfect fractional matching. Optionally performs postprocessing.

```APIDOC
## Start Perfect Algorithm

### Description
Starts the algorithm and computes a perfect fractional matching. Postprocessing can be optionally performed.

### Signature
bool startPerfect(bool postprocess=true)

### Parameters
- **postprocess**: A boolean indicating whether to perform postprocessing after computation (default is true).

### Returns
True if a perfect fractional matching is found, false otherwise.
```

--------------------------------

### start (with NM)

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00693.html

Starts the BFS traversal using a given NM (Node Map).

```APIDOC
## start (with NM)

### Description
Starts the BFS traversal using a given NM (Node Map).

### Method
start(const NM &nm)

### Parameters
#### Path Parameters
- **nm** (const NM &) - The Node Map to use.
```

--------------------------------

### start

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00708.html

Starts the circulation process.

```APIDOC
## start

### Description
Starts the circulation process.

### Method
inline

### Parameters
None

### Response
#### Success Response (void)
No return value.
```

--------------------------------

### start()

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00423.html

Starts the time counters. If the timer is started multiple times, it will remain running until stop() is called an equal number of times.

```APIDOC
## start()

### Description
This function starts the time counters. If the timer is started more than ones, it will remain running until the same amount of [stop()](a00423.html#a8c528baf37154d347366083f0f816846) is called.

### Method
`void start()`

### See Also
* [stop()](a00423.html#a8c528baf37154d347366083f0f816846 "Stop the time counters. ")
```

--------------------------------

### start

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00348.html

Begins the execution of the algorithm. This is the primary function to invoke to start the main process.

```APIDOC
## start

### Description
Executes the algorithm.

### Method
bool

### Parameters
None

### Response
- `true` if the execution was successful, `false` otherwise.
```

--------------------------------

### Run MinCostArborescence from a Single Source

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00264.html

A shortcut method to run the MinCostArborescence algorithm starting from a specified root node 's'. It internally calls init(), addSource(), and start().

```cpp
mca.run(s);

```

--------------------------------

### fullInit

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/functions_func_0x66.html

Initializes a full component, returning a Suurballe structure.

```APIDOC
## fullInit()

### Description
Initializes a full component.

### Returns
- Suurballe< GR, LEN, TR >
```

--------------------------------

### obj (Get)

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00411.html

Get the objective function.

```APIDOC
## obj () const

### Description
Get the objective function.

### Returns
- **Expr** - The current objective function.

```

--------------------------------

### rowName (get)

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00247.html

Get the name of a row.

```APIDOC
## rowName

### Description
Get the name of a row.

### Method
(Implicitly a getter method)

### Parameters
- **r** ([Row](a00334.html)) - The row whose name is to be retrieved.

### Returns
std::string - The name of the row.
```

--------------------------------

### colName (get)

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00247.html

Get the name of a column.

```APIDOC
## colName

### Description
Get the name of a column.

### Method
(Implicitly a getter method)

### Parameters
- **c** ([Col](a00090.html)) - The column whose name is to be retrieved.

### Returns
std::string - The name of the column.
```

--------------------------------

### start (no args)

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00051.html

Executes the entire BFS algorithm from the source nodes.

```APIDOC
## void start()

### Description
Executes the algorithm. This method runs the BFS algorithm from the root node(s) in order to compute the shortest path to each node. The algorithm computes the shortest path tree (forest) and the distance of each node from the root(s).

### Precondition
[init()](a00051.html#a02fd73d861ef2e4aabb38c0c9ff82947) must be called and at least one root node should be added with [addSource()](a00051.html#ac785b6504b67a963b4c20bae90441a77) before using this function.

### Note
`b.start()` is just a shortcut of the following code.
```c++
while ( !b.emptyQueue() ) {
  b.processNextNode();
}
```
```

--------------------------------

### start

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a01021.html

Initializes the minimum cost arborescence computation.

```APIDOC
## start

### Description
Initializes the minimum cost arborescence computation.

### Remarks
This is an inline member function.
```

--------------------------------

### start

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a01014.html

Initializes the search process. This is an inline function.

```APIDOC
## start

### Description
Initializes the search process.

### Method
inline

### Parameters
None
```

```APIDOC
## start

### Description
Initializes the search process targeting a specific destination node.

### Method
inline

### Parameters
- dest (Node) - The destination node.
```

```APIDOC
## start

### Description
Initializes the search process using a provided node-boolean map.

### Method
inline

### Parameters
- nm (const NodeBoolMap &) - The node-boolean map.
```

--------------------------------

### objCoeff (Get)

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00411.html

Get an element of the objective function.

```APIDOC
## objCoeff [Col c] const

### Description
Get an element of the objective function.

### Parameters
#### Path Parameters
- **c** (Col) - Required - The column for which to get the objective coefficient.

### Returns
- **Value** - The objective coefficient value.

```

--------------------------------

### Get Row

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00399.html

Gets a row (constraint) of the LP.

```APIDOC
## row

### Description
Get a row (i.e a constraint) of the LP.

### Signature
`Expr row(Row r) const`
```

--------------------------------

### start

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00353.html

Executes the algorithm's initialization phase. This typically involves setting up data structures and preparing for the main computation loop.

```APIDOC
template<typename GR, typename CAP, typename TR>
void start()
```

--------------------------------

### init

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00820.html

Initializes the matching process.

```APIDOC
## init

### Description
Initializes the matching process. This method should be called before running the matching algorithm.

### Returns
void
```

--------------------------------

### obj (get)

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00076.html

Gets the current objective function.

```APIDOC
## obj (get)

### Description
Get the objective function.

### Method
Expr obj() const

### Returns
- **Expr**: The current objective function expression.
```

--------------------------------

### rowName (get)

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00076.html

Gets the name of a row (constraint).

```APIDOC
## rowName (get)

### Description
Gets the name of a row (constraint).

### Signature
```cpp
std::string rowName(Row r) const
```

### Parameters
* **r** (Row) - The row whose name to retrieve.

### Returns
The name of the row as a std::string.
```

--------------------------------

### initStart()

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00239.html

Starts the initialization process for the LinkedElevator.

```APIDOC
## initStart()

### Description
Start the initialization process.

### Method
`void initStart()`
```

--------------------------------

### colName (get)

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00076.html

Gets the name of a column (variable).

```APIDOC
## colName (get)

### Description
Gets the name of a column (variable).

### Signature
```cpp
std::string colName(Col c) const
```

### Parameters
* **c** (Col) - The column whose name to retrieve.

### Returns
The name of the column as a std::string.
```

--------------------------------

### row (get)

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00076.html

Gets a row (constraint) of the LP.

```APIDOC
## row (get)

### Description
Gets a row (constraint) of the LP.

### Signature
```cpp
Expr row(Row r) const
```

### Parameters
* **r** (Row) - The row to retrieve.

### Returns
An Expr object representing the constraint.
```

--------------------------------

### init

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00357.html

Initializes the algorithm with a given start node.

```APIDOC
## init

### Description
Initialize the algorithm.

### Method
void

### Parameters
#### Path Parameters
- **s** (const Node &) - Description not available
```

--------------------------------

### Install Boost Polygon API Executable and Benchmarks

Source: https://github.com/limbo018/limbo/blob/master/test/geometry/CMakeLists.txt

Installs the Boost Polygon API executable and benchmark directory. This installation is controlled by the INSTALL_LIMBO flag.

```cmake
if(INSTALL_LIMBO)
    install(TARGETS test_boostpolygonapi DESTINATION test/geometry)
    install(DIRECTORY benchmarks DESTINATION test/geometry)
endif(INSTALL_LIMBO)
```

--------------------------------

### Default Limbo Installation

Source: https://github.com/limbo018/limbo/blob/master/Readme.md

Use these commands to build and install the Limbo library with default settings. Ensure CMake is configured with the desired installation prefix.

```bash
mkdir build
cd build
cmake .. -DCMAKE_INSTALL_PREFIX=absolute/path/to/your/installation
make
make install
```

--------------------------------

### start (t)

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00694.html

Starts the BFS traversal towards node t.

```APIDOC
## start (t)

### Description
Starts the BFS traversal towards node t.

### Method
start(Node t)

### Parameters
#### Path Parameters
- **t** (Node) - The target node.

### Response
#### Success Response (200)
- [Response fields]
```

--------------------------------

### run()

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00262.html

Executes the MaxWeightedPerfectFractionalMatching algorithm. This is a shortcut for calling init(), start(), and then retrieving results.

```APIDOC
## run()

### Description
This method runs the `MaxWeightedPerfectFractionalMatching` algorithm. `mwfm.run()` is just a shortcut of the following code: `mwfm.init(); mwfm.start();`

### Method
`bool run()`
```

--------------------------------

### start (no args)

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00345.html

Executes the algorithm to completion.

```APIDOC
## start

### Description
Executes the algorithm.

### Method
void

### Endpoint
start ()

### Parameters
None

### Response
None
```

--------------------------------

### startPerfect

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/functions_0x73.html

Initiates a perfect matching algorithm.

```APIDOC
## startPerfect()

### Description
Initiates a perfect matching algorithm. This function is part of the MaxFractionalMatching functionality.

### Method
Not applicable (function call)

### Parameters
None

### Returns
[MaxFractionalMatching< GR, TR >](a00257.html#ad384211fb3b06fea3a15bfc56454539b)
```

--------------------------------

### objCoeff (get)

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00076.html

Gets a specific element of the objective function.

```APIDOC
## objCoeff (get)

### Description
Get an element of the objective function.

### Method
Value objCoeff(Col c) const

### Parameters
- **c** (Col): The column associated with the objective coefficient.

### Returns
- **Value**: The value of the objective coefficient.
```

--------------------------------

### rowUpperBound (get)

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00076.html

Gets the upper bound of a row (constraint).

```APIDOC
## rowUpperBound (get)

### Description
Get the upper bound of a row (i.e a constraint).

### Method
Value rowUpperBound(Row r) const

### Parameters
- **r** (Row): The row to get the upper bound from.

### Returns
- **Value**: The upper bound of the row.
```

--------------------------------

### start (no arguments)

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00347.html

Executes the algorithm to completion.

```APIDOC
## start

### Description
Executes the algorithm.

### Method
void

### Parameters
None

### Request Example
None

### Response
None
```

--------------------------------

### runPerfect

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00257.html

Runs the algorithm to find a perfect fractional matching. This is a shortcut for calling init() and then startPerfect().

```APIDOC
## runPerfect

### Description
Runs the algorithm to find a perfect fractional matching. If a perfect matching does not exist, the function returns false and the matching and barrier are undefined.

### Parameters
- **postprocess** (bool) - Optional - If true, the algorithm postprocesses the matching to contain only matching edges and half-value odd cycles after the push-relabel algorithm.

### Returns
- bool - True if a perfect fractional matching was found, false otherwise.
```

--------------------------------

### rowLowerBound (get)

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00076.html

Gets the lower bound of a row (constraint).

```APIDOC
## rowLowerBound (get)

### Description
Get the lower bound of a row (i.e a constraint).

### Method
Value rowLowerBound(Row r) const

### Parameters
- **r** (Row): The row to get the lower bound from.

### Returns
- **Value**: The lower bound of the row.
```

--------------------------------

### run

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00271.html

Runs the Min cut algorithm. This is a shortcut for calling init(), start().

```APIDOC
## run

### Description
This method runs the Min cut algorithm.

### Note
`mc.run(s)` is just a shortcut of the following code:
`mc.init();`
`mc.start();`
```

--------------------------------

### colUpperBound (get)

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00076.html

Gets the upper bound of a column (variable).

```APIDOC
## colUpperBound (get)

### Description
Gets the upper bound of a column (variable).

### Signature
```cpp
Value colUpperBound(Col c) const
```

### Parameters
* **c** (Col) - The column whose upper bound to retrieve.

### Returns
The upper bound value of the column.
```

--------------------------------

### colLowerBound (get)

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00076.html

Gets the lower bound of a column (variable).

```APIDOC
## colLowerBound (get)

### Description
Gets the lower bound of a column (variable).

### Signature
```cpp
Value colLowerBound(Col c) const
```

### Parameters
* **c** (Col) - The column whose lower bound to retrieve.

### Returns
The lower bound value of the column.
```

--------------------------------

### init

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a01004.html

Initializes the matching.

```APIDOC
## init

### Description
Initializes the matching.

### Method
inline

### Parameters
None

### Response
None
```

--------------------------------

### start

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00783.html

Initializes the Dijkstra algorithm with a map of node statuses.

```APIDOC
## start

### Description
Initializes the Dijkstra algorithm using a provided map that defines the initial status (e.g., visited, distance) of nodes.

### Method
inline

### Parameters
#### Path Parameters
- **nm** (const NodeBoolMap &) - A constant reference to a map defining initial node states.
```

--------------------------------

### coeff (get)

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00076.html

Gets an element of the coefficient matrix of the LP.

```APIDOC
## coeff (get)

### Description
Gets an element of the coefficient matrix of the LP.

### Signature
```cpp
Value coeff(Row r, Col c) const
```

### Parameters
* **r** (Row) - The row index.
* **c** (Col) - The column index.

### Returns
The value of the coefficient at the specified row and column.
```

--------------------------------

### start

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a01082.html

Starts the timer. This is an inline member function of the Timer class.

```APIDOC
## start

### Description
Starts the timer.

### Method
inline

### Parameters
None

### Returns
void (inferred)
```

--------------------------------

### start

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00751.html

Starts the DFS traversal with a given arc boolean map.

```APIDOC
## start (const ArcBoolMap &am)

### Description
Starts the DFS traversal with a given arc boolean map.

### Method
[Implicitly defined by class context]

### Parameters
#### Path Parameters
- **am** (const ArcBoolMap &) - Description not available
```

--------------------------------

### start()

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00053.html

Executes the BFS algorithm to compute shortest paths from root(s) to all reachable nodes. It calculates the shortest path tree/forest and the distance to each node. Preconditions: init() must be called and at least one source node added via addSource().

```APIDOC
## start()

### Description
Executes the BFS algorithm to compute shortest paths from root(s) to all reachable nodes. It calculates the shortest path tree/forest and the distance to each node.

### Precondition
`init()` must be called and at least one source node added via `addSource()` before using this function.

### Note
`b.start()` is a shortcut for:
```
while ( !b.emptyQueue() ) {
  b.processNextNode();
}
```
```

--------------------------------

### start (arc map)

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00767.html

Starts the traversal with a given arc map.

```APIDOC
## start (arc map)

### Description
Starts the traversal with a given arc map.

### Method
start(const AM &am)

### Parameters
#### Path Parameters
- **am** (const AM &) - The arc map to use.

### Endpoint
[Endpoint not specified]
```

--------------------------------

### init

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00755.html

Initializes the DFS.

```APIDOC
## init

### Description
Initializes the DFS.

### Method
[Method Signature]

### Parameters
None
```

--------------------------------

### start (end node)

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00767.html

Starts the traversal towards a specific node.

```APIDOC
## start (end node)

### Description
Starts the traversal towards a specific node.

### Method
start(Node t)

### Parameters
#### Path Parameters
- **t** (Node) - The target node.

### Endpoint
[Endpoint not specified]
```

--------------------------------

### start

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00351.html

Executes the algorithm. Returns true if successful, false otherwise.

```APIDOC
## start

### Description
Executes the algorithm.

### Method
bool

### Endpoint
start
```

--------------------------------

### init()

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00261.html

Initializes the maximum weighted matching algorithm.

```APIDOC
## init()

### Description
Initializes the algorithm. This should be called before running the algorithm.

### Method
void init()
```

--------------------------------

### start (const AM &am)

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00766.html

Starts the DFS traversal with a given adjacency map.

```APIDOC
## start (const AM &am)

### Description
Starts the DFS traversal with a given adjacency map.

### Method
`start(const AM &am)`

### Parameters
#### Path Parameters
- **am** (const AM &) - Description not available
```

--------------------------------

### fullInit

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00354.html

Initializes the algorithm and performs Dijkstra's algorithm.

```APIDOC
## fullInit

### Description
Initialize the algorithm and perform Dijkstra.

### Parameters
#### Path Parameters
- **s** (const Node &) - Description not available
```

--------------------------------

### start (Node t)

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00766.html

Starts the DFS traversal towards a target node.

```APIDOC
## start (Node t)

### Description
Starts the DFS traversal towards a target node.

### Method
`start(Node t)`

### Parameters
#### Path Parameters
- **t** (Node) - Description not available
```

--------------------------------

### Start Computation

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00264.html

Executes the Minimum Cost Arborescence algorithm after initialization and source addition.

```APIDOC
## start

### Description
Executes the Minimum Cost Arborescence computation. This should be called after `init()` and `addSource()`.
```

--------------------------------

### run()

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00260.html

Executes the entire algorithm, equivalent to calling init(), start(), and then retrieving results.

```APIDOC
## run()

### Description
Runs the `MaxWeightedFractionalMatching` algorithm to completion. This is a convenience function that internally calls `init()` and `start()`.
```

--------------------------------

### init

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a01072.html

Initializes the algorithm starting from a source node.

```APIDOC
## init(const Node &s)

### Description
Initializes the algorithm, setting up necessary data structures starting from the source node `s`.

### Method
init

### Parameters
- **s** (const Node &) - The source node.
```

--------------------------------

### start

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00051.html

Executes the BFS algorithm.

```APIDOC
void start()
```

```APIDOC
void start(Node t)
```

```APIDOC
template<class NodeBoolMap >
Node start(const NodeBoolMap &nm)
```

--------------------------------

### colUpperBound (Get)

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00411.html

Get the upper bound of a column (i.e. a variable).

```APIDOC
## colUpperBound [Col c] const

### Description
Get the upper bound of a column (i.e. a variable).

### Parameters
#### Path Parameters
- **c** (Col) - Required - The column to get the upper bound from.

### Returns
- **Value** - The upper bound of the column.

```

--------------------------------

### startDense()

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/functions_func_0x73.html

Starts the dense version of MaxMatching.

```APIDOC
## startDense()

### Description
Starts the dense version of MaxMatching.

### Method
N/A

### Endpoint
N/A

### Parameters
N/A

### Request Body
N/A

### Response
N/A

### Request Example
N/A

### Response Example
N/A
```

--------------------------------

### start

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00357.html

Executes the algorithm with a target node and an optional parameter k.

```APIDOC
## start

### Description
Execute the algorithm.

### Method
int

### Parameters
#### Path Parameters
- **t** (const Node &) - Description not available
- **k** (int, optional) - Defaults to 2. Description not available
```

--------------------------------

### colLowerBound (Get)

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00411.html

Get the lower bound of a column (i.e. a variable).

```APIDOC
## colLowerBound [Col c] const

### Description
Get the lower bound of a column (i.e. a variable).

### Parameters
#### Path Parameters
- **c** (Col) - Required - The column to get the lower bound from.

### Returns
- **Value** - The lower bound of the column.

```

--------------------------------

### Get Column Constraint

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00411.html

Gets a column (dual constraint) of the LP.

```APIDOC
## col

### Description
Get a column (i.e a dual constraint) of the LP.

### Method
DualExpr

### Endpoint
col(Col c) const

### Parameters
- **c** (Col) - The column to retrieve.

### Response
#### Success Response (200)
- **dualExpr** (DualExpr) - The dual expression associated with the column.

#### Response Example
```
<DualExpr object reference>
```
```

--------------------------------

### start (arc boolean map)

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00748.html

Starts the DFS traversal with a given ArcBoolMap.

```APIDOC
## start (arc boolean map)

### Description
Starts the DFS traversal with a given ArcBoolMap.

### Method
`start(const ArcBoolMap &am)`

### Parameters
#### Path Parameters
- **am** (const ArcBoolMap &) - The ArcBoolMap to use.
```

--------------------------------

### start (target node)

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00748.html

Starts the DFS traversal towards a target node.

```APIDOC
## start (target node)

### Description
Starts the DFS traversal towards a target node.

### Method
`start(Node t)`

### Parameters
#### Path Parameters
- **t** (Node) - The target node.
```

--------------------------------

### startPerfect()

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/functions_func_0x73.html

Starts the perfect matching phase in MaxFractionalMatching.

```APIDOC
## startPerfect()

### Description
Starts the perfect matching phase in MaxFractionalMatching.

### Method
N/A

### Endpoint
N/A

### Parameters
N/A

### Request Body
N/A

### Response
N/A

### Request Example
N/A

### Response Example
N/A
```

--------------------------------

### fullInit

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/functions_0x66.html

Performs a full initialization for the Suurballe algorithm. Used to set up all necessary components.

```APIDOC
## fullInit

### Description
Performs a comprehensive initialization for the `Suurballe` algorithm. This method sets up all the required data structures and initial states for the algorithm to run correctly.

### Method
`fullInit()`

### Returns
Likely returns the `Suurballe< GR, LEN, TR >` object itself or a status indicator.
```

--------------------------------

### run (start node)

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00753.html

Runs the DFS traversal starting from a given node.

```APIDOC
## run

### Description
Runs the DFS traversal starting from a given node.

### Method
[Method Signature]

### Parameters
#### Path Parameters
- **s** (Node) - The starting node.

### Parameters
#### Path Parameters
- **s** (Node) - The starting node.
```

--------------------------------

### start (target)

Source: https://github.com/limbo018/limbo/blob/master/limbo/thirdparty/lemon/doc/html/a00693.html

Starts the BFS traversal towards a given target node.

```APIDOC
## start (target)

### Description
Starts the BFS traversal towards a given target node.

### Method
start(Node t)

### Parameters
#### Path Parameters
- **t** (Node) - The target node.
```