Package org.onlab.graph

Class SrlgGraphSearch<V extends Vertex,E extends Edge<V>>

java.lang.Object

org.onlab.graph.AbstractGraphPathSearch<V,E>

org.onlab.graph.SrlgGraphSearch<V,E>

All Implemented Interfaces:

GraphPathSearch<V,E>

public class SrlgGraphSearch<V extends Vertex,E extends Edge<V>>
extends AbstractGraphPathSearch<V,E>

SRLG Graph Search finds a pair of paths with disjoint risk groups; i.e if one path goes through an edge in risk group 1, the other path will go through no edges in risk group 1.

Nested Class Summary

Nested classes/interfaces inherited from class org.onlab.graph.AbstractGraphPathSearch

AbstractGraphPathSearch.DefaultResult

Nested classes/interfaces inherited from interface org.onlab.graph.GraphPathSearch

GraphPathSearch.Result<V extends Vertex,E extends Edge<V>>

Field Summary

Fields inherited from interface org.onlab.graph.GraphPathSearch

ALL_PATHS

Constructor Summary

Constructors

Constructor	Description
SrlgGraphSearch(int groups, Map<E,Integer> grouping)	Creates an SRLG graph search object with the given number of groups and given risk mapping.
SrlgGraphSearch(Map<E,Object> grouping)	Creates an SRLG graph search object from a map, inferring the number of groups and creating an integral mapping.

Method Summary

Modifier and Type	Method	Description
protected GraphPathSearch.Result<V,E>	internalSearch(Graph<V,E> graph, V src, V dst, EdgeWeigher<V,E> weigher, int maxPaths)

Methods inherited from class org.onlab.graph.AbstractGraphPathSearch

checkArguments, search

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

SrlgGraphSearch

public SrlgGraphSearch(int groups,
                       Map<E,Integer> grouping)

Creates an SRLG graph search object with the given number of groups and given risk mapping.

Parameters:

groups - the number of disjoint risk groups

grouping - map linking edges to integral group assignments

SrlgGraphSearch

public SrlgGraphSearch(Map<E,Object> grouping)

Creates an SRLG graph search object from a map, inferring the number of groups and creating an integral mapping.

Parameters:

grouping - map linking edges to object group assignments, with same-group status linked to equality

Method Detail

internalSearch

protected GraphPathSearch.Result<V,E> internalSearch(Graph<V,E> graph,
                                                           V src,
                                                           V dst,
                                                           EdgeWeigher<V,E> weigher,
                                                           int maxPaths)

Specified by:

internalSearch in class AbstractGraphPathSearch<V extends Vertex,E extends Edge<V>>