graph.rs

use std::cell::RefCell;
use std::rc::Rc;
use std::collections::LinkedList;

#[derive(Debug, Clone)]
struct VueGraph {
    parent: Vec<Rc<RefCell<VueGraph>>>,
    name: String,
    children: Vec<Rc<RefCell<VueGraph>>>,
}

impl VueGraph {
    fn new(name: String) -> VueGraph {
        let vue_graph = VueGraph {
            parent: Vec::new(),
            name: name.clone(),
            children: Vec::new(),
        };
        vue_graph
    }

    fn add_parent(&mut self, parent: &VueGraph){
        self.parent.push(Rc::new(RefCell::new(parent.clone())));
    }

    fn add_child(&mut self, parent: &VueGraph){
        self.children.push(Rc::new(RefCell::new(parent.clone())));
    }

    fn search(&self) -> LinkedList<VueGraph> {
        let ret: LinkedList<VueGraph> = LinkedList::new();
        println!("{}", self.name);
        for child in &self.children {
            let child = (**child).clone().into_inner().search();
        }
        ret
    }
}

fn main() {
    let mut graph = VueGraph::new(String::from("a"));
    let parent =VueGraph::new(String::from("b"));
    let child =VueGraph::new(String::from("c"));
    graph.add_parent(&parent);
    graph.add_child(&child);
    graph.search();
}