Great work.......help me to solve my problem....
i have to find the shortest path from source to destination by considering minimum loss of packets,delay ,bandwidth utilization and weight into account........just hint me what to do by GA..
have u known link related to my work.
thanking you
Great code works perfectly for my problem which was a small matrix (47x47) and didn't have much node connection redundancy. I had lots of issues with the dijkstra algorithms which kept returning 'inf' results - although I suspect connection redundancy was the issue here.