最短路径Dijkstra算法源码

Dijkstra算法源码

---

Dijkstra.h文件源码

#pragma once
#include "stdafx.h"
#include <vector>
using namespace std;
//arcs中arcs[i][j] < 0,表示不可达
class Dijkstra
{
private:
    int _num;
    float** _arcs;
    float* _dis;
    int* _pre;
    bool* _used;
public:
    Dijkstra(float** arcs, int num);
    void Dijkstra::FindPath(int s, int t, vector<int>& route,float& pathLen);
};

Dijkstra.cpp源码

#include "stdafx.h"
#include "Dijkstra.h"
#include <limits> 
Dijkstra::Dijkstra(