Loading...

Searching...

No Matches

MinSteinerTreeTakahashi.h File Reference

Implementation of the 2(1-1/l)-approximation algorithm for the minimum Steiner tree problem by Matsuyama and Takahashi. More...

`#include <ogdf/basic/List.h>`

`#include <ogdf/basic/extended_graph_alg.h>`

`#include <ogdf/graphalg/MinSteinerTreeModule.h>`

`#include <ogdf/graphalg/steiner_tree/EdgeWeightedGraphCopy.h>`

Go to the source code of this file.

## Classes | |

class | ogdf::MinSteinerTreeTakahashi< T > |

This class implements the minimum Steiner tree 2-approximation algorithm by Takahashi and Matsuyama with improvements proposed by Poggi de Aragao et al. More... | |

## Namespaces | |

namespace | ogdf |

The namespace for all OGDF objects. | |

Implementation of the 2(1-1/l)-approximation algorithm for the minimum Steiner tree problem by Matsuyama and Takahashi.

- License:
- This file is part of the Open Graph Drawing Framework (OGDF).

- Copyright (C)

See README.md in the OGDF root directory for details.

- This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License Version 2 or 3 as published by the Free Software Foundation; see the file LICENSE.txt included in the packaging of this file for details.

- This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.

- You should have received a copy of the GNU General Public License along with this program; if not, see http://www.gnu.org/copyleft/gpl.html

Definition in file MinSteinerTreeTakahashi.h.