mirror of
https://git.rwth-aachen.de/acs/public/villas/node/
synced 2025-03-23 00:00:01 +01:00
53 lines
941 B
C++
53 lines
941 B
C++
/* A graph vertex.
|
|
*
|
|
* Author: Daniel Krebs <github@daniel-krebs.net>
|
|
* SPDX-FileCopyrightText: 2014-2023 Institute for Automation of Complex Power Systems, RWTH Aachen University
|
|
* SPDX-License-Identifier: Apache-2.0
|
|
*/
|
|
|
|
#pragma once
|
|
|
|
namespace villas {
|
|
namespace graph {
|
|
|
|
class Vertex {
|
|
template<typename VertexType, typename EdgeType>
|
|
friend class DirectedGraph;
|
|
|
|
public:
|
|
using Identifier = std::size_t;
|
|
|
|
Vertex() :
|
|
id(0)
|
|
{ }
|
|
|
|
const Identifier& getIdentifier() const
|
|
{
|
|
return id;
|
|
}
|
|
|
|
friend
|
|
std::ostream& operator<<(std::ostream &stream, const Vertex &vertex)
|
|
{
|
|
return stream << vertex.id;
|
|
}
|
|
|
|
bool operator==(const Vertex &other)
|
|
{
|
|
return this->id == other.id;
|
|
}
|
|
|
|
std::string toString() {
|
|
std::stringstream ss;
|
|
ss << *this;
|
|
return ss.str();
|
|
}
|
|
|
|
private:
|
|
Identifier id;
|
|
// HACK: how to resolve this circular type dependency?
|
|
std::list<std::size_t> edges;
|
|
};
|
|
|
|
} // namespace graph
|
|
} // namespace villas
|