14 void initializeGraph();
18 void permutation(
int array[],
int size,
int n,
double sum);
19 void walkThePath(
int *array);
33 int numVertices = V = other.V;
34 graph =
new double *[numVertices];
36 for (
size_t i = 0; i < numVertices; i++)
38 graph[i] =
new double[numVertices];
39 memcpy(graph[i], other.graph[i],
sizeof(
double) * numVertices);
bool edgeExist(int x, int y)
Definition: graph.cpp:127
void print()
Definition: graph.cpp:94
int getV()
Definition: graph.cpp:87
void createLigation(int x, int y, double weight)
Definition: graph.cpp:76
double ** getGraph()
Definition: graph.cpp:89
void newRandomGraph()
Definition: graph.cpp:111
Graph()
Definition: graph.cpp:12
Graph & operator=(const Graph &other)
Definition: graph.h:29
~Graph()
Definition: graph.cpp:29