blob: 6b13e6e23cf83049368379420290f9026dfe019e [file] [log] [blame]
package org.apache.commons.graph.shortestpath;
/*
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you under the Apache License, Version 2.0 (the
* "License"); you may not use this file except in compliance
* with the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing,
* software distributed under the License is distributed on an
* "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
* KIND, either express or implied. See the License for the
* specific language governing permissions and limitations
* under the License.
*/
import static org.apache.commons.graph.utils.Assertions.checkNotNull;
import org.apache.commons.graph.Graph;
import org.apache.commons.graph.Mapper;
public final class DefaultWeightedEdgesSelector<V, WE>
implements PathWeightedEdgesBuilder<V, WE>
{
private final Graph<V, WE> graph;
public DefaultWeightedEdgesSelector( Graph<V, WE> graph )
{
this.graph = graph;
}
public <W, M extends Mapper<WE, W>> PathSourceSelector<V, WE, W> whereEdgesHaveWeights( M weightedEdges )
{
weightedEdges = checkNotNull( weightedEdges, "Function to calculate edges weight can not be null." );
return new DefaultPathSourceSelector<V, WE, W>( graph, weightedEdges );
}
}