stefiosif/reachability-algorithms
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Refactor: Rename adjMatrix to adjList

Browse Source
This commit is contained in:
stefiosif
2022-10-12 16:57:48 +03:00
parent 8b6d341d18
commit c525aeaa43
14 changed files with 56 additions and 56 deletions
Download Patch File Download Diff File Expand all files Collapse all files

10
algorithm/breadth_first_search.h
View File

@@ -14,8 +14,8 @@ class BreadthFirstSearch {
public:
BreadthFirstSearch() = default;
BreadthFirstSearch(std::map<T, std::set<T>> adjMatrix)
: adjMatrix(adjMatrix) {}
BreadthFirstSearch(std::map<T, std::set<T>> adjList)
: adjList(adjList) {}
// Traverse whole graph using the BFS search, and save the tree graph
// which is created when visiting new vertices (Breadth First Tree)
@@ -25,7 +25,7 @@ public:
bool query(const T& root, const T& target);
private:
// Represents the graph on which the algorithm will be executed
std::map<T, std::set<T>> adjMatrix;
std::map<T, std::set<T>> adjList;
};
template<typename T>
@@ -40,7 +40,7 @@ std::map<T, std::set<T>> BreadthFirstSearch<T>::execute(const T& root) {
const auto v = Q.front();
Q.pop();
for (const auto& u : adjMatrix[v]) {
for (const auto& u : adjList[v]) {
if (!visited[u]) {
visited[u] = true;
tree[v].insert(u);
@@ -65,7 +65,7 @@ bool BreadthFirstSearch<T>::query(const T& root, const T& target) {
if (v == target) return true;
for (const auto& u : adjMatrix[v]) {
for (const auto& u : adjList[v]) {
if (!visited[u]) {
visited[u] = true;
Q.push(u);