89 lines
1.7 KiB
C++
89 lines
1.7 KiB
C++
#ifndef GRAPH_H_
|
|
#define GRAPH_H_
|
|
|
|
#include <map>
|
|
#include <set>
|
|
#include <iostream>
|
|
|
|
namespace graph {
|
|
|
|
template<typename T>
|
|
class Graph {
|
|
public:
|
|
~Graph();
|
|
|
|
// Add edge e(u,v)
|
|
virtual void insert(const T& u, const T& v);
|
|
|
|
// Return true if e(u,v) exists
|
|
virtual bool contains(const T& u, const T& v);
|
|
|
|
// Remove edge e(u,v)
|
|
virtual void remove(const T& u, const T& v);
|
|
|
|
// Return num. of vertices
|
|
virtual std::uint16_t V();
|
|
|
|
// Return num. of edges
|
|
virtual std::uint16_t E();
|
|
|
|
// Output graph
|
|
virtual void output();
|
|
|
|
// Adjacency matrix representation
|
|
std::set<T> vertices;
|
|
std::map<T, std::set<T>> adjMatrix;
|
|
};
|
|
|
|
template<typename T>
|
|
Graph<T>::~Graph() {
|
|
vertices.clear();
|
|
adjMatrix.clear();
|
|
}
|
|
|
|
template<typename T>
|
|
inline void Graph<T>::insert(const T& u, const T& v) {
|
|
Graph<T>::vertices.insert(u);
|
|
Graph<T>::vertices.insert(v);
|
|
Graph<T>::adjMatrix[u].insert(v);
|
|
}
|
|
|
|
template<typename T>
|
|
bool Graph<T>::contains(const T& u, const T& v) {
|
|
return adjMatrix[u].contains(v);
|
|
}
|
|
|
|
template<typename T>
|
|
void Graph<T>::remove(const T& u, const T& v) {
|
|
adjMatrix[u].erase(v);
|
|
}
|
|
|
|
template<typename T>
|
|
std::uint16_t Graph<T>::V() {
|
|
return static_cast<std::uint16_t>(vertices.size());
|
|
}
|
|
|
|
template<typename T>
|
|
std::uint16_t Graph<T>::E() {
|
|
std::uint16_t edges = 0;
|
|
for (const auto& v : vertices) {
|
|
edges += static_cast<std::uint16_t>(adjMatrix[v].size());
|
|
}
|
|
return static_cast<std::uint16_t>(edges);
|
|
}
|
|
|
|
template<typename T>
|
|
void Graph<T>::output() {
|
|
for (const auto& v : vertices) {
|
|
for (const auto& u : adjMatrix[v]) {
|
|
std::cout << v << "->" << u << '|';
|
|
}
|
|
std::cout << '\n';
|
|
}
|
|
std::cout << '\n';
|
|
}
|
|
|
|
} // namespace graph
|
|
|
|
|
|
#endif |