Get started
RicardoSantos

MathSearchDijkstra

RicardoSantos Wizard  
MATH statistics dijkstra graph path search
33
5
math statistics dijkstra graph path search
Library "MathSearchDijkstra"
Shortest Path Tree Search Methods using Dijkstra Algorithm.

min_distance(distances, flagged_vertices) Find the lowest cost/distance.
Parameters:
  • distances: float array, data set with distance costs to start index.
  • flagged_vertices: bool array, data set with visited vertices flags.
Returns: int, lowest cost/distance index.

dijkstra(matrix_graph, dim_x, dim_y, start) Dijkstra Algorithm, perform a greedy tree search to calculate the cost/distance to selected start node at each vertex.
Parameters:
  • matrix_graph: int array, matrix holding the graph adjacency list and costs/distances.
  • dim_x: int, x dimension of matrix_graph.
  • dim_y: int, y dimension of matrix_graph.
  • start: int, the vertex index to start search.
Returns: int array, set with costs/distances to each vertex from start vertexs.

shortest_path(start, end, matrix_graph, dim_x, dim_y) Retrieves the shortest path between 2 vertices in a graph using Dijkstra Algorithm.
Parameters:
  • start: int, the vertex index to start search.
  • end: int, the vertex index to end search.
  • matrix_graph: int array, matrix holding the graph adjacency list and costs/distances.
  • dim_x: int, x dimension of matrix_graph.
  • dim_y: int, y dimension of matrix_graph.
Returns: int array, set with vertex indices to the shortest path.
Pine library

In true TradingView spirit, the author has published this Pine code as an open-source library so that other Pine programmers from our community can reuse it. Cheers to the author! You may use this library privately or in other open-source publications, but reuse of this code in a publication is governed by House Rules.

Disclaimer

The information and publications are not meant to be, and do not constitute, financial, investment, trading, or other types of advice or recommendations supplied or endorsed by TradingView. Read more in the Terms of Use.

Want to use this library?

Copy the following line and paste it in your script.