|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
Build a spanning tree from an array of arcs. More...
#include <tpl_spanning_tree.H>
Public Member Functions | |
| GT | operator() (const DynArray< typename GT::Arc * > &arcs) const |
| Construct spanning tree from array of arc pointers. | |
| GT | operator() (const DynArray< typename GT::Arc * > *arcs) const |
| Construct spanning tree from pointer to array of arc pointers. | |
Build a spanning tree from an array of arcs.
This class constructs a spanning tree graph from an array of arcs that were previously computed by another algorithm (e.g., Kruskal, Prim).
| GT | Graph type. |
Definition at line 465 of file tpl_spanning_tree.H.
|
inline |
Construct spanning tree from array of arc pointers.
| [in] | arcs | Array of arc pointers that form the spanning tree. |
| std::bad_alloc | If memory allocation fails. |
Definition at line 478 of file tpl_spanning_tree.H.
References arcs, and Aleph::maps().
|
inline |
Construct spanning tree from pointer to array of arc pointers.
| [in] | arcs | Pointer to array of arc pointers that form the spanning tree. |
| std::bad_alloc | If memory allocation fails. |
| std::invalid_argument | If arcs is nullptr. |
Definition at line 493 of file tpl_spanning_tree.H.
References ah_invalid_argument_if, arcs, and Aleph::maps().