Package ghidra.service.graph
Class GraphType
java.lang.Object
ghidra.service.graph.GraphType
- Direct Known Subclasses:
EmptyGraphType
,ProgramGraphType
Class that defines a new graph type. It defines the set of valid vertex and edge types
-
Constructor Summary
-
Method Summary
Modifier and TypeMethodDescriptionboolean
containsEdgeType
(String edgeType) Test if the given string is a valid edge typeboolean
containsVertexType
(String vertexType) Test if the given string is a valid vertex typeboolean
Returns a description for this type of graphReturns a list of valid edge types for graphs of this typegetName()
Returns a name for this type of graphReturns a list of valid vertex types for graphs of this typeint
hashCode()
-
Constructor Details
-
GraphType
Constructs a new GraphType- Parameters:
name
- the name of this GraphType instancedescription
- a brief description for graphs of this typevertexTypes
- a list of all valid vertex types for graphs of this typeedgeTypes
- a list of all valid edge types for graphs of this type
-
-
Method Details
-
getName
Returns a name for this type of graph- Returns:
- a name of this type of graph
-
getDescription
Returns a description for this type of graph- Returns:
- a description for this type of graph
-
getVertexTypes
Returns a list of valid vertex types for graphs of this type- Returns:
- a list of valid vertex types for graphs of this type
-
getEdgeTypes
Returns a list of valid edge types for graphs of this type- Returns:
- a list of valid edge types for graphs of this type
-
containsVertexType
Test if the given string is a valid vertex type- Parameters:
vertexType
- the string to test for being a valid vertex type- Returns:
- true if the given string is a valid vertex type
-
containsEdgeType
Test if the given string is a valid edge type- Parameters:
edgeType
- the string to test for being a valid edge type- Returns:
- true if the given string is a valid edge type
-
hashCode
public int hashCode() -
equals
-
getOptionsName
-