import fi.uef.cs.tra.Graph; import fi.uef.cs.tra.Vertex; import java.util.List; public interface TRAII_24_X5 { /** * Heaviest such component of a graph that has a cycle. * Weight of a component is the sum of the weights of the edges of the component. * Finds the heaviest component that has a cycle. If there is no cycle, return Float.NaN. * Otherwise, return weigth of the heaviest component. * The vertices of the component will be stored to result. * @param G input graph * @param result list for the result component * @return weight of the component or Float.NaN if there is no cycle. */ public float heaviestComponentWithCycle(Graph G, List result); }