bcds.phison.multfailures
Interface ElemsSequencer<V,E>

All Superinterfaces:

WithEnvParams

All Known Implementing Classes:

ElemsSequencerBase, SequencerBC, SequencerCC, SequencerDegree, SequencerFromFile, SequencerRandom, SequencerSpreaders

public interface ElemsSequencer<V,E>
extends WithEnvParams

ElemsSequencer defines the methods that all graph element sequencers must implement.

Author:

Juan Segovia S.

Method Summary

java.util.List<E>	arrangeDirectedLinks(java.util.Random rnd) Returns the list of all links in the graph, considered as directed, arranged according to some criterion.
java.util.List<V>	arrangeNodes(java.util.Random rnd) Returns the list of all nodes in the graph, arranged according to some criterion.
java.util.List<E>	arrangeUndirectedLinks(java.util.Random rnd) Returns the list of all links in the graph, considered as undirected, arranged according to some criterion.
void	setup(TED<V,E> ted, Environ env) (Re)initializes the sequencer.

Methods inherited from interface bcds.phison.WithEnvParams

getEnviron, getEnvParams, getName

Method Detail

setup

void setup(TED<V,E> ted,
           Environ env)

(Re)initializes the sequencer. Validate the environment parameters and leaves the object as if it has just been instantiated.

Sequencers receive a TED objected instead of simply a graph in order to widen the sources in which to base their sorting decisions. For example, one might need to sort links based on available capacity, or number of connections each one is supporting, etc.

arrangeNodes

java.util.List<V> arrangeNodes(java.util.Random rnd)

Returns the list of all nodes in the graph, arranged according to some criterion. The parameter rnd might be used in case of ties.

arrangeDirectedLinks

java.util.List<E> arrangeDirectedLinks(java.util.Random rnd)

Returns the list of all links in the graph, considered as directed, arranged according to some criterion. The parameter rnd might be used in case of ties.

arrangeUndirectedLinks

java.util.List<E> arrangeUndirectedLinks(java.util.Random rnd)

Returns the list of all links in the graph, considered as undirected, arranged according to some criterion. The parameter rnd might be used in case of ties. The graph considered as undirected contains the set of edges given by g.canonicEdges()