| java.lang.Object | |
| ↳ | org.apache.helix.model.builder.StateTransitionTableBuilder |
Summary
| Public Constructors | |||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|
| Public Methods | |||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|
Uses floyd-warshall algorithm, shortest distance for all pair of nodes
Allows one to lookup nextState given fromState,toState
map.get(fromState).get(toState) --> nextState | |||||||||||
auxiliary method to get next state based on next map
| |||||||||||
|
[Expand]
Inherited Methods | |||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|
From class
java.lang.Object
| |||||||||||
Public Constructors
public StateTransitionTableBuilder ()
Public Methods
public Map<String, Map<String, String>> buildTransitionTable (List<String> states, List<Transition> transitions)
Uses floyd-warshall algorithm, shortest distance for all pair of nodes
Allows one to lookup nextState given fromState,toState
map.get(fromState).get(toState) --> nextState
Returns
- next map
public static String getNext (Map<String, Map<String, String>> next, String fromState, String toState)
auxiliary method to get next state based on next map
Returns
- nextState or null if doesn't exist a path