import fi.uef.cs.tra.Graph;
import fi.uef.cs.tra.Vertex;

import java.util.List;

public interface TRAII_25_X5 {

    /**
     *
     * All simple (non-cyclic) paths from given vertex with maximum weight.
     * Result is a list of paths, where each path is a list of vertices.
     * A path has at least two vertices. The weight of a path is the sum
     * of the weights of the edges of the path.
     * Path has no edges with negative weight.
     *
     * @param G     input graph
     * @param start starting vertex
     * @param maxWeight   maximum weight of the paths
     * @return list of paths
     */
    public List<List<Vertex>> allMaxPPaths(Graph G, Vertex start, float maxWeight);
}