Lines Matching full:forest
162 // Compute a degree two constrained Maximum Spanning Tree/forest of
178 // spanning forest, or a collection of linear paths that span the
185 Graph<Vertex>* forest = new Graph<Vertex>();
200 forest->AddVertex(vertex1, graph.VertexWeight(vertex1));
221 // Greedily add edges to the spanning tree/forest as long as they do
231 if ((forest->Neighbors(vertex1).size() == 2) ||
232 (forest->Neighbors(vertex2).size() == 2)) {
250 forest->AddEdge(vertex1, vertex2, edge_weight);
251 forest->AddEdge(vertex2, vertex1, edge_weight);
264 return forest;
