I've got a small assignment to do on graphs but it's a bit frustrating that no standard algoritms such as Dijkstra, Bellman-Ford, etc. can be used or at least I don't know how could they help.(adsbygoogle = window.adsbygoogle || []).push({});

Given a graph one is to find shortest path through N points. That's it. Starting point can be anything you like just the path must go trough N distinct points where the path itself should be as short as possible. The graph is weighted, undirected.

Simple Greedy algorithm works fine for small inputs but when N gets > 100 then it is useless. I'd like to see it work for N > 1000 in resonable time. Sadly I don't see how any of the well known algorithms could be put into practice here. Any ideas, pointers would be greately apprichiated...

**Physics Forums - The Fusion of Science and Community**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Odd Graph Algorithm assignment

Loading...

Similar Threads - Graph Algorithm assignment | Date |
---|---|

Algorithm for dB vs time graph for one frequency from FFT? | Dec 13, 2016 |

Landmark Algorithm for Graph Isomorphism | Dec 14, 2015 |

Graph theory algorithm | May 17, 2012 |

Algorithm for path in graph | Dec 24, 2007 |

Graph algorithm | Nov 29, 2006 |

**Physics Forums - The Fusion of Science and Community**