mirror/vcpkg
1
0
Fork 0
mirror of https://github.com/microsoft/vcpkg.git synced 2024-11-25 14:19:07 +08:00
Code Issues Actions 1 Packages Projects Releases Wiki Activity

Remove Graph class

Browse Source
This commit is contained in:
Alexander Karatarakis 2017-04-12 18:56:41 -07:00
parent 7f79f44b0c
commit 2cc01b2aca
1 changed files with 0 additions and 92 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

92
toolsrc/include/vcpkg_Graphs.h
View File

@ -1,7 +1,6 @@
#pragma once
#include <unordered_map>
#include <unordered_set>
namespace vcpkg::Graphs
{
@ -67,95 +66,4 @@ namespace vcpkg::Graphs
return sorted;
}
template <class V>
struct GraphAdjacencyProvider final : AdjacencyProvider<V, V>
{
const std::unordered_map<V, std::unordered_set<V>>& vertices;
GraphAdjacencyProvider(const std::unordered_map<V, std::unordered_set<V>>& vertices) : vertices(vertices) {}
std::vector<V> adjacency_list(const V& vertex) const override
{
const std::unordered_set<V>& as_set = this->vertices.at(vertex);
return std::vector<V>(as_set.cbegin(), as_set.cend()); // TODO: Avoid redundant copy
}
V load_vertex_data(const V& vertex) const override
{
return vertex;
}
};
template <class V>
class Graph
{
public:
void add_vertex(V v)
{
this->vertices[v];
}
// TODO: Change with iterators
void add_vertices(const std::vector<V>& vs)
{
for (const V& v : vs)
{
this->vertices[v];
}
}
void add_edge(V u, V v)
{
this->vertices[v];
this->vertices[u].insert(v);
}
std::vector<V> topological_sort() const
{
GraphAdjacencyProvider<V> adjacency_provider{ this->vertices };
std::unordered_map<V, int> indegrees = count_indegrees();
std::vector<V> sorted;
sorted.reserve(indegrees.size());
std::unordered_map<V, ExplorationStatus> exploration_status;
exploration_status.reserve(indegrees.size());
for (auto& pair : indegrees)
{
if (pair.second == 0) // Starting from vertices with indegree == 0. Not required.
{
V vertex = pair.first;
topological_sort_internal(vertex, adjacency_provider, exploration_status, sorted);
}
}
return sorted;
}
std::unordered_map<V, int> count_indegrees() const
{
std::unordered_map<V, int> indegrees;
for (auto& pair : this->vertices)
{
indegrees[pair.first];
for (V neighbour : pair.second)
{
++indegrees[neighbour];
}
}
return indegrees;
}
const std::unordered_map<V, std::unordered_set<V>>& adjacency_list() const
{
return this->vertices;
}
private:
std::unordered_map<V, std::unordered_set<V>> vertices;
};
}