serialization

src-tauri/src/analytics/algo_result_enums/ap.rs

@@ -1,6 +1,7 @@
+use serde::{Deserialize, Serialize};
 use petgraph::graph::NodeIndex;
 
-#[derive(Debug)]
+#[derive(Debug, Serialize, Deserialize)]
 pub enum APResult {
     Success(Vec<NodeIndex>),
     Error(String),

src-tauri/src/analytics/algo_result_enums/diff_cen.rs

@@ -1,6 +1,7 @@
+use serde::{Deserialize, Serialize};
 use std::collections::HashMap;
 
-#[derive(Debug)]
+#[derive(Debug, Serialize, Deserialize)]
 pub enum DiffCenResult {
     Success(HashMap<String, HashMap<String, f64>>),
     Error(String),

src-tauri/src/analytics/algo_result_enums/mincut.rs

@@ -1,6 +1,7 @@
+use serde::{Deserialize, Serialize};
 use crate::graph::edge::Edge;
 
-#[derive(Debug)]
+#[derive(Debug, Serialize, Deserialize)]
 pub enum MinCutResult {
     Success(Vec<Edge>),
     Error(String),

src-tauri/src/analytics/algo_result_enums/most_sim_timeline.rs

@@ -1,6 +1,7 @@
+use serde::{Deserialize, Serialize};
 use crate::graph::graph_ds::Graph;
 
-#[derive(Debug)]
+#[derive(Debug, Serialize, Deserialize)]
 pub enum MostSimTResult {
     Success(Graph),
     Error(String),

src-tauri/src/analytics/algo_result_enums/pred_state.rs

@@ -1,6 +1,7 @@
+use serde::{Deserialize, Serialize};
 use crate::graph::graph_ds::Graph;
 
-#[derive(Debug)]
+#[derive(Debug, Serialize, Deserialize)]
 pub enum PredStateResult {
     Success(Graph),
     Error(String),

src-tauri/src/analytics/algo_store.rs

@@ -6,6 +6,7 @@ use super::algo_result_enums::mincut::MinCutResult;
 use super::algo_result_enums::most_sim_timeline::MostSimTResult;
 use super::algo_result_enums::pred_state::PredStateResult;
 use crate::graph::graph_ds::Graph;
+use serde::{Deserialize, Serialize};
 
 /// Stores the results of the algorithms.
 ///
@@ -17,7 +18,7 @@ use crate::graph::graph_ds::Graph;
 /// * `most_sim_t` - [`crate::state_err_enums::most_sim_timeline::MostSimTResult`] that stores Success/Error/Empty of most similar timeline algorithm.
 /// * `pred_state` - [`crate::state_err_enums::pred_state::PredStateResult`] that stores Success/Error/Empty of state prediction algorithm.
 
-#[derive(Clone)]
+#[derive(Clone, Serialize, Deserialize)]
 pub struct AlgoStore {
     pub aps: APResult,
     pub mincut: MinCutResult,

src-tauri/src/main.rs

@@ -81,7 +81,8 @@ fn main() {
             update_device_config,
             update_device_user,
             send_waypoint,
-            get_node_edges
+            get_node_edges,
+            run_algorithms
         ])
         .run(tauri::generate_context!())
         .expect("error while running tauri application");