

 Thread Tools  Search this Thread 
#1
 
 
The shortest path in a directed graph, Dijkstra algorithm I'm looking for a java algorithm to find the shortest path in a directed graph from the vertex 1 to vertex n and through k vertices. This last condition that I have a problem. I thought of course use the Dijkstra algorithm. What do you think? And how to modify it to pass through k vertices? 
#2
 
 
Re: The shortest path in a directed graph, Dijkstra algorithm When you say "going through k vertices," you mean that you are looking for a path from a vertex of v and going to another vertex of x and size at least k, or from v to x and passing through at least each vertex of a K? 
#3
 
 
Re: The shortest path in a directed graph, Dijkstra algorithm I want to find the path from the vertex s to vertex t and through k distinct vertices. That is, it must impose an exact number of k vertices. 
#4
 
 
Re: The shortest path in a directed graph, Dijkstra algorithm In this case, make a journey of your graph in Dijkstra and instead store the shortest path for each vertex, remember all the paths leading to the vertex with their length in terms of distinct nodes. 

Tags: algorithm, dijkstra, graph, shortest path 
Thread Tools  Search this Thread 

Similar Threads for: "The shortest path in a directed graph, Dijkstra algorithm"  
Thread  Thread Starter  Forum  Replies  Last Post 
Adobe reader close by DEP when directed to print  Yogisa  Windows Software  4  16092011 12:09 AM 
SandyBridge mainboard support Intel VTd Technology Directed I/O  Lyudmyla  Motherboard Processor & RAM  6  16072011 10:18 AM 
Keep being directed to random sites from google such as adcloudmedia.com  miketaylor05  Windows Software  6  04062010 12:15 AM 
Change Default Windows Installation Path to Your Desired Path  phones  Tips & Tweaks  0  23032009 11:32 PM 
Open Shortest Path First and Integrated Services Digital Network backup  Fenton  Networking & Security  3  11112008 06:19 PM 