Given: A completely connected directed acyclic graph.What would be the most efficient(Least Time complexity) way to find a shortest path among a very large number of nodes?Constraint:1)The result should be optimal.2) The cost between any two connected nodes is computed in time complexity of O(layer-no). For, e.g., if we consider the graph to be layered(Since its a DAG) then the cost between Layer 'K-1' & 'K' can be computed in a time complexity of O(K)Known Solutions:1) A* - But heavily dependent on the heuristic function2) Dynamic programming - requires to compute the cost of path for all possible path.   So, Is there any way to compute it more efficiently or with similar time complexity?
Shortest Path problem(Single Source&Destination)
algorithms;graphs;shortest path