Program Listing for File MinimumSpanningTree.h

↰ Return to documentation for file (ADS/graph/MinimumSpanningTree.h)

/*--------------------------------------------------------------------------*/
/*----------------------- File MinimumSpanningTree.h -----------------------*/
/*--------------------------------------------------------------------------*/
/*--------------------------------------------------------------------------*/
/*----------------------------- DEFINITIONS --------------------------------*/
/*--------------------------------------------------------------------------*/

#ifndef __ADS_MinimumSpanningTree
 #define __ADS_MinimumSpanningTree
                      /* self-identification: #endif constant */

/*--------------------------------------------------------------------------*/
/*------------------------------ INCLUDES ----------------------------------*/
/*--------------------------------------------------------------------------*/

#include "ADS/Contract.h"
#include "ADS/graph/Graph.h"
#include "ADS/graph/ShortestPaths.h"
#include "ADS/mfset/MFSet.h"
#include "ADS/priority/FibonacciHeapPriorityQueue.h"
#include "ADS/priority/HeapPriorityQueue.h"
#include "ADS/priority/ListPriorityQueue.h"

#include <algorithm>
#include <concepts>
#include <cstddef>
#include <memory>
#include <tuple>
#include <vector>

/*--------------------------------------------------------------------------*/
/*--------------------------- NAMESPACE ------------------------------------*/
/*--------------------------------------------------------------------------*/

namespace ADS {

template< class W >
struct WeightedEdge {
 int u , v;
 W w;
 bool operator==( const WeightedEdge & ) const = default;
 };

template< Graph G >
std::vector< WeightedEdge< typename G::Weight > > edges( const G & g );

template< class W >
std::vector< WeightedEdge< W > > kruskal( int n ,
                                          std::vector< WeightedEdge< W > > A ,
                                          long k = 0 );

template< class M >
concept Mergeable = requires( M m , int u , int v ) {
 { m.merge( u , v ) } -> std::convertible_to< bool >;
 };

struct MergeCounts {
 long long merges = 0 , unions = 0;
 };

template< class W , Mergeable M >
std::vector< WeightedEdge< W > > kruskal( int n ,
                                          std::vector< WeightedEdge< W > > A ,
                                          M & sets , long k = 0 ,
                                          MergeCounts * c = nullptr );

template< Graph G >
auto kruskal( const G & g , long k = 0 );

template< Graph G >
std::vector< int > prim( const G & g , int r , Frontier how = Frontier::HEAP );

template< Graph G , PriorityQueue Q >
std::vector< int > prim( const G & g , int r , Q & q ,
                         FrontierCounts * c = nullptr );

template< class W >
bool isMinimumSpanningForest( int n ,
                              const std::vector< WeightedEdge< W > > & A ,
                              const std::vector< WeightedEdge< W > > & T );

/*--------------------------------------------------------------------------*/

}  // end( namespace ADS )

/*--------------------------------------------------------------------------*/
/*-------------------------- IMPLEMENTATION --------------------------------*/
/*--------------------------------------------------------------------------*/

#include "ADS/graph/impl/MinimumSpanningTree.tpp"

/*--------------------------------------------------------------------------*/

#endif  /* MinimumSpanningTree.h included */

/*--------------------------------------------------------------------------*/
/*--------------------- End File MinimumSpanningTree.h ---------------------*/
/*--------------------------------------------------------------------------*/