#include <queue>#include <vector>#include "ortools/base/adjustable_priority_queue-inl.h"#include "ortools/base/adjustable_priority_queue.h"#include "ortools/base/integral_types.h"#include "ortools/graph/connectivity.h"#include "ortools/util/vector_or_function.h"Go to the source code of this file.
Namespaces | |
| operations_research | |
| Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. | |
Functions | |
| template<typename Graph > | |
| std::vector< typename Graph::ArcIndex > | operations_research::BuildKruskalMinimumSpanningTreeFromSortedArcs (const Graph &graph, const std::vector< typename Graph::ArcIndex > &sorted_arcs) |
| Implementation of Kruskal's mininumum spanning tree algorithm (c.f. More... | |
| template<typename Graph , typename ArcComparator > | |
| std::vector< typename Graph::ArcIndex > | operations_research::BuildKruskalMinimumSpanningTree (const Graph &graph, const ArcComparator &arc_comparator) |
| Version taking an arc comparator to sort graph arcs. More... | |
| template<typename Graph , typename ArcValue > | |
| std::vector< typename Graph::ArcIndex > | operations_research::BuildPrimMinimumSpanningTree (const Graph &graph, const ArcValue &arc_value) |
| Implementation of Prim's mininumum spanning tree algorithm (c.f. More... | |