Bpp/Graph_problem
Min_spanning_tree
C++
 
 
DESCRIPTION
 

This module provides facilities to solve the minimum spanning tree problem in graphs.

 
SOURCE FILES
 

This section allows you to access the C++ source files of the module.

 
PARENT MODULE
 

This module is part of Bpp/Graph_problem.

 
INCLUDED FILES
 

The files listed below are included in the interface part of the module. So any module dependent of this module is also dependent of the files listed here.

  • <algorithm>

  • <bpp/graph.hpp>

 
NEEDED FILES
 

The files listed below are needed by the implementation part of the module. But a module dependent of this module is not necessary dependent of the files listed here.

  • <bpp/modules.hpp>

 
INTEGRATED NAMESPACES
 

The namespaces listed below are integrated in this module. That means any element declared in one of those namespaces can now be directly used by or from this module.

  • graph

 
ALIASES
 

The aliases listed below are only used internally by the interface. They are here just to lighten the writing of certain declarations. Never use them, they are local to the interface and can not be used outside of it.

  • tdGraph = class prArcData,class prNodeData

  • tuGraph = prArcData,prNodeData

 
TYPES
 

Here are listed the types defined in the module. To use one of them, you have to specify the namespace of the module.

  • type clArc<clCostData,clNoData> clSpanningArc
    Arc of a graph with a minimum spanning tree problem.

  • type clGraph<clCostData,clNoData> clSpanningGraph
    Graph with a minimum spanning tree problem.

  • type clNode<clCostData,clNoData> clSpanningNode
    Node of a graph with a minimum spanning tree problem.

 
FUNCTIONS
 

Here are listed the functions provided by the module. To use one of them, you have to specify the namespace of the module.

 
CLASSES
 

Here are listed the classes provided by the module. To use one of them, you have to specify the namespace of the module.

 
clKruskalAlgo
 
 
Declaration

template <tdGraph> class clKruskalAlgo : public clSolveAlgo<tuGraph>

 
Description

Represents Kruskal's algorithm to solve the minimum spanning tree problem in a graph.

 
Methods
 
clPrimAlgo
 
 
Declaration

template <tdGraph> class clPrimAlgo : public clSolveAlgo<tuGraph>

 
Description

Represents Prim's algorithm to solve the minimum spanning tree problem in a graph.

 
Methods
 
clSolveAlgo
 
 
Declaration

template <tdGraph> class clSolveAlgo

 
Description

Represents an algorithm to solve the minimum spanning tree problem in a graph. It is an abstract class.

 
Methods
 
 
Copyright (c) 1999-2016 - Bruno Bachelet - bruno@nawouak.net - http://www.nawouak.net
Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.1 or any later version published by the Free Software Foundation. See this license for more details (http://www.gnu.org).