다익스트라 알고리즘 #pragma once#include #include class C_DIJKSTRA{private: struct S_NODE { int nId; std::map child; bool bVisit; S_NODE* pParent; int nLength; bool operator()(S_NODE* Dst, S_NODE* Src) { return Dst->nLength > Src->nLength; } //bool operator()(S_NODE& Dst, S_NODE& Src) //{ //return Dst.nLength > Src.nLength; //} };private: ..