README.en.md · Secure_DisOpt&Cont/基于交替方向乘子法的VRPTW问题分解模式

# Dijkstras

#### Description
最小路径设计
(The path from a vertex of a graph to another vertex that has the smallest sum of the weights of the edges it passes through is called the shortest path)

#### Software Architecture
Software architecture description

#### Installation

To install the most recent package from Python Package Index (PyPi), use git:

`pip install dijkstra`

To install the development version, you can install the package directly from the GitHub:

`pip install git+git://github.com/ahojukka5/dijkstra.git`

#### Instructions

1.  xxxx
2.  xxxx
3.  xxxx

#### Contribution

1.  Fork the repository
2.  Create Feat_xxx branch
3.  Commit your code
4.  Create Pull Request

#### Gitee Feature

1.  You can use Readme\_XXX.md to support different languages, such as Readme\_en.md, Readme\_zh.md
2.  Gitee blog [blog.gitee.com](https://blog.gitee.com)
3.  Explore open source project [https://gitee.com/explore](https://gitee.com/explore)
4.  The most valuable open source project [GVP](https://gitee.com/gvp)
5.  The manual of Gitee [https://gitee.com/help](https://gitee.com/help)
6.  The most popular members  [https://gitee.com/gitee-stars/](https://gitee.com/gitee-stars/)

####  Djikstra's algorithm pseudocode
1. Maintain the path distance of every vertex and store that in an array of size v, where v is the number of vertices.
2. Map each vertex to the vertex that last updated its path length, to be able to get the shortest path.
3. Once the algorithm is over, backtrack from the destination vertex to the source vertex to find the path.
4. A minimum priority queue can be used to efficiently receive the vertex with least path distance.

Secure_DisOpt&Cont/基于交替方向乘子法的VRPTW问题分解模式

简介

发行版

贡献者

近期动态

Secure_DisOpt&Cont/基于交替方向乘子法的VRPTW问题分解模式 .gitee-modal { width: 500px !important; }

简介

发行版

贡献者

近期动态

搜索帮助

Secure_DisOpt&Cont/基于交替方向乘子法的VRPTW问题分解模式