Ошибка в конструкторе: "no matching function for call to"

#include <iostream>
#include <vector>
#include <iterator>
#include <algorithm>
 
struct edge {
    int one;
    int two;
    double mass;
};
 
bool comp(edge one, edge two) {
    return one.mass > two.mass;
};
 
class DSofNude {    
private:
    int amount_of_nudes; 
    std::vector<int> nudes;
    
    void UniteFathers(int one, int two);
    
public:
    DSofNude(int value);
    int Find(int son);
    void Unite(int one, int two);
    bool IsDSIsOne();
};
 
class Graph {
public:
    Graph(int value, std::vector<edge> edgess);
    double FindAnswer();
    
private:
    int amount_of_nodes;
    std::vector<edge> edges;
    DSofNude DSnudes;
    
    double FindAnswerInCout(std::vector<edge>::iterator begin,
     std::vector<edge>::iterator end);
    bool IsGraphCorect(std::vector<edge>::iterator begin,
     std::vector<edge>::iterator end);
};
 
int main() {
    int nudes, edg;
    std::cin >> nudes >> edg;
    
    std::vector<edge> edges;
    edge example;
    for(int i = 0; i < edg; ++i) {
        std::cin >> example.one >> example.two >> example.mass;
        edges.push_back(example);
    }
    
    Graph graph = Graph(nudes, edges);
    std::cout << graph.FindAnswer();
    return 0;
}
 
DSofNude::DSofNude(int value) {
    amount_of_nudes = value;
    for(int i = 0; i < amount_of_nudes; ++i) {
        nudes.push_back(i);
    }
}
 
int DSofNude::Find(int son) {
    int father = son;
    while(father != nudes[father]) {
        father = nudes[father];
    }
    nudes[son] = father;
    
    return father;
}
 
void DSofNude::Unite(int one, int two) {
    UniteFathers(Find(one), Find(two));
}
 
bool DSofNude::IsDSIsOne() {
    int set = Find(0);
    for(int i = 1; i < amount_of_nudes; ++i) {
        if (set != Find(i)) {
            return false;
        }
    }
    
    return true;
}
 
void DSofNude::UniteFathers(int one, int two) {
    nudes[one] = two;
}
 
Graph::Graph(int value, std::vector<edge> edgess) {
    DSnudes = DSofNude(value);
    amount_of_nodes = value;
    edges = edgess;
}
 
double Graph::FindAnswer() {
    std::sort(edges.begin(), edges.end(), comp);
    return FindAnswerInCout(edges.begin(), edges.end());
}
 
double Graph::FindAnswerInCout(std::vector<edge>::iterator begin,
 std::vector<edge>::iterator end) {
    if (begin + 1 == end) { 
        if (IsGraphCorect(begin, end)) {
            return  begin->mass;
        } else {
            return -1; 
        }
    }
    
    std::vector<edge>::iterator mediana = begin + (end - begin) / 2;
    if (IsGraphCorect(begin, mediana)) {
        return FindAnswerInCout(begin, mediana);
    } else {
        return FindAnswerInCout(mediana, end);
    }
}
 
bool Graph::IsGraphCorect(std::vector<edge>::iterator begin,
std::vector<edge>::iterator end) {
    DSofNude ds = DSnudes;
    while(begin < end) {
        ds.Unite(begin->one, begin->two);
        ++begin;
    }
    
    bool answer = ds.IsDSIsOne();
    if (!answer) {
        DSnudes = ds;  
    }
    return answer;
}

class DSofNude {    
private:
    int amount_of_nudes; 
    std::vector<int> nudes;
    
    void UniteFathers(int one, int two);
    
public:
    DSofNude(int value);  //<----------------------------- с параметром
    int Find(int son);
    void Unite(int one, int two);
    bool IsDSIsOne();
};

class Graph {
public:
    Graph(int value, std::vector<edge> edgess);
    double FindAnswer();
    
private:
    int amount_of_nodes;
    std::vector<edge> edges;
    DSofNude DSnudes;  //<------------------ как прикажите компилятору его строить?
    
    double FindAnswerInCout(std::vector<edge>::iterator begin,
     std::vector<edge>::iterator end);
    bool IsGraphCorect(std::vector<edge>::iterator begin,
     std::vector<edge>::iterator end);
};

Graph::Graph(int value, std::vector<edge> edgess) {
    DSnudes = DSofNude(value);
    amount_of_nodes = value;
    edges = edgess;
}

Graph::Graph(int value, std::vector<edge> edgess)
    :DSnudes( DSofNude(value) )
    ,amount_of_nodes(value)
    ,edges(edgess)
{}