blob: ed9aa2c98b429cdea4f82e58f66b3dcfd6d163f7 [file] [log] [blame]
Thomas Vachuska24c849c2014-10-27 09:53:05 -07001/*
Thomas Vachuska4f1a60c2014-10-28 13:39:07 -07002 * Copyright 2014 Open Networking Laboratory
Thomas Vachuska24c849c2014-10-27 09:53:05 -07003 *
Thomas Vachuska4f1a60c2014-10-28 13:39:07 -07004 * Licensed under the Apache License, Version 2.0 (the "License");
5 * you may not use this file except in compliance with the License.
6 * You may obtain a copy of the License at
Thomas Vachuska24c849c2014-10-27 09:53:05 -07007 *
Thomas Vachuska4f1a60c2014-10-28 13:39:07 -07008 * http://www.apache.org/licenses/LICENSE-2.0
9 *
10 * Unless required by applicable law or agreed to in writing, software
11 * distributed under the License is distributed on an "AS IS" BASIS,
12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13 * See the License for the specific language governing permissions and
14 * limitations under the License.
Thomas Vachuska24c849c2014-10-27 09:53:05 -070015 */
tome3489412014-08-29 02:30:38 -070016package org.onlab.graph;
17
18import java.util.List;
19
20/**
21 * Representation of a path in a graph as a sequence of edges. Paths are
22 * assumed to be continuous, where adjacent edges must share a vertex.
23 *
24 * @param <V> vertex type
25 * @param <E> edge type
26 */
27public interface Path<V extends Vertex, E extends Edge<V>> extends Edge<V> {
28
29 /**
30 * Returns the list of edges comprising the path. Adjacent edges will
31 * share the same vertex, meaning that a source of one edge, will be the
32 * same as the destination of the prior edge.
33 *
34 * @return list of path edges
35 */
36 List<E> edges();
37
38 /**
39 * Returns the total cost of the path as a unit-less number.
40 *
41 * @return path cost as a unit-less number
42 */
43 double cost();
44
45}