크루스칼 알고리즘#pragma once#include #include class C_KRUSKAL{private: struct S_NODE { char c1; char c2; int nLength; bool operator()(S_NODE s1, S_NODE s2) const { return s1.nLength > s2.nLength; } };private: char m_arParent[127]{}; int m_arNode[127][127]; std::priority_queue, S_NODE> m_heap; char findParent(char c); void setParent(char c, char cParent);public: C_KRUSKAL() = default; void add(..
