pert 1.0.1

A PERT algoritm for solving task planning with resource overassignation.
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

#[derive(Debug)]
pub struct Task {
    pub id: u32,
    pub start: u32,
    pub duration: u32,
    pub parent: u32,
}

impl Task {
    pub fn new(id: u32, start: u32, duration: u32, parent: u32) -> Task {
        Task {
            id,
            start,
            duration,
            parent,
        }
    }

    // You can also add methods to the struct
    // fn area(&self) -> u32 {
    //     self.width * self.height
    // }
}

// Implement the Default trait for the struct
impl Default for Task {
    fn default() -> Self {
        Self {
            id: 0,
            start: 0,
            duration: 1,
            parent: 0,
        }
    }
}
#[derive(Debug)]
pub struct Link {
    pub source: u32,
    pub target: u32,
}
impl Link {
    pub fn new(source: u32, target: u32) -> Link {
        Link { source, target }
    }

    // You can also add methods to the struct
    // fn area(&self) -> u32 {
    //     self.width * self.height
    // }
}

pub struct Resource {
    pub id: u32,
}

impl Resource {
    pub fn new(id: u32) -> Resource {
        Resource { id }
    }

    // You can also add methods to the struct
    // fn area(&self) -> u32 {
    //     self.width * self.height
    // }
}