最小全域木
(C++/graph/mst/MST.hpp)

• View this file on GitHub
• Last update: 2024-02-19 13:17:33+09:00
• Include: #include "C++/graph/mst/MST.hpp"

Depends on

• Edge (C++/graph/edge.hpp)

Required by

• Directed MST (C++/graph/mst/directed.hpp)
• Kruskal法 (C++/graph/mst/kruskal.hpp)
• Manhattan MST (C++/graph/mst/manhattan.hpp)

Verified with

• test/directed.test.cpp
• test/manhattan.test.cpp

Code

#pragma once

#include <vector>
#include "C++/graph/edge.hpp"
struct MST {
    std::vector<edge> tree;
    long long cost;
};

/**
 * @brief 最小全域木
 */

#line 2 "C++/graph/mst/MST.hpp"

#include <vector>
#line 2 "C++/graph/edge.hpp"

struct edge {
    int src, to, id;
    long long cost;
    edge(){}
    edge(const int src_, const int to_, const int id_ = -1, const long long cost_ = 0): src(src_), to(to_), id(id_), cost(cost_){}
    operator int() const { return to; }
};

/**
 * @brief Edge
 */
#line 5 "C++/graph/mst/MST.hpp"
struct MST {
    std::vector<edge> tree;
    long long cost;
};

/**
 * @brief 最小全域木
 */

Back to top page