raphy 1.0.1

A graph data structure library
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88

/*
Copyright 2020 Brandon Lucia <blucia@gmail.com>
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*/

use crate::VtxTrait;

#[derive(Debug)]
pub enum Vertex<T: VtxTrait> {
    V {
        id: u64,
        val: T,
        neigh: Vec<Box<u64>>,
    },
    Empty,
}

impl<T: VtxTrait> Vertex<T> {
    pub fn init(&mut self, new_id: u64, nv: T) {
        match self {
            &mut Vertex::V { .. } => {}
            &mut Vertex::Empty => {
                *self = Vertex::V {
                    id: new_id,
                    val: nv,
                    neigh: vec![],
                };
            }
        }
    }

    pub fn add_neigh(&mut self, n_id: u64) {
        match self {
            &mut Vertex::V { ref mut neigh, .. } => {
                neigh.push(Box::new(n_id));
            }
            Vertex::Empty => return,
        }
    }

    pub fn set_val(&mut self, nv: T) {
        match self {
            Vertex::V { ref mut val, .. } => {
                *val = nv;
            }
            Vertex::Empty => return,
        }
    }

    pub fn get_val(self) -> Option<T> {
        match self {
            Vertex::V { val, .. } => Some(val),
            Vertex::Empty => None,
        }
    }

    pub fn print(&self) {
        match self {
            Vertex::V {
                ref id,
                ref val,
                ref neigh,
            } => {
                let mut s = String::new();
                let f = format!("v{} = {}: [", id, val);
                let fs = &f[..];
                s.push_str(fs);

                for i in 0..neigh.len() {
                    let ff = format!("{},", neigh[i]);
                    let ffs = &ff[..];
                    s.push_str(ffs);
                }

                println!("{}]", s);
            }
            Vertex::Empty => return,
        }
    }
} /*impl Vertex*/