There are 8 radionodes that can send packet to each other. Nodes randomly distributed in 2d. Packet loss is depends on distance between nodes. Task is to find best routs that connects 1st node with each of rest nodes. Nodes can resend packets.
test1_random_nodes.m - main script, run to display routs
dijkstra.m - auxilary function, find optimal routs with dijkstra's algorithm.
wight_formula.docx - explains wights formula