public interface StateFlowGraph
StateVertex as vertexes and Eventable as
edges. ======= A graph with StateVertex as vertexes and Eventable as edges.
>>>>>>> Stashed changes| Modifier and Type | Method and Description |
|---|---|
boolean |
canGoTo(StateVertex source,
StateVertex target)
Is it possible to go from s1 -> s2?
|
com.google.common.collect.ImmutableSet<Eventable> |
getAllEdges()
Return all the edges in the StateFlowGraph.
|
List<List<org.jgrapht.GraphPath<StateVertex,Eventable>>> |
getAllPossiblePaths(StateVertex index)
This method returns all possible paths from the index state using the Kshortest paths.
|
com.google.common.collect.ImmutableSet<StateVertex> |
getAllStates()
Return all the states in the StateFlowGraph.
|
StateVertex |
getById(int id) |
com.google.common.collect.ImmutableSet<Eventable> |
getIncomingClickable(StateVertex stateVertix)
Returns a set of all edges incoming into the specified vertex.
|
StateVertex |
getInitialState() |
int |
getMeanStateStringSize() |
int |
getNumberOfStates() |
com.google.common.collect.ImmutableSet<Eventable> |
getOutgoingClickables(StateVertex stateVertix)
Returns a set of all clickables outgoing from the specified vertex.
|
com.google.common.collect.ImmutableSet<StateVertex> |
getOutgoingStates(StateVertex stateVertix) |
com.google.common.collect.ImmutableList<Eventable> |
getShortestPath(StateVertex start,
StateVertex end)
Convenience method to find the Dijkstra shortest path between two states on the graph.
|
StateVertex getById(int id)
id - The ID of the statenull.StateVertex getInitialState()
com.google.common.collect.ImmutableSet<Eventable> getOutgoingClickables(StateVertex stateVertix)
stateVertix - the state vertix.DirectedGraph.outgoingEdgesOf(Object)com.google.common.collect.ImmutableSet<Eventable> getIncomingClickable(StateVertex stateVertix)
stateVertix - the state vertix.DirectedGraph.incomingEdgesOf(Object)boolean canGoTo(StateVertex source, StateVertex target)
source - the source state.target - the target state.com.google.common.collect.ImmutableList<Eventable> getShortestPath(StateVertex start, StateVertex end)
start - the start state.end - the end state.com.google.common.collect.ImmutableSet<StateVertex> getAllStates()
com.google.common.collect.ImmutableSet<Eventable> getAllEdges()
int getMeanStateStringSize()
int getNumberOfStates()
List<List<org.jgrapht.GraphPath<StateVertex,Eventable>>> getAllPossiblePaths(StateVertex index)
index - the initial state.com.google.common.collect.ImmutableSet<StateVertex> getOutgoingStates(StateVertex stateVertix)
stateVertix - The source StateVertexSet of StateVertex that are connected to the source
StateVertex via one of the sources outgoing edges.Copyright © 2007-2013. All Rights Reserved.