1 package org.apache.commons.graph.spanning;
2
3 /*
4 * Licensed to the Apache Software Foundation (ASF) under one
5 * or more contributor license agreements. See the NOTICE file
6 * distributed with this work for additional information
7 * regarding copyright ownership. The ASF licenses this file
8 * to you under the Apache License, Version 2.0 (the
9 * "License"); you may not use this file except in compliance
10 * with the License. You may obtain a copy of the License at
11 *
12 * http://www.apache.org/licenses/LICENSE-2.0
13 *
14 * Unless required by applicable law or agreed to in writing,
15 * software distributed under the License is distributed on an
16 * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
17 * KIND, either express or implied. See the License for the
18 * specific language governing permissions and limitations
19 * under the License.
20 */
21
22 import org.apache.commons.graph.Graph;
23 import org.apache.commons.graph.Vertex;
24 import org.apache.commons.graph.WeightedEdge;
25 import org.apache.commons.graph.WeightedGraph;
26
27 /**
28 * Prim's algorithm is a greedy algorithm that finds a minimum spanning tree for a connected weighted undirected graph.
29 */
30 public final class Prim
31 {
32
33 /**
34 * Calculates the minimum spanning tree (or forest) of the input Graph.
35 *
36 * @param <V> the Graph vertices type.
37 * @param <WE> the Graph weighted edges type.
38 * @param graph the Graph for which minimum spanning tree (or forest) has to be calculated.
39 * @return the minimum spanning tree (or forest) of the input Graph.
40 */
41 public static <V extends Vertex, WE extends WeightedEdge<V>> Graph<V, WE> minimumSpanningTree( WeightedGraph<V, WE> graph )
42 {
43 return null;
44 }
45
46 }