3party/vcpkg
0
0
Fork 0
mirror of https://github.com/microsoft/vcpkg.git synced 2024-12-29 03:34:26 +08:00
Code Issues Projects Releases Wiki Activity

[Graph] Now uses set instead of vector

Browse Source
This commit is contained in:
Alexander Karatarakis 2016-11-15 11:56:46 -08:00
parent b64b0cbc8a
commit 727e4ed6fa
1 changed files with 5 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
toolsrc/include/vcpkg_Graphs.h
View File

@ -1,6 +1,7 @@
#pragma once
#include <unordered_map>
#include <unordered_set>
namespace vcpkg { namespace Graphs
{
@ -21,7 +22,7 @@ namespace vcpkg { namespace Graphs
{
static void find_topological_sort_internal(V vertex,
ExplorationStatus& status,
const std::unordered_map<V, std::vector<V>>& adjacency_list,
const std::unordered_map<V, std::unordered_set<V>>& adjacency_list,
std::unordered_map<V, ExplorationStatus>& exploration_status,
std::vector<V>& sorted)
{
@ -63,7 +64,7 @@ namespace vcpkg { namespace Graphs
void add_edge(V u, V v)
{
this->vertices[v];
this->vertices[u].push_back(v);
this->vertices[u].insert(v);
}
std::vector<V> find_topological_sort() const
@ -108,12 +109,12 @@ namespace vcpkg { namespace Graphs
return indegrees;
}
const std::unordered_map<V, std::vector<V>>& adjacency_list() const
const std::unordered_map<V, std::unordered_set<V>>& adjacency_list() const
{
return this->vertices;
}
private:
std::unordered_map<V, std::vector<V>> vertices;
std::unordered_map<V, std::unordered_set<V>> vertices;
};
}}