197 lines
18 KiB
HTML
197 lines
18 KiB
HTML
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
|
|
|
|
<html lang="en">
|
|
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
|
|
<title>LCOV - coverage.info - bayesnet/utils/Mst.cc</title>
|
|
<link rel="stylesheet" type="text/css" href="../../gcov.css">
|
|
</head>
|
|
|
|
<body>
|
|
|
|
<table width="100%" border=0 cellspacing=0 cellpadding=0>
|
|
<tr><td class="title">LCOV - code coverage report</td></tr>
|
|
<tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
|
|
|
|
<tr>
|
|
<td width="100%">
|
|
<table cellpadding=1 border=0 width="100%">
|
|
<tr>
|
|
<td width="10%" class="headerItem">Current view:</td>
|
|
<td width="10%" class="headerValue"><a href="../../index.html">top level</a> - <a href="index.html">bayesnet/utils</a> - Mst.cc<span style="font-size: 80%;"> (source / <a href="Mst.cc.func-c.html">functions</a>)</span></td>
|
|
<td width="5%"></td>
|
|
<td width="5%"></td>
|
|
<td width="5%" class="headerCovTableHead">Coverage</td>
|
|
<td width="5%" class="headerCovTableHead" title="Covered + Uncovered code">Total</td>
|
|
<td width="5%" class="headerCovTableHead" title="Exercised code only">Hit</td>
|
|
</tr>
|
|
<tr>
|
|
<td class="headerItem">Test:</td>
|
|
<td class="headerValue">coverage.info</td>
|
|
<td></td>
|
|
<td class="headerItem">Lines:</td>
|
|
<td class="headerCovTableEntryHi">94.1 %</td>
|
|
<td class="headerCovTableEntry">68</td>
|
|
<td class="headerCovTableEntry">64</td>
|
|
</tr>
|
|
<tr>
|
|
<td class="headerItem">Test Date:</td>
|
|
<td class="headerValue">2024-04-30 13:59:18</td>
|
|
<td></td>
|
|
<td class="headerItem">Functions:</td>
|
|
<td class="headerCovTableEntryHi">100.0 %</td>
|
|
<td class="headerCovTableEntry">10</td>
|
|
<td class="headerCovTableEntry">10</td>
|
|
</tr>
|
|
<tr><td><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
|
|
</table>
|
|
</td>
|
|
</tr>
|
|
|
|
<tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
|
|
</table>
|
|
|
|
<table cellpadding=0 cellspacing=0 border=0>
|
|
<tr>
|
|
<td><br></td>
|
|
</tr>
|
|
<tr>
|
|
<td>
|
|
<pre class="sourceHeading"> Line data Source code</pre>
|
|
<pre class="source">
|
|
<span id="L1"><span class="lineNum"> 1</span> : // ***************************************************************</span>
|
|
<span id="L2"><span class="lineNum"> 2</span> : // SPDX-FileCopyrightText: Copyright 2024 Ricardo Montañana Gómez</span>
|
|
<span id="L3"><span class="lineNum"> 3</span> : // SPDX-FileType: SOURCE</span>
|
|
<span id="L4"><span class="lineNum"> 4</span> : // SPDX-License-Identifier: MIT</span>
|
|
<span id="L5"><span class="lineNum"> 5</span> : // ***************************************************************</span>
|
|
<span id="L6"><span class="lineNum"> 6</span> : </span>
|
|
<span id="L7"><span class="lineNum"> 7</span> : #include <sstream></span>
|
|
<span id="L8"><span class="lineNum"> 8</span> : #include <vector></span>
|
|
<span id="L9"><span class="lineNum"> 9</span> : #include <list></span>
|
|
<span id="L10"><span class="lineNum"> 10</span> : #include "Mst.h"</span>
|
|
<span id="L11"><span class="lineNum"> 11</span> : /*</span>
|
|
<span id="L12"><span class="lineNum"> 12</span> : Based on the code from https://www.softwaretestinghelp.com/minimum-spanning-tree-tutorial/</span>
|
|
<span id="L13"><span class="lineNum"> 13</span> : </span>
|
|
<span id="L14"><span class="lineNum"> 14</span> : */</span>
|
|
<span id="L15"><span class="lineNum"> 15</span> : </span>
|
|
<span id="L16"><span class="lineNum"> 16</span> : namespace bayesnet {</span>
|
|
<span id="L17"><span class="lineNum"> 17</span> <span class="tlaGNC tlaBgGNC"> 348 : Graph::Graph(int V) : V(V), parent(std::vector<int>(V))</span></span>
|
|
<span id="L18"><span class="lineNum"> 18</span> : {</span>
|
|
<span id="L19"><span class="lineNum"> 19</span> <span class="tlaGNC"> 1302 : for (int i = 0; i < V; i++)</span></span>
|
|
<span id="L20"><span class="lineNum"> 20</span> <span class="tlaGNC"> 1128 : parent[i] = i;</span></span>
|
|
<span id="L21"><span class="lineNum"> 21</span> <span class="tlaGNC"> 174 : G.clear();</span></span>
|
|
<span id="L22"><span class="lineNum"> 22</span> <span class="tlaGNC"> 174 : T.clear();</span></span>
|
|
<span id="L23"><span class="lineNum"> 23</span> <span class="tlaGNC"> 174 : }</span></span>
|
|
<span id="L24"><span class="lineNum"> 24</span> <span class="tlaGNC"> 3456 : void Graph::addEdge(int u, int v, float wt)</span></span>
|
|
<span id="L25"><span class="lineNum"> 25</span> : {</span>
|
|
<span id="L26"><span class="lineNum"> 26</span> <span class="tlaGNC"> 3456 : G.push_back({ wt, { u, v } });</span></span>
|
|
<span id="L27"><span class="lineNum"> 27</span> <span class="tlaGNC"> 3456 : }</span></span>
|
|
<span id="L28"><span class="lineNum"> 28</span> <span class="tlaGNC"> 15978 : int Graph::find_set(int i)</span></span>
|
|
<span id="L29"><span class="lineNum"> 29</span> : {</span>
|
|
<span id="L30"><span class="lineNum"> 30</span> : // If i is the parent of itself</span>
|
|
<span id="L31"><span class="lineNum"> 31</span> <span class="tlaGNC"> 15978 : if (i == parent[i])</span></span>
|
|
<span id="L32"><span class="lineNum"> 32</span> <span class="tlaGNC"> 6912 : return i;</span></span>
|
|
<span id="L33"><span class="lineNum"> 33</span> : else</span>
|
|
<span id="L34"><span class="lineNum"> 34</span> : //else recursively find the parent of i</span>
|
|
<span id="L35"><span class="lineNum"> 35</span> <span class="tlaGNC"> 9066 : return find_set(parent[i]);</span></span>
|
|
<span id="L36"><span class="lineNum"> 36</span> : }</span>
|
|
<span id="L37"><span class="lineNum"> 37</span> <span class="tlaGNC"> 954 : void Graph::union_set(int u, int v)</span></span>
|
|
<span id="L38"><span class="lineNum"> 38</span> : {</span>
|
|
<span id="L39"><span class="lineNum"> 39</span> <span class="tlaGNC"> 954 : parent[u] = parent[v];</span></span>
|
|
<span id="L40"><span class="lineNum"> 40</span> <span class="tlaGNC"> 954 : }</span></span>
|
|
<span id="L41"><span class="lineNum"> 41</span> <span class="tlaGNC"> 174 : void Graph::kruskal_algorithm()</span></span>
|
|
<span id="L42"><span class="lineNum"> 42</span> : {</span>
|
|
<span id="L43"><span class="lineNum"> 43</span> : // sort the edges ordered on decreasing weight</span>
|
|
<span id="L44"><span class="lineNum"> 44</span> <span class="tlaGNC"> 13452 : stable_sort(G.begin(), G.end(), [](const auto& left, const auto& right) {return left.first > right.first;});</span></span>
|
|
<span id="L45"><span class="lineNum"> 45</span> <span class="tlaGNC"> 3630 : for (int i = 0; i < G.size(); i++) {</span></span>
|
|
<span id="L46"><span class="lineNum"> 46</span> : int uSt, vEd;</span>
|
|
<span id="L47"><span class="lineNum"> 47</span> <span class="tlaGNC"> 3456 : uSt = find_set(G[i].second.first);</span></span>
|
|
<span id="L48"><span class="lineNum"> 48</span> <span class="tlaGNC"> 3456 : vEd = find_set(G[i].second.second);</span></span>
|
|
<span id="L49"><span class="lineNum"> 49</span> <span class="tlaGNC"> 3456 : if (uSt != vEd) {</span></span>
|
|
<span id="L50"><span class="lineNum"> 50</span> <span class="tlaGNC"> 954 : T.push_back(G[i]); // add to mst std::vector</span></span>
|
|
<span id="L51"><span class="lineNum"> 51</span> <span class="tlaGNC"> 954 : union_set(uSt, vEd);</span></span>
|
|
<span id="L52"><span class="lineNum"> 52</span> : }</span>
|
|
<span id="L53"><span class="lineNum"> 53</span> : }</span>
|
|
<span id="L54"><span class="lineNum"> 54</span> <span class="tlaGNC"> 174 : }</span></span>
|
|
<span id="L55"><span class="lineNum"> 55</span> : </span>
|
|
<span id="L56"><span class="lineNum"> 56</span> <span class="tlaGNC"> 954 : void insertElement(std::list<int>& variables, int variable)</span></span>
|
|
<span id="L57"><span class="lineNum"> 57</span> : {</span>
|
|
<span id="L58"><span class="lineNum"> 58</span> <span class="tlaGNC"> 954 : if (std::find(variables.begin(), variables.end(), variable) == variables.end()) {</span></span>
|
|
<span id="L59"><span class="lineNum"> 59</span> <span class="tlaGNC"> 954 : variables.push_front(variable);</span></span>
|
|
<span id="L60"><span class="lineNum"> 60</span> : }</span>
|
|
<span id="L61"><span class="lineNum"> 61</span> <span class="tlaGNC"> 954 : }</span></span>
|
|
<span id="L62"><span class="lineNum"> 62</span> : </span>
|
|
<span id="L63"><span class="lineNum"> 63</span> <span class="tlaGNC"> 174 : std::vector<std::pair<int, int>> reorder(std::vector<std::pair<float, std::pair<int, int>>> T, int root_original)</span></span>
|
|
<span id="L64"><span class="lineNum"> 64</span> : {</span>
|
|
<span id="L65"><span class="lineNum"> 65</span> : // Create the edges of a DAG from the MST</span>
|
|
<span id="L66"><span class="lineNum"> 66</span> : // replacing unordered_set with list because unordered_set cannot guarantee the order of the elements inserted</span>
|
|
<span id="L67"><span class="lineNum"> 67</span> <span class="tlaGNC"> 174 : auto result = std::vector<std::pair<int, int>>();</span></span>
|
|
<span id="L68"><span class="lineNum"> 68</span> <span class="tlaGNC"> 174 : auto visited = std::vector<int>();</span></span>
|
|
<span id="L69"><span class="lineNum"> 69</span> <span class="tlaGNC"> 174 : auto nextVariables = std::list<int>();</span></span>
|
|
<span id="L70"><span class="lineNum"> 70</span> <span class="tlaGNC"> 174 : nextVariables.push_front(root_original);</span></span>
|
|
<span id="L71"><span class="lineNum"> 71</span> <span class="tlaGNC"> 1302 : while (nextVariables.size() > 0) {</span></span>
|
|
<span id="L72"><span class="lineNum"> 72</span> <span class="tlaGNC"> 1128 : int root = nextVariables.front();</span></span>
|
|
<span id="L73"><span class="lineNum"> 73</span> <span class="tlaGNC"> 1128 : nextVariables.pop_front();</span></span>
|
|
<span id="L74"><span class="lineNum"> 74</span> <span class="tlaGNC"> 3984 : for (int i = 0; i < T.size(); ++i) {</span></span>
|
|
<span id="L75"><span class="lineNum"> 75</span> <span class="tlaGNC"> 2856 : auto [weight, edge] = T[i];</span></span>
|
|
<span id="L76"><span class="lineNum"> 76</span> <span class="tlaGNC"> 2856 : auto [from, to] = edge;</span></span>
|
|
<span id="L77"><span class="lineNum"> 77</span> <span class="tlaGNC"> 2856 : if (from == root || to == root) {</span></span>
|
|
<span id="L78"><span class="lineNum"> 78</span> <span class="tlaGNC"> 954 : visited.insert(visited.begin(), i);</span></span>
|
|
<span id="L79"><span class="lineNum"> 79</span> <span class="tlaGNC"> 954 : if (from == root) {</span></span>
|
|
<span id="L80"><span class="lineNum"> 80</span> <span class="tlaGNC"> 636 : result.push_back({ from, to });</span></span>
|
|
<span id="L81"><span class="lineNum"> 81</span> <span class="tlaGNC"> 636 : insertElement(nextVariables, to);</span></span>
|
|
<span id="L82"><span class="lineNum"> 82</span> : } else {</span>
|
|
<span id="L83"><span class="lineNum"> 83</span> <span class="tlaGNC"> 318 : result.push_back({ to, from });</span></span>
|
|
<span id="L84"><span class="lineNum"> 84</span> <span class="tlaGNC"> 318 : insertElement(nextVariables, from);</span></span>
|
|
<span id="L85"><span class="lineNum"> 85</span> : }</span>
|
|
<span id="L86"><span class="lineNum"> 86</span> : }</span>
|
|
<span id="L87"><span class="lineNum"> 87</span> : }</span>
|
|
<span id="L88"><span class="lineNum"> 88</span> : // Remove visited</span>
|
|
<span id="L89"><span class="lineNum"> 89</span> <span class="tlaGNC"> 2082 : for (int i = 0; i < visited.size(); ++i) {</span></span>
|
|
<span id="L90"><span class="lineNum"> 90</span> <span class="tlaGNC"> 954 : T.erase(T.begin() + visited[i]);</span></span>
|
|
<span id="L91"><span class="lineNum"> 91</span> : }</span>
|
|
<span id="L92"><span class="lineNum"> 92</span> <span class="tlaGNC"> 1128 : visited.clear();</span></span>
|
|
<span id="L93"><span class="lineNum"> 93</span> : }</span>
|
|
<span id="L94"><span class="lineNum"> 94</span> <span class="tlaGNC"> 174 : if (T.size() > 0) {</span></span>
|
|
<span id="L95"><span class="lineNum"> 95</span> <span class="tlaUNC tlaBgUNC"> 0 : for (int i = 0; i < T.size(); ++i) {</span></span>
|
|
<span id="L96"><span class="lineNum"> 96</span> <span class="tlaUNC"> 0 : auto [weight, edge] = T[i];</span></span>
|
|
<span id="L97"><span class="lineNum"> 97</span> <span class="tlaUNC"> 0 : auto [from, to] = edge;</span></span>
|
|
<span id="L98"><span class="lineNum"> 98</span> <span class="tlaUNC"> 0 : result.push_back({ from, to });</span></span>
|
|
<span id="L99"><span class="lineNum"> 99</span> : }</span>
|
|
<span id="L100"><span class="lineNum"> 100</span> : }</span>
|
|
<span id="L101"><span class="lineNum"> 101</span> <span class="tlaGNC tlaBgGNC"> 348 : return result;</span></span>
|
|
<span id="L102"><span class="lineNum"> 102</span> <span class="tlaGNC"> 174 : }</span></span>
|
|
<span id="L103"><span class="lineNum"> 103</span> : </span>
|
|
<span id="L104"><span class="lineNum"> 104</span> <span class="tlaGNC"> 174 : MST::MST(const std::vector<std::string>& features, const torch::Tensor& weights, const int root) : features(features), weights(weights), root(root) {}</span></span>
|
|
<span id="L105"><span class="lineNum"> 105</span> <span class="tlaGNC"> 174 : std::vector<std::pair<int, int>> MST::maximumSpanningTree()</span></span>
|
|
<span id="L106"><span class="lineNum"> 106</span> : {</span>
|
|
<span id="L107"><span class="lineNum"> 107</span> <span class="tlaGNC"> 174 : auto num_features = features.size();</span></span>
|
|
<span id="L108"><span class="lineNum"> 108</span> <span class="tlaGNC"> 174 : Graph g(num_features);</span></span>
|
|
<span id="L109"><span class="lineNum"> 109</span> : // Make a complete graph</span>
|
|
<span id="L110"><span class="lineNum"> 110</span> <span class="tlaGNC"> 1128 : for (int i = 0; i < num_features - 1; ++i) {</span></span>
|
|
<span id="L111"><span class="lineNum"> 111</span> <span class="tlaGNC"> 4410 : for (int j = i + 1; j < num_features; ++j) {</span></span>
|
|
<span id="L112"><span class="lineNum"> 112</span> <span class="tlaGNC"> 3456 : g.addEdge(i, j, weights[i][j].item<float>());</span></span>
|
|
<span id="L113"><span class="lineNum"> 113</span> : }</span>
|
|
<span id="L114"><span class="lineNum"> 114</span> : }</span>
|
|
<span id="L115"><span class="lineNum"> 115</span> <span class="tlaGNC"> 174 : g.kruskal_algorithm();</span></span>
|
|
<span id="L116"><span class="lineNum"> 116</span> <span class="tlaGNC"> 174 : auto mst = g.get_mst();</span></span>
|
|
<span id="L117"><span class="lineNum"> 117</span> <span class="tlaGNC"> 348 : return reorder(mst, root);</span></span>
|
|
<span id="L118"><span class="lineNum"> 118</span> <span class="tlaGNC"> 174 : }</span></span>
|
|
<span id="L119"><span class="lineNum"> 119</span> : </span>
|
|
<span id="L120"><span class="lineNum"> 120</span> : }</span>
|
|
</pre>
|
|
</td>
|
|
</tr>
|
|
</table>
|
|
<br>
|
|
|
|
<table width="100%" border=0 cellspacing=0 cellpadding=0>
|
|
<tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
|
|
<tr><td class="versionInfo">Generated by: <a href="https://github.com//linux-test-project/lcov" target="_parent">LCOV version 2.0-1</a></td></tr>
|
|
</table>
|
|
<br>
|
|
|
|
</body>
|
|
</html>
|