All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Properties Friends Macros Groups Pages
Public Member Functions | Protected Member Functions | Protected Attributes | List of all members
te::sa::MinimumSpanningTree Class Reference

#include <MinimumSpanningTree.h>

Public Member Functions

te::graph::AbstractGraph * kruskal (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::AbstractGraph * createGraph ()
 Function to create a empty graph with vertex attributes from gpm graph. More...
 

Protected Attributes

te::graph::AbstractGraph * m_inputGraph
 Pointer to input graph. More...
 

Detailed Description

Definition at line 50 of file MinimumSpanningTree.h.

Constructor & Destructor Documentation

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

Default constructor.

Definition at line 47 of file MinimumSpanningTree.cpp.

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

Virtual destructor.

Definition at line 51 of file MinimumSpanningTree.cpp.

Member Function Documentation

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

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

Definition at line 165 of file MinimumSpanningTree.cpp.

References te::graph::GraphMetadata::addVertexProperty(), te::dt::Property::clone(), te::graph::AbstractGraph::getMetadata(), te::graph::AbstractGraphFactory::make(), te::dt::Property::setParent(), and te::graph::Globals::sm_factoryGraphTypeUndirectedGraph.

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.

Definition at line 55 of file MinimumSpanningTree.cpp.

References te::graph::AbstractGraph::add(), te::graph::Edge::addAttribute(), te::sa::AddGraphEdgeAttribute(), te::dt::DOUBLE_TYPE, te::graph::Edge::getAttributes(), te::sa::GetDataValue(), te::graph::MemoryIterator::getEdgeInteratorCount(), te::graph::GraphMetadata::getEdgePropertySize(), te::graph::MemoryIterator::getFirstEdge(), te::graph::Edge::getIdFrom(), te::graph::Edge::getIdTo(), te::graph::AbstractGraph::getMetadata(), te::graph::Vertex::getNeighborhood(), te::graph::MemoryIterator::getNextEdge(), te::graph::Vertex::getPredecessors(), te::graph::Vertex::getSuccessors(), te::graph::AbstractGraph::getVertex(), te::graph::MemoryIterator::getVertexInteratorCount(), te::graph::Edge::setAttributeVecSize(), and TE_SA_SKATER_ATTR_WEIGHT_NAME.

Member Data Documentation

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 files: