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

• View this file on GitHub
• Last update: 2024-02-19 12:47:06+09:00
• Include: #include "C++/graph/edge.hpp"

Required by

• グラフライブラリ (C++/graph/Graph.hpp)
• 重み付きグラフライブラリ (C++/graph/WeightedGraph.hpp)
• 木の直径 (C++/graph/diameter.hpp)
• 最小全域木 (C++/graph/mst/MST.hpp)
• Directed MST (C++/graph/mst/directed.hpp)
• Kruskal法 (C++/graph/mst/kruskal.hpp)
• Manhattan MST (C++/graph/mst/manhattan.hpp)

Verified with

• test/cycledetector.test.cpp
• test/dag_check.test.cpp
• test/dijkstra.test.cpp
• test/directed.test.cpp
• test/lca.test.cpp
• test/manhattan.test.cpp
• test/scc.test.cpp
• test/scc2.test.cpp
• test/shortestpath.test.cpp
• test/spfa.test.cpp
• test/tree_diameter.test.cpp
• test/warshallfloyd.test.cpp

Code

#pragma once

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 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
 */

Back to top page