diff --git a/docs/html/best__first_8h_source.html b/docs/html/best__first_8h_source.html index f73dcfec..69122b90 100644 --- a/docs/html/best__first_8h_source.html +++ b/docs/html/best__first_8h_source.html @@ -92,74 +92,74 @@
6#include <iostream>
7#include <unordered_map>
8#include <queue>
-
9#endif
-
10
-
-
14template <typename T> class best_first{
-
15private:
-
16 std::unordered_map<T, std::vector<std::pair<T, double> > > adj;
-
17 std::unordered_map<T, double> nodes;
-
18
-
19public:
-
20
-
-
26 explicit best_first(std::unordered_map<T, std::vector<std::pair<T, double> > > v = {}){
-
27 if(!v.empty()){
-
28 this->adj = v;
-
29 }
-
30 }
+
9#include <climits>
+
10#endif
+
11
+
+
15template <typename T> class best_first{
+
16private:
+
17 std::unordered_map<T, std::vector<std::pair<T, double> > > adj;
+
18 std::unordered_map<T, double> nodes;
+
19
+
20public:
+
21
+
+
27 explicit best_first(std::unordered_map<T, std::vector<std::pair<T, double> > > v = {}){
+
28 if(!v.empty()){
+
29 this->adj = v;
+
30 }
+
31 }
-
31
-
-
37 void insert_node(T u, double val){
-
38 nodes[u] = val;
-
39 }
+
32
+
+
38 void insert_node(T u, double val){
+
39 nodes[u] = val;
+
40 }
-
40
41
-
-
49 bool has_edge(T u, T v){
-
50 if(adj.find(u) != adj.end()){
-
51 for(std::pair<T, double> &x : adj[u]){
-
52 if(x.first == v){
-
53 return true;
-
54 }
-
55 }
-
56 }
-
57 return false;
-
58 }
+
42
+
+
50 bool has_edge(T u, T v){
+
51 if(adj.find(u) != adj.end()){
+
52 for(std::pair<T, double> &x : adj[u]){
+
53 if(x.first == v){
+
54 return true;
+
55 }
+
56 }
+
57 }
+
58 return false;
+
59 }
-
59
-
-
65 void add_edge(T u, T v){
-
66 try{
-
67 if(nodes.find(u) != nodes.end() && nodes.find(v) != nodes.end()){
-
68 adj[u].push_back(std::make_pair(v, nodes[v]));
-
69 }
-
70 else{
-
71 throw std::logic_error("One of the two nodes that passed to the function do not exist in the graph");
-
72 }
-
73 }
-
74 catch(std::logic_error &e){
-
75 std::cerr << e.what() << '\n';
-
76 }
-
77 }
+
60
+
+
66 void add_edge(T u, T v){
+
67 try{
+
68 if(nodes.find(u) != nodes.end() && nodes.find(v) != nodes.end()){
+
69 adj[u].push_back(std::make_pair(v, nodes[v]));
+
70 }
+
71 else{
+
72 throw std::logic_error("One of the two nodes that passed to the function do not exist in the graph");
+
73 }
+
74 }
+
75 catch(std::logic_error &e){
+
76 std::cerr << e.what() << '\n';
+
77 }
+
78 }
-
78
-
-
86 bool search(T start, T end){
-
87 if(adj.empty()){
-
88 return false;
-
89 }
-
90 std::unordered_map<T, bool> visited;
-
91 std::priority_queue<std::pair<T, double>, std::vector<std::pair<T, double> >, std::greater<std::pair<T, double> > > q;
-
92 q.push({start, nodes[start]});
-
93 visited[start] = true;
-
94 while(!q.empty()){
-
95 int64_t size = q.size();
-
96 for(int64_t i = 0; i<size; i++){
-
97 std::pair<T, double> current = q.top();
-
98 std::cout << current.first << " " << current.second << '\n';
+
79
+
+
87 bool search(T start, T end){
+
88 if(adj.empty()){
+
89 return false;
+
90 }
+
91 std::unordered_map<T, bool> visited;
+
92 std::priority_queue<std::pair<T, double>, std::vector<std::pair<T, double> >, std::greater<std::pair<T, double> > > q;
+
93 q.push({start, nodes[start]});
+
94 visited[start] = true;
+
95 while(!q.empty()){
+
96 int64_t size = q.size();
+
97 for(int64_t i = 0; i<size; i++){
+
98 std::pair<T, double> current = q.top();
99 if(current.first == end){
100 return true;
101 }
@@ -181,12 +181,12 @@
115
116#endif
117
-
best_first
best first class
Definition best_first.h:14
-
best_first::add_edge
void add_edge(T u, T v)
add_edge function
Definition best_first.h:65
-
best_first::best_first
best_first(std::unordered_map< T, std::vector< std::pair< T, double > > > v={})
best_first constructor
Definition best_first.h:26
-
best_first::has_edge
bool has_edge(T u, T v)
has_edge function
Definition best_first.h:49
-
best_first::insert_node
void insert_node(T u, double val)
insert_node function
Definition best_first.h:37
-
best_first::search
bool search(T start, T end)
search function
Definition best_first.h:86
+
best_first
best first class
Definition best_first.h:15
+
best_first::add_edge
void add_edge(T u, T v)
add_edge function
Definition best_first.h:66
+
best_first::best_first
best_first(std::unordered_map< T, std::vector< std::pair< T, double > > > v={})
best_first constructor
Definition best_first.h:27
+
best_first::has_edge
bool has_edge(T u, T v)
has_edge function
Definition best_first.h:50
+
best_first::insert_node
void insert_node(T u, double val)
insert_node function
Definition best_first.h:38
+
best_first::search
bool search(T start, T end)
search function
Definition best_first.h:87
diff --git a/docs/html/hill__climbing_8h_source.html b/docs/html/hill__climbing_8h_source.html index ec9ec6e2..97400143 100644 --- a/docs/html/hill__climbing_8h_source.html +++ b/docs/html/hill__climbing_8h_source.html @@ -92,108 +92,109 @@
6#include <iostream>
7#include <unordered_map>
8#include <queue>
-
9#endif
-
10
-
-
14template <typename T> class hill_climbing{
-
15private:
-
16 std::unordered_map<T, std::vector<std::pair<T, double> > > adj;
-
17 std::unordered_map<T, double> nodes;
-
18
-
19public:
-
20
-
-
26 explicit hill_climbing(std::unordered_map<T, std::vector<std::pair<T, double> > > v = {}){
-
27 if(!v.empty()){
-
28 this->adj = v;
-
29 }
-
30 }
+
9#include <climits>
+
10#endif
+
11
+
+
15template <typename T> class hill_climbing{
+
16private:
+
17 std::unordered_map<T, std::vector<std::pair<T, double> > > adj;
+
18 std::unordered_map<T, double> nodes;
+
19
+
20public:
+
21
+
+
27 explicit hill_climbing(std::unordered_map<T, std::vector<std::pair<T, double> > > v = {}){
+
28 if(!v.empty()){
+
29 this->adj = v;
+
30 }
+
31 }
-
31
-
-
37 void insert_node(T u, double val){
-
38 nodes[u] = val;
-
39 }
+
32
+
+
38 void insert_node(T u, double val){
+
39 nodes[u] = val;
+
40 }
-
40
41
-
-
49 bool has_edge(T u, T v){
-
50 if(adj.find(u) != adj.end()){
-
51 for(std::pair<T, double> &x : adj[u]){
-
52 if(x.first == v){
-
53 return true;
-
54 }
-
55 }
-
56 }
-
57 return false;
-
58 }
+
42
+
+
50 bool has_edge(T u, T v){
+
51 if(adj.find(u) != adj.end()){
+
52 for(std::pair<T, double> &x : adj[u]){
+
53 if(x.first == v){
+
54 return true;
+
55 }
+
56 }
+
57 }
+
58 return false;
+
59 }
-
59
-
-
65 void add_edge(T u, T v){
-
66 try{
-
67 if(nodes.find(u) != nodes.end() && nodes.find(v) != nodes.end()){
-
68 adj[u].push_back(std::make_pair(v, nodes[v]));
-
69 }
-
70 else{
-
71 throw std::logic_error("One of the two nodes that passed to the function do not exist in the graph");
-
72 }
-
73 }
-
74 catch(std::logic_error &e){
-
75 std::cerr << e.what() << '\n';
-
76 }
-
77 }
+
60
+
+
66 void add_edge(T u, T v){
+
67 try{
+
68 if(nodes.find(u) != nodes.end() && nodes.find(v) != nodes.end()){
+
69 adj[u].push_back(std::make_pair(v, nodes[v]));
+
70 }
+
71 else{
+
72 throw std::logic_error("One of the two nodes that passed to the function do not exist in the graph");
+
73 }
+
74 }
+
75 catch(std::logic_error &e){
+
76 std::cerr << e.what() << '\n';
+
77 }
+
78 }
-
78
-
-
86 bool search(T start, T end){
-
87 if(adj.empty()){
-
88 return false;
-
89 }
-
90 std::unordered_map<T, bool> visited;
-
91 std::queue<T> q;
-
92 q.push(start);
-
93 visited[start] = true;
-
94 while(!q.empty()){
-
95 int64_t size = q.size();
-
96 for(int64_t i = 0; i<size; i++){
-
97 T current = q.front();
-
98 if(current == end){
-
99 return true;
-
100 }
-
101 q.pop();
-
102 double minim = std::numeric_limits<double>::max();
-
103 T neigh = current;
-
104 for(std::pair<T, double> &x : adj[current]){
-
105 if(visited.find(x.first) == visited.end()){
-
106 visited[x.first] = true;
-
107 minim = std::min(minim, x.second);
-
108 neigh = x.first;
-
109 }
-
110 }
-
111 if(minim != INT_MAX && neigh != current){
-
112 if(current == start || minim <= nodes[current]){
-
113 q.push(neigh);
-
114 }
-
115 }
-
116 }
-
117 }
-
118 return false;
-
119 }
+
79
+
+
87 bool search(T start, T end){
+
88 if(adj.empty()){
+
89 return false;
+
90 }
+
91 std::unordered_map<T, bool> visited;
+
92 std::queue<T> q;
+
93 q.push(start);
+
94 visited[start] = true;
+
95 while(!q.empty()){
+
96 int64_t size = q.size();
+
97 for(int64_t i = 0; i<size; i++){
+
98 T current = q.front();
+
99 if(current == end){
+
100 return true;
+
101 }
+
102 q.pop();
+
103 double minim = std::numeric_limits<double>::max();
+
104 T neigh = current;
+
105 for(std::pair<T, double> &x : adj[current]){
+
106 if(visited.find(x.first) == visited.end()){
+
107 visited[x.first] = true;
+
108 minim = std::min(minim, x.second);
+
109 neigh = x.first;
+
110 }
+
111 }
+
112 if(minim != INT_MAX && neigh != current){
+
113 if(current == start || minim <= nodes[current]){
+
114 q.push(neigh);
+
115 }
+
116 }
+
117 }
+
118 }
+
119 return false;
+
120 }
-
120
-
121};
+
121
+
122};
-
122
123
-
124#endif
-
hill_climbing
hill climbing class
Definition hill_climbing.h:14
-
hill_climbing::has_edge
bool has_edge(T u, T v)
has_edge function
Definition hill_climbing.h:49
-
hill_climbing::hill_climbing
hill_climbing(std::unordered_map< T, std::vector< std::pair< T, double > > > v={})
hill_climbing constructor
Definition hill_climbing.h:26
-
hill_climbing::search
bool search(T start, T end)
search function
Definition hill_climbing.h:86
-
hill_climbing::add_edge
void add_edge(T u, T v)
add_edge function
Definition hill_climbing.h:65
-
hill_climbing::insert_node
void insert_node(T u, double val)
insert_node function
Definition hill_climbing.h:37
+
124
+
125#endif
+
hill_climbing
hill climbing class
Definition hill_climbing.h:15
+
hill_climbing::has_edge
bool has_edge(T u, T v)
has_edge function
Definition hill_climbing.h:50
+
hill_climbing::hill_climbing
hill_climbing(std::unordered_map< T, std::vector< std::pair< T, double > > > v={})
hill_climbing constructor
Definition hill_climbing.h:27
+
hill_climbing::search
bool search(T start, T end)
search function
Definition hill_climbing.h:87
+
hill_climbing::add_edge
void add_edge(T u, T v)
add_edge function
Definition hill_climbing.h:66
+
hill_climbing::insert_node
void insert_node(T u, double val)
insert_node function
Definition hill_climbing.h:38
diff --git a/docs/latex/best__first_8h_source.tex b/docs/latex/best__first_8h_source.tex index f4debc61..598d44c9 100644 --- a/docs/latex/best__first_8h_source.tex +++ b/docs/latex/best__first_8h_source.tex @@ -10,64 +10,64 @@ \DoxyCodeLine{00006\ \textcolor{preprocessor}{\#include\ }} \DoxyCodeLine{00007\ \textcolor{preprocessor}{\#include\ }} \DoxyCodeLine{00008\ \textcolor{preprocessor}{\#include\ }} -\DoxyCodeLine{00009\ \textcolor{preprocessor}{\#endif}} -\DoxyCodeLine{00010\ } -\DoxyCodeLine{00014\ \textcolor{keyword}{template}\ <\textcolor{keyword}{typename}\ T>\ \textcolor{keyword}{class\ }\mbox{\hyperlink{classbest__first}{best\_first}}\{} -\DoxyCodeLine{00015\ \textcolor{keyword}{private}:} -\DoxyCodeLine{00016\ \ \ std::unordered\_map\ >\ >\ adj;\ } -\DoxyCodeLine{00017\ \ \ std::unordered\_map\ nodes;} -\DoxyCodeLine{00018\ \ \ } -\DoxyCodeLine{00019\ \textcolor{keyword}{public}:} -\DoxyCodeLine{00020\ } -\DoxyCodeLine{00026\ \ \ \textcolor{keyword}{explicit}\ \mbox{\hyperlink{classbest__first_a0aba60a905eddbc5326e3b1f9bfe0d0f}{best\_first}}(std::unordered\_map\ >\ >\ v\ =\ \{\})\{} -\DoxyCodeLine{00027\ \ \ \ \ \textcolor{keywordflow}{if}(!v.empty())\{} -\DoxyCodeLine{00028\ \ \ \ \ \ \ this-\/>adj\ =\ v;} -\DoxyCodeLine{00029\ \ \ \ \ \}} -\DoxyCodeLine{00030\ \ \ \}} -\DoxyCodeLine{00031\ \ \ } -\DoxyCodeLine{00037\ \ \ \textcolor{keywordtype}{void}\ \mbox{\hyperlink{classbest__first_ac6a039d4c6f83eb9707c774a325a0573}{insert\_node}}(T\ u,\ \textcolor{keywordtype}{double}\ val)\{} -\DoxyCodeLine{00038\ \ \ \ \ nodes[u]\ =\ val;} -\DoxyCodeLine{00039\ \ \ \}} -\DoxyCodeLine{00040\ } +\DoxyCodeLine{00009\ \textcolor{preprocessor}{\#include\ }} +\DoxyCodeLine{00010\ \textcolor{preprocessor}{\#endif}} +\DoxyCodeLine{00011\ } +\DoxyCodeLine{00015\ \textcolor{keyword}{template}\ <\textcolor{keyword}{typename}\ T>\ \textcolor{keyword}{class\ }\mbox{\hyperlink{classbest__first}{best\_first}}\{} +\DoxyCodeLine{00016\ \textcolor{keyword}{private}:} +\DoxyCodeLine{00017\ \ \ std::unordered\_map\ >\ >\ adj;\ } +\DoxyCodeLine{00018\ \ \ std::unordered\_map\ nodes;} +\DoxyCodeLine{00019\ \ \ } +\DoxyCodeLine{00020\ \textcolor{keyword}{public}:} +\DoxyCodeLine{00021\ } +\DoxyCodeLine{00027\ \ \ \textcolor{keyword}{explicit}\ \mbox{\hyperlink{classbest__first_a0aba60a905eddbc5326e3b1f9bfe0d0f}{best\_first}}(std::unordered\_map\ >\ >\ v\ =\ \{\})\{} +\DoxyCodeLine{00028\ \ \ \ \ \textcolor{keywordflow}{if}(!v.empty())\{} +\DoxyCodeLine{00029\ \ \ \ \ \ \ this-\/>adj\ =\ v;} +\DoxyCodeLine{00030\ \ \ \ \ \}} +\DoxyCodeLine{00031\ \ \ \}} +\DoxyCodeLine{00032\ \ \ } +\DoxyCodeLine{00038\ \ \ \textcolor{keywordtype}{void}\ \mbox{\hyperlink{classbest__first_ac6a039d4c6f83eb9707c774a325a0573}{insert\_node}}(T\ u,\ \textcolor{keywordtype}{double}\ val)\{} +\DoxyCodeLine{00039\ \ \ \ \ nodes[u]\ =\ val;} +\DoxyCodeLine{00040\ \ \ \}} \DoxyCodeLine{00041\ } -\DoxyCodeLine{00049\ \ \ \textcolor{keywordtype}{bool}\ \mbox{\hyperlink{classbest__first_a500d360531f7f47a8cc5962d47dc41c4}{has\_edge}}(T\ u,\ T\ v)\{} -\DoxyCodeLine{00050\ \ \ \ \ \textcolor{keywordflow}{if}(adj.find(u)\ !=\ adj.end())\{} -\DoxyCodeLine{00051\ \ \ \ \ \ \ \textcolor{keywordflow}{for}(std::pair\ \&x\ :\ adj[u])\{} -\DoxyCodeLine{00052\ \ \ \ \ \ \ \ \ \textcolor{keywordflow}{if}(x.first\ ==\ v)\{} -\DoxyCodeLine{00053\ \ \ \ \ \ \ \ \ \ \ \textcolor{keywordflow}{return}\ \textcolor{keyword}{true};} -\DoxyCodeLine{00054\ \ \ \ \ \ \ \ \ \}} -\DoxyCodeLine{00055\ \ \ \ \ \ \ \}} -\DoxyCodeLine{00056\ \ \ \ \ \}} -\DoxyCodeLine{00057\ \ \ \ \ \textcolor{keywordflow}{return}\ \textcolor{keyword}{false};} -\DoxyCodeLine{00058\ \ \ \}} -\DoxyCodeLine{00059\ \ } -\DoxyCodeLine{00065\ \ \ \textcolor{keywordtype}{void}\ \mbox{\hyperlink{classbest__first_a0184eaa1f2eb8fa65a7e7f8bafc30dea}{add\_edge}}(T\ u,\ T\ v)\{} -\DoxyCodeLine{00066\ \ \ \ \ \textcolor{keywordflow}{try}\{} -\DoxyCodeLine{00067\ \ \ \ \ \ \ \textcolor{keywordflow}{if}(nodes.find(u)\ !=\ nodes.end()\ \&\&\ nodes.find(v)\ !=\ nodes.end())\{} -\DoxyCodeLine{00068\ \ \ \ \ \ \ \ \ adj[u].push\_back(std::make\_pair(v,\ nodes[v]));} -\DoxyCodeLine{00069\ \ \ \ \ \ \ \}} -\DoxyCodeLine{00070\ \ \ \ \ \ \ \textcolor{keywordflow}{else}\{} -\DoxyCodeLine{00071\ \ \ \ \ \ \ \ \ \textcolor{keywordflow}{throw}\ std::logic\_error(\textcolor{stringliteral}{"{}One\ of\ the\ two\ nodes\ that\ passed\ to\ the\ function\ do\ not\ exist\ in\ the\ graph"{}});} -\DoxyCodeLine{00072\ \ \ \ \ \ \ \}} -\DoxyCodeLine{00073\ \ \ \ \ \}} -\DoxyCodeLine{00074\ \ \ \ \ \textcolor{keywordflow}{catch}(std::logic\_error\ \&e)\{} -\DoxyCodeLine{00075\ \ \ \ \ \ \ std::cerr\ <<\ e.what()\ <<\ \textcolor{charliteral}{'\(\backslash\)n'};} -\DoxyCodeLine{00076\ \ \ \ \ \}} -\DoxyCodeLine{00077\ \ \ \}} -\DoxyCodeLine{00078\ \ \ } -\DoxyCodeLine{00086\ \ \ \textcolor{keywordtype}{bool}\ \mbox{\hyperlink{classbest__first_ad26f8ac0e1c3b07108054faa049a1c58}{search}}(T\ start,\ T\ end)\{} -\DoxyCodeLine{00087\ \ \ \ \ \textcolor{keywordflow}{if}(adj.empty())\{} -\DoxyCodeLine{00088\ \ \ \ \ \ \ \textcolor{keywordflow}{return}\ \textcolor{keyword}{false};} -\DoxyCodeLine{00089\ \ \ \ \ \}} -\DoxyCodeLine{00090\ \ \ \ \ std::unordered\_map\ visited;} -\DoxyCodeLine{00091\ \ \ \ \ std::priority\_queue,\ std::vector\ >,\ std::greater\ >\ >\ q;} -\DoxyCodeLine{00092\ \ \ \ \ q.push(\{start,\ nodes[start]\});} -\DoxyCodeLine{00093\ \ \ \ \ visited[start]\ =\ \textcolor{keyword}{true};} -\DoxyCodeLine{00094\ \ \ \ \ \textcolor{keywordflow}{while}(!q.empty())\{} -\DoxyCodeLine{00095\ \ \ \ \ \ \ int64\_t\ size\ =\ q.size();} -\DoxyCodeLine{00096\ \ \ \ \ \ \ \textcolor{keywordflow}{for}(int64\_t\ i\ =\ 0;\ i\ current\ =\ q.top();} -\DoxyCodeLine{00098\ \ \ \ \ \ \ \ \ std::cout\ <<\ current.first\ <<\ \textcolor{stringliteral}{"{}\ "{}}\ <<\ current.second\ <<\ \textcolor{charliteral}{'\(\backslash\)n'};} +\DoxyCodeLine{00042\ } +\DoxyCodeLine{00050\ \ \ \textcolor{keywordtype}{bool}\ \mbox{\hyperlink{classbest__first_a500d360531f7f47a8cc5962d47dc41c4}{has\_edge}}(T\ u,\ T\ v)\{} +\DoxyCodeLine{00051\ \ \ \ \ \textcolor{keywordflow}{if}(adj.find(u)\ !=\ adj.end())\{} +\DoxyCodeLine{00052\ \ \ \ \ \ \ \textcolor{keywordflow}{for}(std::pair\ \&x\ :\ adj[u])\{} +\DoxyCodeLine{00053\ \ \ \ \ \ \ \ \ \textcolor{keywordflow}{if}(x.first\ ==\ v)\{} +\DoxyCodeLine{00054\ \ \ \ \ \ \ \ \ \ \ \textcolor{keywordflow}{return}\ \textcolor{keyword}{true};} +\DoxyCodeLine{00055\ \ \ \ \ \ \ \ \ \}} +\DoxyCodeLine{00056\ \ \ \ \ \ \ \}} +\DoxyCodeLine{00057\ \ \ \ \ \}} +\DoxyCodeLine{00058\ \ \ \ \ \textcolor{keywordflow}{return}\ \textcolor{keyword}{false};} +\DoxyCodeLine{00059\ \ \ \}} +\DoxyCodeLine{00060\ \ } +\DoxyCodeLine{00066\ \ \ \textcolor{keywordtype}{void}\ \mbox{\hyperlink{classbest__first_a0184eaa1f2eb8fa65a7e7f8bafc30dea}{add\_edge}}(T\ u,\ T\ v)\{} +\DoxyCodeLine{00067\ \ \ \ \ \textcolor{keywordflow}{try}\{} +\DoxyCodeLine{00068\ \ \ \ \ \ \ \textcolor{keywordflow}{if}(nodes.find(u)\ !=\ nodes.end()\ \&\&\ nodes.find(v)\ !=\ nodes.end())\{} +\DoxyCodeLine{00069\ \ \ \ \ \ \ \ \ adj[u].push\_back(std::make\_pair(v,\ nodes[v]));} +\DoxyCodeLine{00070\ \ \ \ \ \ \ \}} +\DoxyCodeLine{00071\ \ \ \ \ \ \ \textcolor{keywordflow}{else}\{} +\DoxyCodeLine{00072\ \ \ \ \ \ \ \ \ \textcolor{keywordflow}{throw}\ std::logic\_error(\textcolor{stringliteral}{"{}One\ of\ the\ two\ nodes\ that\ passed\ to\ the\ function\ do\ not\ exist\ in\ the\ graph"{}});} +\DoxyCodeLine{00073\ \ \ \ \ \ \ \}} +\DoxyCodeLine{00074\ \ \ \ \ \}} +\DoxyCodeLine{00075\ \ \ \ \ \textcolor{keywordflow}{catch}(std::logic\_error\ \&e)\{} +\DoxyCodeLine{00076\ \ \ \ \ \ \ std::cerr\ <<\ e.what()\ <<\ \textcolor{charliteral}{'\(\backslash\)n'};} +\DoxyCodeLine{00077\ \ \ \ \ \}} +\DoxyCodeLine{00078\ \ \ \}} +\DoxyCodeLine{00079\ \ \ } +\DoxyCodeLine{00087\ \ \ \textcolor{keywordtype}{bool}\ \mbox{\hyperlink{classbest__first_ad26f8ac0e1c3b07108054faa049a1c58}{search}}(T\ start,\ T\ end)\{} +\DoxyCodeLine{00088\ \ \ \ \ \textcolor{keywordflow}{if}(adj.empty())\{} +\DoxyCodeLine{00089\ \ \ \ \ \ \ \textcolor{keywordflow}{return}\ \textcolor{keyword}{false};} +\DoxyCodeLine{00090\ \ \ \ \ \}} +\DoxyCodeLine{00091\ \ \ \ \ std::unordered\_map\ visited;} +\DoxyCodeLine{00092\ \ \ \ \ std::priority\_queue,\ std::vector\ >,\ std::greater\ >\ >\ q;} +\DoxyCodeLine{00093\ \ \ \ \ q.push(\{start,\ nodes[start]\});} +\DoxyCodeLine{00094\ \ \ \ \ visited[start]\ =\ \textcolor{keyword}{true};} +\DoxyCodeLine{00095\ \ \ \ \ \textcolor{keywordflow}{while}(!q.empty())\{} +\DoxyCodeLine{00096\ \ \ \ \ \ \ int64\_t\ size\ =\ q.size();} +\DoxyCodeLine{00097\ \ \ \ \ \ \ \textcolor{keywordflow}{for}(int64\_t\ i\ =\ 0;\ i\ current\ =\ q.top();} \DoxyCodeLine{00099\ \ \ \ \ \ \ \ \ \textcolor{keywordflow}{if}(current.first\ ==\ end)\{} \DoxyCodeLine{00100\ \ \ \ \ \ \ \ \ \ \ \textcolor{keywordflow}{return}\ \textcolor{keyword}{true};} \DoxyCodeLine{00101\ \ \ \ \ \ \ \ \ \}} diff --git a/docs/latex/hill__climbing_8h_source.tex b/docs/latex/hill__climbing_8h_source.tex index be2bdef3..1e8e24fc 100644 --- a/docs/latex/hill__climbing_8h_source.tex +++ b/docs/latex/hill__climbing_8h_source.tex @@ -10,89 +10,90 @@ \DoxyCodeLine{00006\ \textcolor{preprocessor}{\#include\ }} \DoxyCodeLine{00007\ \textcolor{preprocessor}{\#include\ }} \DoxyCodeLine{00008\ \textcolor{preprocessor}{\#include\ }} -\DoxyCodeLine{00009\ \textcolor{preprocessor}{\#endif}} -\DoxyCodeLine{00010\ } -\DoxyCodeLine{00014\ \textcolor{keyword}{template}\ <\textcolor{keyword}{typename}\ T>\ \textcolor{keyword}{class\ }\mbox{\hyperlink{classhill__climbing}{hill\_climbing}}\{} -\DoxyCodeLine{00015\ \textcolor{keyword}{private}:} -\DoxyCodeLine{00016\ \ \ std::unordered\_map\ >\ >\ adj;\ } -\DoxyCodeLine{00017\ \ \ std::unordered\_map\ nodes;} -\DoxyCodeLine{00018\ \ \ } -\DoxyCodeLine{00019\ \textcolor{keyword}{public}:} -\DoxyCodeLine{00020\ } -\DoxyCodeLine{00026\ \ \ \textcolor{keyword}{explicit}\ \mbox{\hyperlink{classhill__climbing_a741bc35d951ed45a23a3969f6ab58c19}{hill\_climbing}}(std::unordered\_map\ >\ >\ v\ =\ \{\})\{} -\DoxyCodeLine{00027\ \ \ \ \ \textcolor{keywordflow}{if}(!v.empty())\{} -\DoxyCodeLine{00028\ \ \ \ \ \ \ this-\/>adj\ =\ v;} -\DoxyCodeLine{00029\ \ \ \ \ \}} -\DoxyCodeLine{00030\ \ \ \}} -\DoxyCodeLine{00031\ \ \ } -\DoxyCodeLine{00037\ \ \ \textcolor{keywordtype}{void}\ \mbox{\hyperlink{classhill__climbing_ac30264fd6f3b64003211c7379935199e}{insert\_node}}(T\ u,\ \textcolor{keywordtype}{double}\ val)\{} -\DoxyCodeLine{00038\ \ \ \ \ nodes[u]\ =\ val;} -\DoxyCodeLine{00039\ \ \ \}} -\DoxyCodeLine{00040\ } +\DoxyCodeLine{00009\ \textcolor{preprocessor}{\#include\ }} +\DoxyCodeLine{00010\ \textcolor{preprocessor}{\#endif}} +\DoxyCodeLine{00011\ } +\DoxyCodeLine{00015\ \textcolor{keyword}{template}\ <\textcolor{keyword}{typename}\ T>\ \textcolor{keyword}{class\ }\mbox{\hyperlink{classhill__climbing}{hill\_climbing}}\{} +\DoxyCodeLine{00016\ \textcolor{keyword}{private}:} +\DoxyCodeLine{00017\ \ \ std::unordered\_map\ >\ >\ adj;\ } +\DoxyCodeLine{00018\ \ \ std::unordered\_map\ nodes;} +\DoxyCodeLine{00019\ \ \ } +\DoxyCodeLine{00020\ \textcolor{keyword}{public}:} +\DoxyCodeLine{00021\ } +\DoxyCodeLine{00027\ \ \ \textcolor{keyword}{explicit}\ \mbox{\hyperlink{classhill__climbing_a741bc35d951ed45a23a3969f6ab58c19}{hill\_climbing}}(std::unordered\_map\ >\ >\ v\ =\ \{\})\{} +\DoxyCodeLine{00028\ \ \ \ \ \textcolor{keywordflow}{if}(!v.empty())\{} +\DoxyCodeLine{00029\ \ \ \ \ \ \ this-\/>adj\ =\ v;} +\DoxyCodeLine{00030\ \ \ \ \ \}} +\DoxyCodeLine{00031\ \ \ \}} +\DoxyCodeLine{00032\ \ \ } +\DoxyCodeLine{00038\ \ \ \textcolor{keywordtype}{void}\ \mbox{\hyperlink{classhill__climbing_ac30264fd6f3b64003211c7379935199e}{insert\_node}}(T\ u,\ \textcolor{keywordtype}{double}\ val)\{} +\DoxyCodeLine{00039\ \ \ \ \ nodes[u]\ =\ val;} +\DoxyCodeLine{00040\ \ \ \}} \DoxyCodeLine{00041\ } -\DoxyCodeLine{00049\ \ \ \textcolor{keywordtype}{bool}\ \mbox{\hyperlink{classhill__climbing_a1ad9ae87f47b2c51afb0c4f5f76f86ba}{has\_edge}}(T\ u,\ T\ v)\{} -\DoxyCodeLine{00050\ \ \ \ \ \textcolor{keywordflow}{if}(adj.find(u)\ !=\ adj.end())\{} -\DoxyCodeLine{00051\ \ \ \ \ \ \ \textcolor{keywordflow}{for}(std::pair\ \&x\ :\ adj[u])\{} -\DoxyCodeLine{00052\ \ \ \ \ \ \ \ \ \textcolor{keywordflow}{if}(x.first\ ==\ v)\{} -\DoxyCodeLine{00053\ \ \ \ \ \ \ \ \ \ \ \textcolor{keywordflow}{return}\ \textcolor{keyword}{true};} -\DoxyCodeLine{00054\ \ \ \ \ \ \ \ \ \}} -\DoxyCodeLine{00055\ \ \ \ \ \ \ \}} -\DoxyCodeLine{00056\ \ \ \ \ \}} -\DoxyCodeLine{00057\ \ \ \ \ \textcolor{keywordflow}{return}\ \textcolor{keyword}{false};} -\DoxyCodeLine{00058\ \ \ \}} -\DoxyCodeLine{00059\ \ } -\DoxyCodeLine{00065\ \ \ \textcolor{keywordtype}{void}\ \mbox{\hyperlink{classhill__climbing_ab246667632b06376b7397d182d9d1204}{add\_edge}}(T\ u,\ T\ v)\{} -\DoxyCodeLine{00066\ \ \ \ \ \textcolor{keywordflow}{try}\{} -\DoxyCodeLine{00067\ \ \ \ \ \ \ \textcolor{keywordflow}{if}(nodes.find(u)\ !=\ nodes.end()\ \&\&\ nodes.find(v)\ !=\ nodes.end())\{} -\DoxyCodeLine{00068\ \ \ \ \ \ \ \ \ adj[u].push\_back(std::make\_pair(v,\ nodes[v]));} -\DoxyCodeLine{00069\ \ \ \ \ \ \ \}} -\DoxyCodeLine{00070\ \ \ \ \ \ \ \textcolor{keywordflow}{else}\{} -\DoxyCodeLine{00071\ \ \ \ \ \ \ \ \ \textcolor{keywordflow}{throw}\ std::logic\_error(\textcolor{stringliteral}{"{}One\ of\ the\ two\ nodes\ that\ passed\ to\ the\ function\ do\ not\ exist\ in\ the\ graph"{}});} -\DoxyCodeLine{00072\ \ \ \ \ \ \ \}} -\DoxyCodeLine{00073\ \ \ \ \ \}} -\DoxyCodeLine{00074\ \ \ \ \ \textcolor{keywordflow}{catch}(std::logic\_error\ \&e)\{} -\DoxyCodeLine{00075\ \ \ \ \ \ \ std::cerr\ <<\ e.what()\ <<\ \textcolor{charliteral}{'\(\backslash\)n'};} -\DoxyCodeLine{00076\ \ \ \ \ \}} -\DoxyCodeLine{00077\ \ \ \}} -\DoxyCodeLine{00078\ \ \ } -\DoxyCodeLine{00086\ \ \ \textcolor{keywordtype}{bool}\ \mbox{\hyperlink{classhill__climbing_a8b8ea4aff33c127d7de29a27e43e9680}{search}}(T\ start,\ T\ end)\{} -\DoxyCodeLine{00087\ \ \ \ \ \textcolor{keywordflow}{if}(adj.empty())\{} -\DoxyCodeLine{00088\ \ \ \ \ \ \ \textcolor{keywordflow}{return}\ \textcolor{keyword}{false};} -\DoxyCodeLine{00089\ \ \ \ \ \}} -\DoxyCodeLine{00090\ \ \ \ \ std::unordered\_map\ visited;} -\DoxyCodeLine{00091\ \ \ \ \ std::queue\ q;} -\DoxyCodeLine{00092\ \ \ \ \ q.push(start);} -\DoxyCodeLine{00093\ \ \ \ \ visited[start]\ =\ \textcolor{keyword}{true};} -\DoxyCodeLine{00094\ \ \ \ \ \textcolor{keywordflow}{while}(!q.empty())\{} -\DoxyCodeLine{00095\ \ \ \ \ \ \ int64\_t\ size\ =\ q.size();} -\DoxyCodeLine{00096\ \ \ \ \ \ \ \textcolor{keywordflow}{for}(int64\_t\ i\ =\ 0;\ i::max();} -\DoxyCodeLine{00103\ \ \ \ \ \ \ \ \ T\ neigh\ =\ current;} -\DoxyCodeLine{00104\ \ \ \ \ \ \ \ \ \textcolor{keywordflow}{for}(std::pair\ \&x\ :\ adj[current])\{} -\DoxyCodeLine{00105\ \ \ \ \ \ \ \ \ \ \ \textcolor{keywordflow}{if}(visited.find(x.first)\ ==\ visited.end())\{} -\DoxyCodeLine{00106\ \ \ \ \ \ \ \ \ \ \ \ \ visited[x.first]\ =\ \textcolor{keyword}{true};} -\DoxyCodeLine{00107\ \ \ \ \ \ \ \ \ \ \ \ \ minim\ =\ std::min(minim,\ x.second);} -\DoxyCodeLine{00108\ \ \ \ \ \ \ \ \ \ \ \ \ neigh\ =\ x.first;} -\DoxyCodeLine{00109\ \ \ \ \ \ \ \ \ \ \ \}} -\DoxyCodeLine{00110\ \ \ \ \ \ \ \ \ \}} -\DoxyCodeLine{00111\ \ \ \ \ \ \ \ \ \textcolor{keywordflow}{if}(minim\ !=\ INT\_MAX\ \&\&\ neigh\ !=\ current)\{} -\DoxyCodeLine{00112\ \ \ \ \ \ \ \ \ \ \ \textcolor{keywordflow}{if}(current\ ==\ start\ ||\ minim\ <=\ nodes[current])\{} -\DoxyCodeLine{00113\ \ \ \ \ \ \ \ \ \ \ \ \ q.push(neigh);} -\DoxyCodeLine{00114\ \ \ \ \ \ \ \ \ \ \ \}} -\DoxyCodeLine{00115\ \ \ \ \ \ \ \ \ \}} -\DoxyCodeLine{00116\ \ \ \ \ \ \ \}} -\DoxyCodeLine{00117\ \ \ \ \ \}} -\DoxyCodeLine{00118\ \ \ \ \ \textcolor{keywordflow}{return}\ \textcolor{keyword}{false};} -\DoxyCodeLine{00119\ \ \ \}} -\DoxyCodeLine{00120\ } -\DoxyCodeLine{00121\ \};} -\DoxyCodeLine{00122\ } +\DoxyCodeLine{00042\ } +\DoxyCodeLine{00050\ \ \ \textcolor{keywordtype}{bool}\ \mbox{\hyperlink{classhill__climbing_a1ad9ae87f47b2c51afb0c4f5f76f86ba}{has\_edge}}(T\ u,\ T\ v)\{} +\DoxyCodeLine{00051\ \ \ \ \ \textcolor{keywordflow}{if}(adj.find(u)\ !=\ adj.end())\{} +\DoxyCodeLine{00052\ \ \ \ \ \ \ \textcolor{keywordflow}{for}(std::pair\ \&x\ :\ adj[u])\{} +\DoxyCodeLine{00053\ \ \ \ \ \ \ \ \ \textcolor{keywordflow}{if}(x.first\ ==\ v)\{} +\DoxyCodeLine{00054\ \ \ \ \ \ \ \ \ \ \ \textcolor{keywordflow}{return}\ \textcolor{keyword}{true};} +\DoxyCodeLine{00055\ \ \ \ \ \ \ \ \ \}} +\DoxyCodeLine{00056\ \ \ \ \ \ \ \}} +\DoxyCodeLine{00057\ \ \ \ \ \}} +\DoxyCodeLine{00058\ \ \ \ \ \textcolor{keywordflow}{return}\ \textcolor{keyword}{false};} +\DoxyCodeLine{00059\ \ \ \}} +\DoxyCodeLine{00060\ \ } +\DoxyCodeLine{00066\ \ \ \textcolor{keywordtype}{void}\ \mbox{\hyperlink{classhill__climbing_ab246667632b06376b7397d182d9d1204}{add\_edge}}(T\ u,\ T\ v)\{} +\DoxyCodeLine{00067\ \ \ \ \ \textcolor{keywordflow}{try}\{} +\DoxyCodeLine{00068\ \ \ \ \ \ \ \textcolor{keywordflow}{if}(nodes.find(u)\ !=\ nodes.end()\ \&\&\ nodes.find(v)\ !=\ nodes.end())\{} +\DoxyCodeLine{00069\ \ \ \ \ \ \ \ \ adj[u].push\_back(std::make\_pair(v,\ nodes[v]));} +\DoxyCodeLine{00070\ \ \ \ \ \ \ \}} +\DoxyCodeLine{00071\ \ \ \ \ \ \ \textcolor{keywordflow}{else}\{} +\DoxyCodeLine{00072\ \ \ \ \ \ \ \ \ \textcolor{keywordflow}{throw}\ std::logic\_error(\textcolor{stringliteral}{"{}One\ of\ the\ two\ nodes\ that\ passed\ to\ the\ function\ do\ not\ exist\ in\ the\ graph"{}});} +\DoxyCodeLine{00073\ \ \ \ \ \ \ \}} +\DoxyCodeLine{00074\ \ \ \ \ \}} +\DoxyCodeLine{00075\ \ \ \ \ \textcolor{keywordflow}{catch}(std::logic\_error\ \&e)\{} +\DoxyCodeLine{00076\ \ \ \ \ \ \ std::cerr\ <<\ e.what()\ <<\ \textcolor{charliteral}{'\(\backslash\)n'};} +\DoxyCodeLine{00077\ \ \ \ \ \}} +\DoxyCodeLine{00078\ \ \ \}} +\DoxyCodeLine{00079\ \ \ } +\DoxyCodeLine{00087\ \ \ \textcolor{keywordtype}{bool}\ \mbox{\hyperlink{classhill__climbing_a8b8ea4aff33c127d7de29a27e43e9680}{search}}(T\ start,\ T\ end)\{} +\DoxyCodeLine{00088\ \ \ \ \ \textcolor{keywordflow}{if}(adj.empty())\{} +\DoxyCodeLine{00089\ \ \ \ \ \ \ \textcolor{keywordflow}{return}\ \textcolor{keyword}{false};} +\DoxyCodeLine{00090\ \ \ \ \ \}} +\DoxyCodeLine{00091\ \ \ \ \ std::unordered\_map\ visited;} +\DoxyCodeLine{00092\ \ \ \ \ std::queue\ q;} +\DoxyCodeLine{00093\ \ \ \ \ q.push(start);} +\DoxyCodeLine{00094\ \ \ \ \ visited[start]\ =\ \textcolor{keyword}{true};} +\DoxyCodeLine{00095\ \ \ \ \ \textcolor{keywordflow}{while}(!q.empty())\{} +\DoxyCodeLine{00096\ \ \ \ \ \ \ int64\_t\ size\ =\ q.size();} +\DoxyCodeLine{00097\ \ \ \ \ \ \ \textcolor{keywordflow}{for}(int64\_t\ i\ =\ 0;\ i::max();} +\DoxyCodeLine{00104\ \ \ \ \ \ \ \ \ T\ neigh\ =\ current;} +\DoxyCodeLine{00105\ \ \ \ \ \ \ \ \ \textcolor{keywordflow}{for}(std::pair\ \&x\ :\ adj[current])\{} +\DoxyCodeLine{00106\ \ \ \ \ \ \ \ \ \ \ \textcolor{keywordflow}{if}(visited.find(x.first)\ ==\ visited.end())\{} +\DoxyCodeLine{00107\ \ \ \ \ \ \ \ \ \ \ \ \ visited[x.first]\ =\ \textcolor{keyword}{true};} +\DoxyCodeLine{00108\ \ \ \ \ \ \ \ \ \ \ \ \ minim\ =\ std::min(minim,\ x.second);} +\DoxyCodeLine{00109\ \ \ \ \ \ \ \ \ \ \ \ \ neigh\ =\ x.first;} +\DoxyCodeLine{00110\ \ \ \ \ \ \ \ \ \ \ \}} +\DoxyCodeLine{00111\ \ \ \ \ \ \ \ \ \}} +\DoxyCodeLine{00112\ \ \ \ \ \ \ \ \ \textcolor{keywordflow}{if}(minim\ !=\ INT\_MAX\ \&\&\ neigh\ !=\ current)\{} +\DoxyCodeLine{00113\ \ \ \ \ \ \ \ \ \ \ \textcolor{keywordflow}{if}(current\ ==\ start\ ||\ minim\ <=\ nodes[current])\{} +\DoxyCodeLine{00114\ \ \ \ \ \ \ \ \ \ \ \ \ q.push(neigh);} +\DoxyCodeLine{00115\ \ \ \ \ \ \ \ \ \ \ \}} +\DoxyCodeLine{00116\ \ \ \ \ \ \ \ \ \}} +\DoxyCodeLine{00117\ \ \ \ \ \ \ \}} +\DoxyCodeLine{00118\ \ \ \ \ \}} +\DoxyCodeLine{00119\ \ \ \ \ \textcolor{keywordflow}{return}\ \textcolor{keyword}{false};} +\DoxyCodeLine{00120\ \ \ \}} +\DoxyCodeLine{00121\ } +\DoxyCodeLine{00122\ \};} \DoxyCodeLine{00123\ } -\DoxyCodeLine{00124\ \textcolor{preprocessor}{\#endif}} +\DoxyCodeLine{00124\ } +\DoxyCodeLine{00125\ \textcolor{preprocessor}{\#endif}} \end{DoxyCode} diff --git a/tests/machine_learning/search_algorithms/best_first.cc b/tests/machine_learning/search_algorithms/best_first.cc index d4a34f8f..e59fc011 100644 --- a/tests/machine_learning/search_algorithms/best_first.cc +++ b/tests/machine_learning/search_algorithms/best_first.cc @@ -2,6 +2,18 @@ #include "../../../src/machine_learning/search_algorithms/best_first/best_first.h" #include +TEST_CASE("testing edges with insertion for best first class"){ + best_first h; + h.insert_node(0, INT_MAX); + h.insert_node(1, 10); + h.insert_node(2, 20); + h.insert_node(3, 10); + h.add_edge(0, 1); + REQUIRE(h.has_edge(0, 1) == true); + REQUIRE(h.has_edge(0, 3) == false); +} + + TEST_CASE("testing search function for best_first class"){ best_first h; h.insert_node('s', INT_MAX); diff --git a/tests/machine_learning/search_algorithms/hill_climbing.cc b/tests/machine_learning/search_algorithms/hill_climbing.cc index 32d97c19..42afcdf0 100644 --- a/tests/machine_learning/search_algorithms/hill_climbing.cc +++ b/tests/machine_learning/search_algorithms/hill_climbing.cc @@ -2,7 +2,7 @@ #include "../../../src/machine_learning/search_algorithms/hill_climbing/hill_climbing.h" #include -TEST_CASE("testing edges with insertion"){ +TEST_CASE("testing edges with insertion for hill climbing class"){ hill_climbing h; h.insert_node(0, INT_MAX); h.insert_node(1, 10);