Classes | |
| class | edge_num |
| An edge numbering class. More... | |
| class | spvecgf2 |
| A sparse vector with elements in GF2. More... | |
| class | spvecfp |
A sparse vector with elements in . More... | |
Typedefs | |
| typedef long | indextype |
| typedef leda::integer | ptype |
Functions | |
| template<class W> | |
| W | MCB (const leda::graph &g, const leda::edge_array< W > &len, leda::array< leda::list< leda::edge > > &mcb, double errorp=0.375) |
| Compute a minimum cycle basis of a graph. | |
| int | MCB (const graph &g, array< list< edge > > &mcb, double errorp=0.375) |
| Compute a minimum cycle basis of an unweighted graph. | |
| std::ostream & | operator<< (std::ostream &o, const spvecgf2 &v) |
| std::istream & | operator>> (std::istream &o, spvecgf2 &v) |
| std::ostream & | operator<< (std::ostream &o, const spvecfp &v) |
| int | MIN_CYCLE_BASIS_DEPINA (const leda::graph &g, leda::array< leda::d_int_set > &mcb, leda::array< leda::d_int_set > &proof, const mcb::edge_num &enumb) |
| Compute a MCB of an undirected unweighted graph using de Pina's algorithm. | |
| int | MIN_CYCLE_BASIS_DEPINA (const leda::graph &g, leda::array< leda::d_int_set > &mcb, const edge_num &enumb) |
| Compute a MCB of an undirected unweighted graph using de Pina's algorithm. | |
| int | MIN_CYCLE_BASIS_DEPINA (const leda::graph &g, leda::array< mcb::spvecgf2 > &mcb, leda::array< mcb::spvecgf2 > &proof, const edge_num &enumb) |
| Compute a MCB of an undirected unweighted graph using de Pina's algorithm. | |
| int | MIN_CYCLE_BASIS_DEPINA (const leda::graph &g, leda::array< mcb::spvecgf2 > &mcb, const edge_num &enumb) |
| Compute a MCB of an undirected unweighted graph using de Pina's algorithm. | |
| int | MIN_CYCLE_BASIS_DEPINA (const leda::graph &g, leda::array< leda::list< leda::edge > > &mcb, leda::array< leda::list< leda::edge > > &proof) |
| Compute a MCB of an undirected unweighted graph using de Pina's algorithm. | |
| int | MIN_CYCLE_BASIS_DEPINA (const leda::graph &g, leda::array< leda::list< leda::edge > > &mcb) |
| Compute a MCB of an undirected unweighted graph using de Pina's algorithm. | |
| int | MIN_CYCLE_BASIS_HYBRID (const leda::graph &g, leda::array< leda::d_int_set > &mcb, leda::array< leda::d_int_set > &proof, const edge_num &enumb) |
| int | MIN_CYCLE_BASIS_HYBRID (const leda::graph &g, leda::array< leda::d_int_set > &mcb, const edge_num &enumb) |
| int | MIN_CYCLE_BASIS_HYBRID (const leda::graph &g, leda::array< leda::list< leda::edge > > &mcb, leda::array< leda::list< leda::edge > > &proof) |
| int | MIN_CYCLE_BASIS_HYBRID (const leda::graph &g, leda::array< leda::list< leda::edge > > &mcb) |
| template<class W> | |
| W | MIN_CYCLE_BASIS_DEPINA (const graph &g, const edge_array< W > &len, array< spvecgf2 > &mcb, array< spvecgf2 > &proof, const edge_num &enumb) |
| Compute a MCB of an undirected weighted graph using de Pina's algorithm. | |
| template<class W> | |
| W | MIN_CYCLE_BASIS_DEPINA (const graph &g, const edge_array< W > &len, array< d_int_set > &mcb, array< d_int_set > &proof, const edge_num &enumb) |
| Compute a MCB of an undirected weighted graph using de Pina's algorithm. | |
| template<class W> | |
| W | MIN_CYCLE_BASIS_DEPINA (const graph &g, const edge_array< W > &len, array< d_int_set > &mcb, const edge_num &enumb) |
| Compute a MCB of an undirected weighted graph using de Pina's algorithm. | |
| template<class W> | |
| W | MIN_CYCLE_BASIS_DEPINA (const graph &g, const edge_array< W > &len, array< spvecgf2 > &mcb, const edge_num &enumb) |
| Compute a MCB of an undirected weighted graph using de Pina's algorithm. | |
| template<class W> | |
| W | MIN_CYCLE_BASIS_DEPINA (const graph &g, const edge_array< W > &len, array< list< edge > > &mcb) |
| Compute a MCB of an undirected weighted graph using de Pina's algorithm. | |
| template<class W> | |
| W | MIN_CYCLE_BASIS_DEPINA (const graph &g, const edge_array< W > &len, array< list< edge > > &mcb, array< list< edge > > &proof) |
| Compute a MCB of an undirected weighted graph using de Pina's algorithm. | |
| template<class W> | |
| W | MIN_CYCLE_BASIS_HYBRID (const graph &g, const edge_array< W > &len, array< d_int_set > &mcb, array< d_int_set > &proof, const edge_num &enumb) |
| template<class W> | |
| W | MIN_CYCLE_BASIS_HYBRID (const graph &g, const edge_array< W > &len, array< d_int_set > &mcb, const edge_num &enumb) |
| template<class W> | |
| W | MIN_CYCLE_BASIS_HYBRID (const graph &g, const edge_array< W > &len, array< list< edge > > &mcb, array< list< edge > > &proof) |
| template<class W> | |
| W | MIN_CYCLE_BASIS_HYBRID (const graph &g, const edge_array< W > &len, array< list< edge > > &mcb) |
| template<class W> | |
| W | DIR_MIN_CYCLE_BASIS (const graph &g, const edge_array< W > &len, array< spvecfp > &mcb, array< spvecfp > &proof, const edge_num &enumb, double error=0.375) |
| Compute a minimum cycle basis of a weighted directed graph. | |
| template<class W> | |
| W | DIR_MIN_CYCLE_BASIS (const graph &g, const edge_array< W > &len, array< array< etype > > &mcb, const edge_num &enumb, double error=0.375) |
| Compute a minimum cycle basis of a weighted directed graph. | |
| template<class W> | |
| W | DIR_MIN_CYCLE_BASIS (const graph &g, const edge_array< W > &len, array< list< edge > > &mcb, double error=0.375) |
| Compute a minimum cycle basis of a weighted directed graph. | |
|
|
The index type used for the directed cycle basis algorithm. |
|
|
The prime type used for the directed cycle basis algorithm. |
|
||||||||||||||||||||||||
|
Compute a minimum cycle basis of a weighted directed graph.
The function computes a directed Minimum Cycle Basis Since the algorithm is a randomized Monte-Carlo algorithm, the error argument which should be less that 1 represents the acceptable error probability that the returned cycle basis is not a minimum cycle basis. The function returns the weight of the Minimum Cycle Basis or is undefined if there were any errors.
The running time is
|
|
||||||||||||||||||||||||||||
|
Compute a minimum cycle basis of a weighted directed graph.
The function computes a directed Minimum Cycle Basis Since the algorithm is a randomized Monte-Carlo algorithm, the error argument which should be less that 1 represents the acceptable error probability that the returned cycle basis is not a minimum cycle basis. The function returns the weight of the Minimum Cycle Basis or is undefined if there were any errors.
The running time is
|
|
||||||||||||||||||||||||||||||||
|
Compute a minimum cycle basis of a weighted directed graph.
The function computes a directed Minimum Cycle Basis Every edge is represented by some integer, by a fixed and arbitrary numbering. This numbering is represented by enumb.
The function also returns a certificate of optimality of the minimum cycle basis. More precisely a set of linearly independent vectors for which cycle Since the algorithm is a randomized Monte-Carlo algorithm, the error argument which should be less that 1 represents the acceptable error probability that the returned cycle basis is not a minimum cycle basis. The function returns the weight of the Minimum Cycle Basis or is undefined if there were any errors.
The running time is
|
|
||||||||||||||||
|
Compute a minimum cycle basis of an unweighted graph.
The function computes a Minimum Cycle Basis
|
|
||||||||||||||||||||||||
|
Compute a minimum cycle basis of a graph.
The function computes a Minimum Cycle Basis
|
|
||||||||||||||||||||||||
|
Compute a MCB of an undirected weighted graph using de Pina's algorithm.
The function computes a Minimum Cycle Basis
The function also returns a certificate of optimality of the minimum cycle basis. More precisely a set of linearly independent vectors for which cycle
The function returns the weight of the Minimum Cycle Basis or is undefined if there were any errors.
|
|
||||||||||||||||||||
|
Compute a MCB of an undirected weighted graph using de Pina's algorithm.
The function computes a Minimum Cycle Basis
The function returns the weight of the Minimum Cycle Basis or is undefined if there were any errors.
|
|
||||||||||||||||||||||||
|
Compute a MCB of an undirected weighted graph using de Pina's algorithm.
The function computes a Minimum Cycle Basis Every edge is represented by some integer, by a fixed and arbitrary numbering. This numbering is represented by enumb.
The function returns the weight of the Minimum Cycle Basis or is undefined if there were any errors.
|
|
||||||||||||||||||||||||
|
Compute a MCB of an undirected weighted graph using de Pina's algorithm.
The function computes a Minimum Cycle Basis Every edge is represented by some integer, by a fixed and arbitrary numbering. This numbering is represented by enumb.
The function returns the weight of the Minimum Cycle Basis or is undefined if there were any errors.
|
|
||||||||||||||||||||||||||||
|
Compute a MCB of an undirected weighted graph using de Pina's algorithm.
The function computes a Minimum Cycle Basis
Every edge is represented by some integer, by a fixed and arbitrary numbering. This numbering is represented by enumb. The function also returns a certificate of optimality of the minimum cycle basis. More precisely a set of linearly independent vectors for which cycle
The function returns the weight of the Minimum Cycle Basis or is undefined if there were any errors.
|
|
||||||||||||||||||||||||||||
|
Compute a MCB of an undirected weighted graph using de Pina's algorithm.
The function computes a Minimum Cycle Basis
Every edge is represented by some integer, by a fixed and arbitrary numbering. This numbering is represented by enumb. The function also returns a certificate of optimality of the minimum cycle basis. More precisely a set of linearly independent vectors for which cycle
The function returns the weight of the Minimum Cycle Basis or is undefined if there were any errors.
|
|
||||||||||||
|
Compute a MCB of an undirected unweighted graph using de Pina's algorithm.
The function computes a Minimum Cycle Basis
The function returns the weight of the Minimum Cycle Basis or is undefined if there were any errors.
|
|
||||||||||||||||
|
Compute a MCB of an undirected unweighted graph using de Pina's algorithm.
The function computes a Minimum Cycle Basis
The function returns the weight of the Minimum Cycle Basis or is undefined if there were any errors.
|
|
||||||||||||||||
|
Compute a MCB of an undirected unweighted graph using de Pina's algorithm.
The function computes a Minimum Cycle Basis Every edge is represented by some integer, by a fixed and arbitrary numbering. This numbering is represented by enumb.
The function returns the weight of the Minimum Cycle Basis or is undefined if there were any errors.
|
|
||||||||||||||||||||
|
Compute a MCB of an undirected unweighted graph using de Pina's algorithm.
The function computes a Minimum Cycle Basis
Every edge is represented by some integer, by a fixed and arbitrary numbering. This numbering is represented by enumb. The function also returns a certificate of optimality of the minimum cycle basis. More precisely a set of linearly independent vectors for which cycle
The function returns the weight of the Minimum Cycle Basis or is undefined if there were any errors.
|
|
||||||||||||||||
|
Compute a MCB of an undirected unweighted graph using de Pina's algorithm.
The function computes a Minimum Cycle Basis Every edge is represented by some integer, by a fixed and arbitrary numbering. This numbering is represented by enumb.
The function returns the weight of the Minimum Cycle Basis or is undefined if there were any errors.
|
|
||||||||||||||||||||
|
Compute a MCB of an undirected unweighted graph using de Pina's algorithm.
The function computes a Minimum Cycle Basis
Every edge is represented by some integer, by a fixed and arbitrary numbering. This numbering is represented by enumb. The function also returns a certificate of optimality of the minimum cycle basis. More precisely a set of linearly independent vectors for which cycle
The function returns the weight of the Minimum Cycle Basis or is undefined if there were any errors.
|
|
||||||||||||||||||||
|
Compute a minimum cycle basis using a hybrid algorithm.
The function computes a minimum cycle basis of an undirected weighted graph
The function returns the weight of the Minimum Cycle Basis or is undefined if there were any errors.
|
|
||||||||||||||||||||||||
|
Compute a minimum cycle basis using a hybrid algorithm.
The function computes a minimum cycle basis of an undirected weighted graph
The function also returns a certificate of optimality of the minimum cycle basis. More precisely a set of linearly independent vectors for which cycle
The function returns the weight of the Minimum Cycle Basis or is undefined if there were any errors.
|
|
||||||||||||||||||||||||
|
Compute a minimum cycle basis using a hybrid algorithm.
The function computes a minimum cycle basis of an undirected weighted graph Every edge is represented by some integer, by a fixed and arbitrary numbering. This numbering is represented by enumb.
The function returns the weight of the Minimum Cycle Basis or is undefined if there were any errors.
|
|
||||||||||||||||||||||||||||
|
Compute a minimum cycle basis using a hybrid algorithm.
The function computes a minimum cycle basis of an undirected weighted graph Every edge is represented by some integer, by a fixed and arbitrary numbering. This numbering is represented by enumb.
The function also returns a certificate of optimality of the minimum cycle basis. More precisely a set of linearly independent vectors for which cycle
The function returns the weight of the Minimum Cycle Basis or is undefined if there were any errors.
|
|
||||||||||||
|
Compute a minimum cycle basis using a hybrid algorithm.
The function computes a minimum cycle basis of an undirected graph
The function returns the weight of the Minimum Cycle Basis or is undefined if there were any errors.
|
|
||||||||||||||||
|
Compute a minimum cycle basis using a hybrid algorithm.
The function computes a minimum cycle basis of an undirected graph
The function also returns a certificate of optimality of the minimum cycle basis. More precisely a set of linearly independent vectors for which cycle
The function returns the weight of the Minimum Cycle Basis or is undefined if there were any errors.
|
|
||||||||||||||||
|
Compute a minimum cycle basis using a hybrid algorithm.
The function computes a minimum cycle basis of an undirected graph Every edge is represented by some integer, by a fixed and arbitrary numbering. This numbering is represented by enumb.
The function returns the weight of the Minimum Cycle Basis or is undefined if there were any errors.
|
|
||||||||||||||||||||
|
Compute a minimum cycle basis using a hybrid algorithm.
The function computes a minimum cycle basis of an undirected graph Every edge is represented by some integer, by a fixed and arbitrary numbering. This numbering is represented by enumb.
The function also returns a certificate of optimality of the minimum cycle basis. More precisely a set of linearly independent vectors for which cycle
The function returns the weight of the Minimum Cycle Basis or is undefined if there were any errors.
|
|
||||||||||||
|
Output a sparse vector to a stream.
|
|
||||||||||||
|
Output a sparse vector.
|
|
||||||||||||
|
Input a sparse vector.
|
1.4.6