메소드 | 설명 | |
---|---|---|
CreateHierarchicalMap ( |
||
InsertAbstractNode ( |
||
RemoveAbstractNode ( |
메소드 | 설명 | |
---|---|---|
AddEdgesBetweenAbstractNodes ( |
Adds an edge between two abstract nodes for a given level
|
|
CreateAbstractNodes ( List |
||
CreateEdges ( List |
||
CreateEntranceEdges ( |
||
CreateEntrancesAndClusters ( List |
||
CreateHierarchicalEdges ( ) : void | ||
CreateHorizEntrances ( int x0, int x1, int y, int clusterid1, int clusterid2, int currId, int &nextId ) : List |
Creates the horizontal entrances between the two clusters, and returns the last entrance id
|
|
CreateInterClusterEdges ( |
||
CreateVertEntrances ( int y0, int y1, int x, int clusterid1, int clusterid2, int currId, int &lastEntraceId ) : List |
||
DetermineLevel ( int y ) : int | ||
GenerateAbstractNodes ( List |
Create the asbtract nodes of this graph (composed by the centers of the entrances between clusters)
|
|
GetCluster ( List |
||
GetEntrancePointLevel ( |
||
InsertStal ( |
||
InsertStalHEdges ( |
Inserts a node and creates edges around the local points of the cluster it the node we try to insert belongs to at each level
|
|
IsValidAbstractNode ( |
public CreateHierarchicalMap ( |
||
concreteMap | ||
clusterSize | int | |
maxLevel | int | |
style | EntranceStyle | |
리턴 | void |
public InsertAbstractNode ( |
||
map | ||
pos | ||
start | int | |
리턴 | int |
public RemoveAbstractNode ( |
||
map | ||
nodeId | int | |
stal | int | |
리턴 | void |