MSTAlgorithm.hpp File Reference

#include <vector>
#include <algorithm>
#include <ranges>
#include <unordered_map>
#include <optional>
#include <type_traits>
#include <fishnet/Graph.hpp>
#include <fishnet/FunctionalConcepts.hpp>
#include <fishnet/Option.hpp>

Include dependency graph for MSTAlgorithm.hpp:

Go to the source code of this file.

Namespaces
namespace	fishnet
namespace	fishnet::graph
namespace	fishnet::graph::MST

Functions
template<Graph G, typename W > requires std::totally_ordered<std::invoke_result_t<W, const typename G::node_type&, const typename G::node_type&>> && std::is_default_constructible_v<G>
fishnet::Option< G >	fishnet::graph::MST::kruskal (const G &graph, W const &weightFunction)
	Compute the Minimum Spanning Tree of a graph using Kruskal's algorithm.
template<Graph G, typename W > requires std::totally_ordered<std::invoke_result_t<W, const typename G::node_type&, const typename G::node_type&>>
fishnet::Option< G >	fishnet::graph::MST::kruskal (const G &graph, W const &weightFunction, G &&outputGraph)
	Compute the Minimum Spanning Tree of a graph using Kruskal's algorithm.