class Graph {
constructor(vertexSize) {
this.vertexSize = vertexSize;
this.vertex = new Array(vertexSize);
this.edges = new Array(vertexSize).fill(0).map(() => new Array(vertexSize).fill(0));
}
}
class Tree {
createGraph(graph, vertexSize, vertex, edges) {
for (let i = 0; i < vertexSize; i++) {
graph.vertex[i] = vertex[i];
for (let j = 0; j < vertexSize; j++) {
graph.edges[i][j] = edges[i][j];
}
}
}
showGraph(graph) {
for (const edge of graph.edges) {
console.log(edge.join(‘,’));
}
}
greedy(graph, startVertex) {
const n = graph.vertexSize;
const distances = new Array(n).fill(Number.MAX_VALUE);
const visited = new Array(n).fill(false);
distances[startVertex] = 0;
const prevVertex &#