Implement Signal Algorithm

[HolyBarrel]

Implement Dijkstras Algorithm to run based on a node arrangement

[HolyBarrel]

Changed to BFS or something the like

[HolyBarrel]

let mut node1 = Node::new(0, 0);
print!("EHLLOE\n");
print!("{} \n", node1.get_coor().0.to_string().as_str());

print!("{} \n", node1.get_coor().1.to_string().as_str());

print!("{} \n", node1.adj_positions()[0].0.to_string().as_str());

print!("EHLLOE\n");

//Prints all adjacent nodes positions
for i in 0..node1.adj_positions().len() {
    print!("X: ");
    print!("{} \n", node1.adj_positions()[i].0.to_string().as_str());
    print!("Y: ");
    print!("{} \n", node1.adj_positions()[i].1.to_string().as_str());
}

let mut node2 = Node::new(50, 50);
print!("EHLLOE\n");
print!("{} \n", node2.get_coor().0.to_string().as_str());

print!("{} \n", node2.get_coor().1.to_string().as_str());

print!("{} \n", node2.adj_positions()[0].0.to_string().as_str());

print!("EHLLOE\n");

//Prints all adjacent nodes positions
for i in 0..node2.adj_positions().len() {
    print!("X: ");
    print!("{} \n", node2.adj_positions()[i].0.to_string().as_str());
    print!("Y: ");
    print!("{} \n", node2.adj_positions()[i].1.to_string().as_str());
}