Google OR-Tools v9.11
a fast and portable software suite for combinatorial optimization
|
#include <limits>
#include <vector>
#include "absl/types/span.h"
#include "ortools/base/adjustable_priority_queue-inl.h"
#include "ortools/base/adjustable_priority_queue.h"
#include "ortools/graph/connected_components.h"
Go to the source code of this file.
Namespaces | |
namespace | operations_research |
In SWIG mode, we don't want anything besides these top-level includes. | |
Functions | |
template<typename Graph > | |
std::vector< typename Graph::ArcIndex > | operations_research::BuildKruskalMinimumSpanningTreeFromSortedArcs (const Graph &graph, absl::Span< const typename Graph::ArcIndex > sorted_arcs) |
template<typename Graph , typename ArcComparator > | |
std::vector< typename Graph::ArcIndex > | operations_research::BuildKruskalMinimumSpanningTree (const Graph &graph, const ArcComparator &arc_comparator) |
template<typename Graph , typename ArcValue > | |
std::vector< typename Graph::ArcIndex > | operations_research::BuildPrimMinimumSpanningTree (const Graph &graph, const ArcValue &arc_value) |