|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectedu.mit.ll.group43.surfaceoptimization.dp.factory.netgen.CPSNetworkGenerator
public abstract class CPSNetworkGenerator
Constructor Summary | |
---|---|
CPSNetworkGenerator(int cps,
CPSNetworkNodeFactory cpsNetworkNodeFactory,
EdgeValueStrategy edgeValueStrategy)
|
Method Summary | |
---|---|
java.util.ArrayList<java.util.TreeSet<CPSNetworkNode>> |
generateCPSNetworkNodeRelationships(java.util.ArrayList<java.util.TreeSet<CPSNetworkNode>> network)
Adds valid relationships (edges) between the nodes in the given CPS network. |
abstract java.util.ArrayList<java.util.TreeSet<CPSNetworkNode>> |
generateCPSNetworkNodes(java.util.ArrayList<Aircraft> fcfs)
|
java.util.ArrayList<java.util.TreeSet<CPSNetworkNode>> |
generateNetwork(java.util.ArrayList<Aircraft> fcfs)
Generates the CPS network on which the Dynamic Programming algorithm will run to find the shortest path and therefore optimal sequence. |
java.util.HashMap<java.lang.Integer,java.util.ArrayList<java.lang.Integer>> |
getValidLocs(int seqLength)
Creates a HashMap of valid locations for indexes of a FCFS sequence, with respect to CPS. |
java.util.ArrayList<java.util.TreeSet<CPSNetworkNode>> |
markDeadEnds(java.util.ArrayList<java.util.TreeSet<CPSNetworkNode>> network)
Marks all nodes that can't be visited from either (or both) of the starting or ending nodes. |
java.util.ArrayList<java.util.TreeSet<CPSNetworkNode>> |
prune(java.util.ArrayList<java.util.TreeSet<CPSNetworkNode>> network)
Takes in a marked network and removes all nodes and associated edges that have been marked for removal. |
java.util.ArrayList<java.util.TreeSet<CPSNetworkNode>> |
pruneNetwork(java.util.ArrayList<java.util.TreeSet<CPSNetworkNode>> network)
Applies marking and pruning operations to the given network, then returns it. |
Methods inherited from class java.lang.Object |
---|
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
Constructor Detail |
---|
public CPSNetworkGenerator(int cps, CPSNetworkNodeFactory cpsNetworkNodeFactory, EdgeValueStrategy edgeValueStrategy)
Method Detail |
---|
public abstract java.util.ArrayList<java.util.TreeSet<CPSNetworkNode>> generateCPSNetworkNodes(java.util.ArrayList<Aircraft> fcfs)
public java.util.ArrayList<java.util.TreeSet<CPSNetworkNode>> generateNetwork(java.util.ArrayList<Aircraft> fcfs)
fcfs
- public java.util.HashMap<java.lang.Integer,java.util.ArrayList<java.lang.Integer>> getValidLocs(int seqLength)
seqLength
-
public java.util.ArrayList<java.util.TreeSet<CPSNetworkNode>> generateCPSNetworkNodeRelationships(java.util.ArrayList<java.util.TreeSet<CPSNetworkNode>> network)
network
-
public java.util.ArrayList<java.util.TreeSet<CPSNetworkNode>> markDeadEnds(java.util.ArrayList<java.util.TreeSet<CPSNetworkNode>> network)
network
-
public java.util.ArrayList<java.util.TreeSet<CPSNetworkNode>> prune(java.util.ArrayList<java.util.TreeSet<CPSNetworkNode>> network)
network
-
public java.util.ArrayList<java.util.TreeSet<CPSNetworkNode>> pruneNetwork(java.util.ArrayList<java.util.TreeSet<CPSNetworkNode>> network)
network
-
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |