te::sa::MinimumSpanningTree Class Reference

#include <MinimumSpanningTree.h>

Public Member Functions

te::graph::AbstractGraphkruskal (int weightAttrIdx)
 Function to execute the kruskal operation. More...
 
 MinimumSpanningTree (te::graph::AbstractGraph *inputGraph)
 Default constructor. More...
 
 ~MinimumSpanningTree ()
 Virtual destructor. More...
 

Protected Member Functions

te::graph::AbstractGraphcreateGraph ()
 Function to create a empty graph with vertex attributes from gpm graph. More...
 

Protected Attributes

te::graph::AbstractGraphm_inputGraph
 Pointer to input graph. More...
 

Detailed Description

Definition at line 50 of file MinimumSpanningTree.h.

Constructor & Destructor Documentation

◆ MinimumSpanningTree()

te::sa::MinimumSpanningTree::MinimumSpanningTree ( te::graph::AbstractGraph inputGraph)

Default constructor.

◆ ~MinimumSpanningTree()

te::sa::MinimumSpanningTree::~MinimumSpanningTree ( )

Virtual destructor.

Member Function Documentation

◆ createGraph()

te::graph::AbstractGraph* te::sa::MinimumSpanningTree::createGraph ( )
protected

Function to create a empty graph with vertex attributes from gpm graph.

◆ kruskal()

te::graph::AbstractGraph* te::sa::MinimumSpanningTree::kruskal ( int  weightAttrIdx)

Function to execute the kruskal operation.

Parameters
weightAttrIdxThe edge weight attribute index.
Returns
Pointer to AbstractGraph that represents the Minimum Spanning Tree from input graph.

Member Data Documentation

◆ m_inputGraph

te::graph::AbstractGraph* te::sa::MinimumSpanningTree::m_inputGraph
protected

Pointer to input graph.

Definition at line 78 of file MinimumSpanningTree.h.


The documentation for this class was generated from the following file: