blob: 4ef6e6d2f55fa7c219adad2d37d4314fcf726f13 [file] [log] [blame]
Thomas Vachuska24c849c2014-10-27 09:53:05 -07001/*
Brian O'Connor5ab426f2016-04-09 01:19:45 -07002 * Copyright 2014-present 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
18/**
19 * Representation of a graph search algorithm and its outcome.
20 *
21 * @param <V> vertex type
22 * @param <E> edge type
23 */
24public interface GraphSearch<V extends Vertex, E extends Edge<V>> {
25
26 /**
27 * Notion of a graph search result.
28 */
Sho SHIMIZU3310a342015-05-13 12:14:05 -070029 interface Result<V extends Vertex, E extends Edge<V>> {
tome3489412014-08-29 02:30:38 -070030 }
31
32 /**
33 * Searches the specified graph.
34 *
35 * @param graph graph to be searched
36 * @param weight optional edge-weight; if null cost of each edge will be
37 * assumed to be 1.0
38 *
39 * @return search results
40 */
41 Result search(Graph<V, E> graph, EdgeWeight<V, E> weight);
42
43}