메소드 | 설명 | |
---|---|---|
Graph ( ) : System.Collections.Generic |
constructor that creates an empty graph
|
|
ToString ( ) : string |
get a representation string for the current graph
|
|
checkSimilarity ( |
check similarity between two graphs based on the similarity of nodes and connections between them
|
|
getHighestAccessLevel ( ) : int |
get the highest access level in all the nodes in the graph
|
|
getNodeIndex ( ObstacleTowerGeneration.MissionGraph.Node n ) : int |
get the index of the node in the node array in the graph
|
|
getNumConnections ( ObstacleTowerGeneration.MissionGraph.Node node ) : int |
get number of connections that is connected from that specific node
|
|
getPermutations ( int size ) : List |
get subset of graphs of certain size. This function is used in pattern matching.
|
|
loadGraph ( string filename ) : void |
load a graph from a txt file that is formated in a certain way
|
public checkSimilarity ( |
||
graph | the other graph that the function is checking similarity towards | |
리턴 | bool |
public getNodeIndex ( ObstacleTowerGeneration.MissionGraph.Node n ) : int | ||
n | ObstacleTowerGeneration.MissionGraph.Node | the node needed to find its index |
리턴 | int |
public getNumConnections ( ObstacleTowerGeneration.MissionGraph.Node node ) : int | ||
node | ObstacleTowerGeneration.MissionGraph.Node | the node where the calculation starts from |
리턴 | int |
public getPermutations ( int size ) : List |
||
size | int | the size of the subset graphs |
리턴 | List |
public loadGraph ( string filename ) : void | ||
filename | string | the file path |
리턴 | void |