-
Notifications
You must be signed in to change notification settings - Fork 33
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge branch 'main' into feature/source-calculation-using-ybus
- Loading branch information
Showing
19 changed files
with
672 additions
and
189 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
221 changes: 221 additions & 0 deletions
221
power_grid_model_c/power_grid_model/include/power_grid_model/sparse_ordering.hpp
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,221 @@ | ||
| // SPDX-FileCopyrightText: Contributors to the Power Grid Model project <powergridmodel@lfenergy.org> | ||
| // | ||
| // SPDX-License-Identifier: MPL-2.0 | ||
|
|
||
| #pragma once | ||
|
|
||
| #include "common/common.hpp" | ||
|
|
||
| #include <algorithm> | ||
| #include <cassert> | ||
| #include <compare> | ||
| #include <map> | ||
| #include <set> | ||
| #include <utility> | ||
| #include <vector> | ||
|
|
||
| namespace power_grid_model { | ||
|
|
||
| namespace detail { | ||
| class DegreeLookup { | ||
| public: | ||
| void set(Idx u, Idx degree) { | ||
| if (auto degree_it = vertex_to_degree.find(u); degree_it != vertex_to_degree.end()) { | ||
| remove_degree(u, degree_it->second); | ||
| degree_it->second = degree; | ||
| } else { | ||
| vertex_to_degree.try_emplace(u, degree); | ||
| } | ||
| degrees_to_vertex[degree].insert(u); | ||
| } | ||
|
|
||
| void erase(Idx u) { | ||
| auto vertex_it = vertex_to_degree.find(u); | ||
| if (vertex_it == vertex_to_degree.end()) { | ||
| return; | ||
| } | ||
| Idx const degree = vertex_it->second; | ||
| vertex_to_degree.erase(vertex_it); | ||
| remove_degree(u, degree); | ||
| } | ||
|
|
||
| friend auto min_element(DegreeLookup const& dgd); | ||
|
|
||
| private: | ||
| void remove_degree(Idx u, Idx degree) { | ||
| if (auto degree_it = degrees_to_vertex.find(degree); degree_it != degrees_to_vertex.end()) { | ||
| degree_it->second.erase(u); | ||
| if (degree_it->second.empty()) { | ||
| degrees_to_vertex.erase(degree_it); | ||
| } | ||
| } | ||
| } | ||
|
|
||
| std::map<Idx, Idx> vertex_to_degree; | ||
| std::map<Idx, std::set<Idx>> degrees_to_vertex; | ||
| }; | ||
|
|
||
| inline auto min_element(DegreeLookup const& dgd) { | ||
| Idx const vertex = *dgd.degrees_to_vertex.begin()->second.begin(); | ||
| return dgd.vertex_to_degree.find(vertex); | ||
| } | ||
|
|
||
| inline void remove_element_degree(Idx u, DegreeLookup& dgd) { dgd.erase(u); } | ||
|
|
||
| inline void set_element_degree(Idx u, Idx degree, DegreeLookup& dgd) { dgd.set(u, degree); } | ||
|
|
||
| inline Idx num_adjacent(Idx const u, std::map<Idx, IdxVector> const& d) { | ||
| if (auto it = d.find(u); it != d.end()) { | ||
| return static_cast<Idx>(it->second.size()); | ||
| } | ||
| return 0; | ||
| } | ||
|
|
||
| inline IdxVector const& adj(Idx const u, std::map<Idx, IdxVector> const& d) { return d.at(u); } | ||
|
|
||
| inline std::vector<std::pair<Idx, DegreeLookup>> comp_size_degrees_graph(std::map<Idx, IdxVector> const& d) { | ||
| DegreeLookup dd; | ||
| IdxVector v; | ||
|
|
||
| for (auto const& [k, adjacent] : d) { | ||
| v.push_back(k); | ||
| set_element_degree(k, static_cast<Idx>(adjacent.size()), dd); | ||
| } | ||
|
|
||
| return {{d.size(), dd}}; | ||
| } | ||
|
|
||
| inline std::map<Idx, IdxVector> make_clique(IdxVector& l) { | ||
| std::map<Idx, IdxVector> d; | ||
|
|
||
| for (Idx i = 0; i < static_cast<Idx>(l.size()); i++) { | ||
| IdxVector sl(l.size() - 1); | ||
| std::copy(l.begin(), l.begin() + i, sl.begin()); | ||
| std::copy(l.begin() + i + 1, l.end(), sl.begin() + i); | ||
| d[l[i]] = std::move(sl); | ||
| } | ||
|
|
||
| return d; | ||
| } | ||
|
|
||
| inline std::vector<std::pair<IdxVector, IdxVector>> check_indistguishable(Idx const u, | ||
| std::map<Idx, IdxVector> const& d) { | ||
| IdxVector rl; | ||
|
|
||
| auto l = adj(u, d); | ||
| auto lu = l; | ||
| lu.push_back(u); | ||
| std::ranges::sort(lu); | ||
|
|
||
| for (auto const& v : l) { | ||
| auto lv = adj(v, d); | ||
| lv.push_back(v); | ||
| std::ranges::sort(lv); | ||
| if (lu == lv) { | ||
| rl.push_back(v); | ||
| } | ||
| } | ||
|
|
||
| return {{l, rl}}; | ||
| } | ||
|
|
||
| inline bool in_graph(std::pair<Idx, Idx> const& e, std::map<Idx, IdxVector> const& d) { | ||
| if (auto edges_it = d.find(e.first); | ||
| edges_it != d.cend() && std::ranges::find(edges_it->second, e.second) != edges_it->second.cend()) { | ||
| return true; | ||
| } | ||
| return false; | ||
| } | ||
|
|
||
| inline IdxVector remove_vertices_update_degrees(Idx const u, std::map<Idx, IdxVector>& d, DegreeLookup& dgd, | ||
| std::vector<std::pair<Idx, Idx>>& fills) { | ||
| std::vector<std::pair<IdxVector, IdxVector>> nbsrl = check_indistguishable(u, d); | ||
| auto& [nbs, rl] = nbsrl[0]; | ||
| IdxVector alpha = rl; | ||
| std::map<Idx, IdxVector> dd; | ||
|
|
||
| rl.push_back(u); | ||
|
|
||
| for (auto uu : rl) { | ||
| if (uu != u) { | ||
| std::erase(nbs, uu); | ||
| } | ||
|
|
||
| remove_element_degree(uu, dgd); | ||
| IdxVector el; | ||
| for (auto e : d[uu]) { | ||
| auto& adjacents = d[e]; | ||
| std::erase(adjacents, uu); | ||
| if (adjacents.empty()) { | ||
| el.push_back(e); | ||
| } | ||
| } | ||
|
|
||
| el.push_back(uu); | ||
|
|
||
| for (auto const& it : el) { | ||
| d.erase(it); | ||
| } | ||
| } | ||
|
|
||
| dd = make_clique(nbs); | ||
|
|
||
| for (auto const& [k, adjacent] : dd) { | ||
| auto it = d.find(k); | ||
| for (Idx const e : adjacent) { | ||
| if (!in_graph(std::make_pair(k, e), d)) { | ||
| if (it == d.end()) { | ||
| std::tie(it, std::ignore) = d.try_emplace(k); | ||
| } | ||
| it->second.push_back(e); | ||
| d[e].push_back(k); | ||
| fills.emplace_back(k, e); | ||
| } | ||
| } | ||
| } | ||
|
|
||
| for (auto const& e : nbs) { | ||
| set_element_degree(e, num_adjacent(e, d), dgd); | ||
| } | ||
|
|
||
| return alpha; | ||
| } | ||
| } // namespace detail | ||
|
|
||
| inline std::pair<IdxVector, std::vector<std::pair<Idx, Idx>>> minimum_degree_ordering(std::map<Idx, IdxVector> d) { | ||
| // make symmetric | ||
| for (auto const& [k, adjacent] : d) { | ||
| for (auto e : adjacent) { | ||
| d[e].push_back(k); | ||
| } | ||
| } | ||
| for (auto& [k, adjacent] : d) { | ||
| std::set<Idx> const unique_sorted_adjacent{adjacent.begin(), adjacent.end()}; | ||
| adjacent = IdxVector{unique_sorted_adjacent.begin(), unique_sorted_adjacent.end()}; | ||
| } | ||
|
|
||
| auto data = detail::comp_size_degrees_graph(d); | ||
| auto& [n, dgd] = data[0]; | ||
|
|
||
| IdxVector alpha; | ||
| std::vector<std::pair<Idx, Idx>> fills; | ||
|
|
||
| for (Idx k = 0; k < n; ++k) { | ||
| Idx const u = get<0>(*detail::min_element(dgd)); | ||
| alpha.push_back(u); | ||
| if (d.size() == 2) { | ||
| assert(d.begin()->second.size() == 1); | ||
|
|
||
| Idx const from = d.begin()->first; | ||
| Idx const to = d.begin()->second[0]; | ||
| alpha.push_back(alpha.back() == from ? to : from); | ||
| return {alpha, fills}; | ||
| } | ||
| std::ranges::copy(detail::remove_vertices_update_degrees(u, d, dgd, fills), std::back_inserter(alpha)); | ||
| if (d.empty()) { | ||
| return {alpha, fills}; | ||
| } | ||
| } | ||
| return {alpha, fills}; | ||
| } | ||
| } // namespace power_grid_model |
Oops, something went wrong.