Vertex

All Known Implementing Classes:

BasicVertex
```
public interface Vertex
```
Represents a piece of knowledge. Vertex is a very simple structure mainly comprised of its relationships, this gives the system a very simple and extendable structure. Basic implementation to allow subclasses to avoid defining some of the basic stuff. The data attribute allows for vertices that represents something tangible such as text, sound, image, number, etc. The data is also indexed within a network, so is the only guaranteed way to lookup an existing vertex.

Method Summary

All Methods Instance Methods Abstract Methods
Modifier and Type	Method and Description
`Relationship`	`addRelationship(Primitive type, Primitive target)` Add the relation of the relationship primitive type to the target primitive.
`Relationship`	`addRelationship(Primitive type, Primitive target, int index)` Add the relation of the relationship type to the target vertex.
`Relationship`	`addRelationship(Primitive type, Vertex target)` Add the relation of the relationship primitive type to the target vertex.
`Relationship`	`addRelationship(Primitive type, Vertex target, int index)` Add the relation of the relationship type to the target vertex.
`Relationship`	`addRelationship(Relationship relationship, boolean internal)` Add the relation ensuring uniqueness.
`Relationship`	`addRelationship(Vertex type, Vertex target)` Add the relation of the type to the other vertex.
`Relationship`	`addRelationship(Vertex type, Vertex target, int index)` Add the relation of the relationship type to the target vertex.
`Relationship`	`addRelationship(Vertex type, Vertex target, int index, boolean internal)` Add the relation of the type to the other vertex.
`Relationship`	`addWeakRelationship(Primitive type, Primitive target, float correctnessMultiplier)` Add the relation of the relationship type to the target vertex.
`Relationship`	`addWeakRelationship(Primitive type, Vertex target, float correctnessMultiplier)` Add the relation of the relationship type to the target vertex.
`Relationship`	`addWeakRelationship(Vertex type, Vertex target, float correctnessMultiplier)` Add the relation of the relationship type to the target vertex.
`java.util.Iterator<Relationship>`	`allRelationships()` Provides an easier method of traversing all the relations of a vertex.
`Relationship`	`appendRelationship(Primitive type, Vertex target)` Add the relation of the relationship type to the end of the target vertex relationships.
`Relationship`	`appendRelationship(Vertex type, Vertex target)` Add the relation of the relationship type to the end of the target vertex relationships.
`Vertex`	`applyEval(java.util.Map<Vertex,Vertex> variables, Network network)` Evaluates any eval functions in the equation or formula..
`Vertex`	`applyQuotient(java.util.Map<Vertex,Vertex> variables, Network network)` Apply the quotient.
`void`	`associateAll(Primitive relationshipType, Vertex target, Primitive type)` Associate each of the relationship target vertices with the target vertex by the type.
`void`	`associateAll(Vertex relationshipType, Vertex target, Vertex type)` Associate each of the relationship target vertices with the target vertex by the type.
`boolean`	`collectMatches(Vertex vertex, java.util.Map<Vertex,java.util.Set<Vertex>> matches)` Compare if the two vertices match.
`Vertex`	`copy()` Create a copy of the vertex with all of the same relationships.
`void`	`decrementConsciousnessLevel()` Decrease the vertices's level of consciousness.
`void`	`decrementConsciousnessLevel(int amount)` Decrease the vertices's level of consciousness by the amount.
`java.lang.String`	`description()` Return a short toString, or header of the vertex.
`Vertex`	`detach()` Create a copy of the vertex with only the id.
`java.lang.String`	`displayString()` User friendly toString.
`boolean`	`equalsIgnoreCase(Vertex vertex)` Compare the vertices ignoring case.
`void`	`fixRelationships(Vertex type)` Fix the corrupted relationship index order.
`int`	`getAccessCount()` Return the number of times the vertex has been accessed.
`java.util.Date`	`getAccessDate()` Return the date the vertex was last accessed.
`java.util.Collection<Relationship>`	`getAllRelationships()` Return all of the relationships.
`Vertex`	`getAssoiate(Vertex type, Vertex associate, Vertex associateType)` Return the target vertex related by the type, that has the relationship to the previous, otherwise null if not found.
`Vertex`	`getAssoiate(Vertex type, Vertex associate, Vertex associateType, java.util.Collection<Relationship> associate2, Vertex associateType2, java.util.Collection<Relationship> associate3, Vertex associateType3, Vertex defaultAssociate)` Return the target vertex related by the type, that has the relationship to the previous, otherwise null if not found.
`Vertex`	`getAssoiate(Vertex type, Vertex associate, Vertex associateType, Vertex defaultAssociate)` Return the target vertex related by the type, that has the relationship to the previous, otherwise null if not found.
`Vertex`	`getAssoiate(Vertex type, Vertex associate, Vertex associateType, Vertex associate2, Vertex associateType2)` Return the target vertex related by the type, that has the relationship to the previous, otherwise null if not found.
`Vertex`	`getAssoiate(Vertex type, Vertex associate, Vertex associateType, Vertex associate2, Vertex associateType2, java.util.Collection<Relationship> associate3, Vertex associateType3, Vertex defaultAssociate)` Return the target vertex related by the type, that has the relationship to the previous, otherwise null if not found.
`Vertex`	`getAssoiate(Vertex type, Vertex associate, Vertex associateType, Vertex associate2, Vertex associateType2, Vertex associate3, Vertex associateType3)` Return the target vertex related by the type, that has the relationship to the previous, otherwise null if not found.
`int`	`getConsciousnessLevel()` Return the vertices's level of consciousness.
`java.util.Date`	`getCreationDate()` Return the date the vertex was created.
`java.lang.Object`	`getData()` Allows some piece of data to be associated with the vertex.
`java.lang.String`	`getDataType()` Return the String name of the data's type.
`java.lang.String`	`getDataValue()` Return the String value of the data.
`long`	`getGroupId()` Return group id of script.
`java.lang.Long`	`getId()` Unique id for the vertex.
`java.lang.String`	`getName()` Return the name of the vertex.
`Network`	`getNetwork()` Return the network the vertex is derived from.
`Vertex`	`getRelationship(Primitive type)` Return any relationship target of the primitive type.
`Relationship`	`getRelationship(Primitive type, Primitive target)` Return the relationship to the target of the primitive type.
`Relationship`	`getRelationship(Primitive type, Vertex target)` Return the relationship to the target of the primitive type.
`Vertex`	`getRelationship(Vertex type)` Return any relationship target of the type.
`Relationship`	`getRelationship(Vertex type, Vertex target)` Return the relationship to the target of the primitive type.
`java.util.Map<Vertex,java.util.Map<Relationship,Relationship>>`	`getRelationships()` Return all relationships.
`java.util.Collection<Relationship>`	`getRelationships(Primitive type)` Return any relationship target of the primitive type.
`java.util.Collection<Relationship>`	`getRelationships(Vertex relationshipType)` Return all relationships of the type.
`int`	`getWordCount()` Return word count for a sentence.
`boolean`	`hasAnyAssociatedInverseRelationship(Primitive associate, Vertex target, Primitive type)` Return if any of the associates of the vertex have an inverse/negative relationship of the type to the target.
`boolean`	`hasAnyAssociatedInverseRelationship(Vertex associate, Vertex target, Vertex type)` Return if any of the associates of the vertex have an inverse/negative relationship of the type to the target.
`boolean`	`hasAnyRelationshipToTarget(Vertex target)` Return if the vertex has any relationship to any target.
`boolean`	`hasAnyRelationshipToTargetOfType(Vertex classification)` Return if the vertex has any relationship to any target that is an instantiation of the classification.
`boolean`	`hasAnyResponseRelationship()` PERF: Used to check response without accessing relationships.
`boolean`	`hasData()` Most pure knowledge vertices have no data, this provides an easy test method.
`boolean`	`hasInverseRelationship(Primitive type, Primitive target)` Return if the vertex has an inverse/negative relationship of the type to the target.
`boolean`	`hasInverseRelationship(Primitive type, Vertex target)` Return if the vertex has an inverse/negative relationship of the type to the target.
`boolean`	`hasInverseRelationship(Vertex type, Vertex target)` Return if the vertex has an inverse/negative relationship of the type to the target.
`boolean`	`hasName()` Some vertices have no name, this provides an easy test method.
`boolean`	`hasOrInheritsInverseRelationship(Vertex type, Vertex target)` Return if the vertex has an inverse/negative relationship of the type to the target.
`boolean`	`hasOrInheritsInverseRelationship(Vertex type, Vertex target, java.util.Map<Vertex,Vertex> recursion)` Return if the vertex has an inverse/negative relationship of the type to the target.
`boolean`	`hasOrInheritsRelationship(Vertex type, Vertex target)` Return if the vertex has a relationship of the type to the target.
`boolean`	`hasOrInheritsRelationship(Vertex type, Vertex target, java.util.Map<Vertex,Vertex> recursion)` Return if the vertex has a relationship of the type to the target.
`boolean`	`hasRelationship(Primitive type)` Return if the vertex has a relationship of the type primitive.
`boolean`	`hasRelationship(Primitive type, Primitive target)` Return if the vertex has a relationship of the type primitive to the target primitive.
`boolean`	`hasRelationship(Primitive type, Vertex target)` Return if the vertex has a relationship of the type primitive to the target.
`boolean`	`hasRelationship(Vertex type)` Return if the vertex has any relationship of the type.
`boolean`	`hasRelationship(Vertex type, Vertex target)` Return if the vertex has a relationship of the type to the target.
`boolean`	`hasRelationships()` Return if the relationships have been instantiated.
`void`	`incrementAccessCount()` Record that the vertex was accessed, update the access time and increment the access count.
`void`	`incrementConsciousnessLevel()` Increase the vertices's level of consciousness.
`void`	`incrementConsciousnessLevel(int amount)` Increase the vertices's level of consciousness by the amount.
`void`	`init()`
`boolean`	`instanceOf(Primitive type)` Return if the vertex is an instantiation of the primitive type.
`boolean`	`instanceOf(Vertex type)` Return if the vertex is an instantiation of the type.
`boolean`	`internalHasRelationship(Vertex type, Vertex target)` Return if the vertex has a relationship of the type to the target.
`void`	`internalRemoveAllRelationships()` Remove all relationships.
`void`	`internalRemoveRelationship(Primitive type, Primitive target)` Remove the relation.
`void`	`internalRemoveRelationship(Relationship relationship)` Remove the relation.
`void`	`internalRemoveRelationship(Vertex type, Vertex target)` Remove the relation.
`void`	`internalRemoveRelationships(Primitive type)` Remove the relationships of the type.
`void`	`internalRemoveRelationships(Vertex type)` Remove the relationships of the type.
`void`	`inverseAssociateAll(Primitive relationshipType, Vertex source, Primitive type)` Dissociate each of the relationship target vertices with the target vertex by the type.
`void`	`inverseAssociateAll(Vertex relationshipType, Vertex source, Vertex type)` Dissociate each of the relationship target vertices with the target vertex by the type.
`boolean`	`is(java.lang.Object data)` Return if the vertex is the vertex for the data.
`boolean`	`isArray()` Return if the vertex is an array.
`boolean`	`isDirty()` Return the the vertex has exceeded it relationships maximum.
`boolean`	`isEquation()` Return if the vertex is an equation.
`boolean`	`isPinned()` Return if the vertex is pinned to memory, and will not be forgotten.
`boolean`	`isPrimitive()` Return if the vertex is a system primitive.
`boolean`	`isTemporary()` Return if the vertex is temporary, and not persistent.
`boolean`	`isVariable()` Return if the vertex is a variable.
`void`	`iterate(VertexIterator iterator)` Iterator over all related vertices to the vertex.
`Vertex`	`lastRelationship(Primitive type)` Return the last of the ordered relationship, or null.
`Vertex`	`lastRelationship(Primitive type, int fromLast)` Return the fromLast last of the ordered relationship, or null.
`Vertex`	`lastRelationship(Vertex type)` Return the last of the ordered relationship, or null.
`Vertex`	`lastRelationship(Vertex type, int fromLast)` Return the fromLast last of the ordered relationship, or null.
`java.lang.Boolean`	`matches(Vertex vertex, java.util.Map<Vertex,Vertex> matches)` Compare if the two vertices match.
`Vertex`	`mostConscious(Primitive type)` Return the target vertex related by the type, with the high consciousness level.
`Vertex`	`mostConscious(Primitive type, float min)` Return the target vertex related by the type, with the high consciousness level and correctness greater than the value.
`Vertex`	`mostConscious(Vertex type)` Return the target vertex related by the type, with the high consciousness level.
`Vertex`	`mostConscious(Vertex type, float min)` Return the target vertex related by the type, with the high consciousness level greater than the value.
`Vertex`	`mostConscious(Vertex type, float min, boolean inverse)` Return the target vertex inversely/negatively related by the type, with the high consciousness level.
`Vertex`	`mostConscious(Vertex type, Vertex classification)` Return the target vertex related by the type, of the classification, with the high consciousness level.
`Relationship`	`mostConsciousRelationship(Primitive type)` Return the relationship related by the type, with the high consciousness level.
`Relationship`	`mostConsciousRelationship(Primitive type, float min)` Return the relationship related by the type, with the high consciousness level and correctness greater than the value.
`Relationship`	`mostConsciousRelationship(Vertex type)` Return the relationship related by the type, with the high consciousness level.
`Vertex`	`mostConsciousTargetOfType(Vertex classification)` Return the most conscious target the vertex has any relationship to that is an instantiation of the classification.
`Vertex`	`mostConsciousWithAssoiate(Vertex type, Vertex associate, Vertex associateType)` Return the target vertex related by the type, that is also most correctly related to the associate vertex by the relationship.
`Vertex`	`mostConsciousWithAssoiates(Vertex type, Vertex associate, Vertex associateType, Vertex associate2, Vertex associateType2)` Return the target vertex related by the type, that is also most correctly related to the associate vertex by the relationship.
`Vertex`	`nextMostConscious(Primitive type, java.util.Set<Vertex> ignoring)` Return the target vertex related by the type, with the high consciousness level and correctness greater than the value.
`Vertex`	`nextMostConscious(Primitive type, Vertex ignoring, float min)` Return the target vertex related by the type, with the high consciousness level greater than the value.
`Vertex`	`nextMostConscious(Vertex type, java.util.Set<Vertex> ignoring, float min, boolean inverse)` Return the target vertex related by the type, with the high consciousness level and correctness greater than the value.
`Vertex`	`nextMostConscious(Vertex type, Vertex ignoring, float min)` Return the target vertex related by the type, with the high consciousness level and correctness greater than the value.
`Relationship`	`nextMostConsciousRelationship(Primitive type, Vertex ignoring)` Return the relationship related by the type, with the high consciousness level.
`Relationship`	`nextMostConsciousRelationship(Primitive type, Vertex ignoring, float min)` Return the relationship related by the type, with the high consciousness level greater than the value.
`Relationship`	`nextMostConsciousRelationship(Vertex type, java.util.Set<Vertex> ignoring, float min, boolean inverse)` Return the target vertex related by the type, with the high consciousness level and correctness greater than the value.
`Relationship`	`nextMostConsciousRelationship(Vertex type, Vertex ignoring)` Return the relationship related by the type, with the high consciousness level.
`java.util.Iterator<Relationship>`	`orderedAllRelationships()` Provides an easier method of traversing all the relations of a vertex.
`java.util.List<Vertex>`	`orderedRelations(Primitive primitive)` Return all of the relationships targets of the primitive type, sorted by index.
`java.util.List<Vertex>`	`orderedRelations(Vertex relationshipType)` Return all of the relationship targets of the type, sorted by index.
`java.util.List<Relationship>`	`orderedRelationships(Primitive primitive)` Return all of the relationships of the primitive type, sorted by index.
`java.util.List<Relationship>`	`orderedRelationships(Vertex relationshipType)` Return all of the relationships of the type, sorted by index.
`java.util.List<Relationship>`	`orderedRelationshipsByConsciousness(Primitive primitive)` Return all of the relationships of the type, sorted by consciousness level.
`java.util.List<Relationship>`	`orderedRelationshipsByConsciousness(Vertex relationshipType)` Return all of the relationships of the type, sorted by consciousness level.
`void`	`pinChildren()` Pin the targets of all relationships to memory.
`void`	`pinDescendants()` Pin the vertex and all of its descendants into memory.
`java.lang.String`	`printString()` Print the object's data such as a sentence or paragraph.
`java.lang.String`	`printString(int depth)` Print the object's data such as a sentence or paragraph.
`Relationship`	`removeRelationship(Primitive type, Primitive target)` Remove the relation of the primitive type from the other vertex.
`Relationship`	`removeRelationship(Primitive type, Vertex target)` Remove the relation of the primitive type from the other vertex.
`Relationship`	`removeRelationship(Vertex type, Vertex target)` Remove the relation of the type from the other vertex.
`void`	`replaceRelationship(Relationship oldRelationship, Vertex newTarget)` Replace the relationship with the new target at the same index.
`void`	`setAccessCount(int accessCount)` Set the number of times the vertex has been accessed.
`void`	`setAccessDate(java.util.Date accessDate)` Set the date the vertex was last accessed.
`void`	`setConsciousnessLevel(int consciousnessLevel)` Set the vertices's level of consciousness.
`void`	`setCreationDate(java.util.Date creationDate)` Set the date the vertex was created.
`void`	`setData(java.lang.Object data)` Allows some piece of data to be associated with the vertex.
`void`	`setGroupId(long groupId)` Set group id of script.
`void`	`setId(java.lang.Long id)` Set the vertex id.
`void`	`setIsDirty(boolean isDirty)` Mark the vertex for forgetfullness.
`void`	`setIsTemporary(boolean pinned)` Set if the vertex is temporary, and not persistent.
`void`	`setName(java.lang.String name)` Set the name of the vertex.
`void`	`setNetwork(Network network)` Set the network the vertex is derived from.
`void`	`setOriginal(Vertex original)` Set the original long term vertex the short term vertex was derived from.
`void`	`setPinned(boolean pinned)` Set if the vertex should be pinned to memory.
`void`	`setRelationship(Primitive type, Primitive newValue)` Set the relationship, removing the old value.
`void`	`setRelationship(Primitive type, Vertex newValue)` Set the relationship, removing the old value.
`void`	`setRelationship(Vertex type, Vertex newValue)` Set the relationship, removing the old value.
`void`	`setType(java.lang.String type)` Set the internal data-type of the vertex.
`void`	`setWordCount(int wordCount)` Set word count for a sentence.
`int`	`totalRelationships()` Return the total number of all relationships.
`void`	`unpinChildren()` Unpin the targets of all relationships from memory.
`void`	`unpinDescendants()` Unpin the vertex and all of its descendants from memory.
`void`	`weakAssociateAll(Primitive relationshipType, Vertex target, Primitive type, float correctnessMultiplier)` Associate each of the relationship target vertices with the target vertex by the type.
`void`	`weakAssociateAll(Vertex relationshipType, Vertex target, Vertex type, float correctnessMultiplier)` Associate each of the relationship target vertices with the target vertex by the type.

Method Detail

getId
```
java.lang.Long getId()
```
Unique id for the vertex. All vertices should define a unique identifier.

setId
```
void setId(java.lang.Long id)
```
Set the vertex id. The id can only be set when loading or creating a vertex.

getName
```
java.lang.String getName()
```
Return the name of the vertex. The name is used as a hint to refer to what the vertex represents.

setName
```
void setName(java.lang.String name)
```
Set the name of the vertex. The name is used as a hint to refer to what the vertex represents.

getGroupId
```
long getGroupId()
```
Return group id of script. Used to optimize script loading.

setGroupId
```
void setGroupId(long groupId)
```
Set group id of script. Used to optimize script loading.

getWordCount
```
int getWordCount()
```
Return word count for a sentence. Used to detect corrupt/forgotten sentences.

setWordCount
```
void setWordCount(int wordCount)
```
Set word count for a sentence. Used to detect corrupt/forgotten sentences.

getDataValue
```
java.lang.String getDataValue()
```
Return the String value of the data.

getDataType
```
java.lang.String getDataType()
```
Return the String name of the data's type.

setType
```
void setType(java.lang.String type)
```
Set the internal data-type of the vertex.

printString
```
java.lang.String printString()
```
Print the object's data such as a sentence or paragraph.

printString
```
java.lang.String printString(int depth)
```
Print the object's data such as a sentence or paragraph.

getData
```
java.lang.Object getData()
```
Allows some piece of data to be associated with the vertex. May be text, image, sound, numeric, date, primitive, etc.

setData
```
void setData(java.lang.Object data)
```
Allows some piece of data to be associated with the vertex. May be text, image, sound, numeric, date, primitive, etc.

hasData
```
boolean hasData()
```
Most pure knowledge vertices have no data, this provides an easy test method.

hasName
```
boolean hasName()
```
Some vertices have no name, this provides an easy test method.

equalsIgnoreCase
```
boolean equalsIgnoreCase(Vertex vertex)
```
Compare the vertices ignoring case.

getNetwork
```
Network getNetwork()
```
Return the network the vertex is derived from.

setNetwork
```
void setNetwork(Network network)
```
Set the network the vertex is derived from.

getCreationDate
```
java.util.Date getCreationDate()
```
Return the date the vertex was created.

setCreationDate

void setCreationDate(java.util.Date creationDate)

Set the date the vertex was created.

getAccessDate
```
java.util.Date getAccessDate()
```
Return the date the vertex was last accessed.

setAccessDate
```
void setAccessDate(java.util.Date accessDate)
```
Set the date the vertex was last accessed. Access is considered moving from long term to short term memory.

getAccessCount
```
int getAccessCount()
```
Return the number of times the vertex has been accessed. Access is considered moving from long term to short term memory.

setAccessCount
```
void setAccessCount(int accessCount)
```
Set the number of times the vertex has been accessed.

incrementAccessCount
```
void incrementAccessCount()
```
Record that the vertex was accessed, update the access time and increment the access count.

incrementConsciousnessLevel
```
void incrementConsciousnessLevel()
```
Increase the vertices's level of consciousness.

incrementConsciousnessLevel
```
void incrementConsciousnessLevel(int amount)
```
Increase the vertices's level of consciousness by the amount.

decrementConsciousnessLevel
```
void decrementConsciousnessLevel()
```
Decrease the vertices's level of consciousness.

decrementConsciousnessLevel
```
void decrementConsciousnessLevel(int amount)
```
Decrease the vertices's level of consciousness by the amount.

getConsciousnessLevel
```
int getConsciousnessLevel()
```
Return the vertices's level of consciousness.

setConsciousnessLevel
```
void setConsciousnessLevel(int consciousnessLevel)
```
Set the vertices's level of consciousness.

isPinned
```
boolean isPinned()
```
Return if the vertex is pinned to memory, and will not be forgotten.

setPinned
```
void setPinned(boolean pinned)
```
Set if the vertex should be pinned to memory. Pinned vertices will not be forgotten.

isTemporary
```
boolean isTemporary()
```
Return if the vertex is temporary, and not persistent.

setIsTemporary
```
void setIsTemporary(boolean pinned)
```
Set if the vertex is temporary, and not persistent.

pinDescendants
```
void pinDescendants()
```
Pin the vertex and all of its descendants into memory. This can be used for important data such as language rules.

unpinDescendants
```
void unpinDescendants()
```
Unpin the vertex and all of its descendants from memory. This can be used to release removed language rules.

hasRelationships
```
boolean hasRelationships()
```
Return if the relationships have been instantiated.

orderedRelationships
```
java.util.List<Relationship> orderedRelationships(Primitive primitive)
```
Return all of the relationships of the primitive type, sorted by index.

orderedRelationships
```
java.util.List<Relationship> orderedRelationships(Vertex relationshipType)
```
Return all of the relationships of the type, sorted by index.

orderedRelationshipsByConsciousness
```
java.util.List<Relationship> orderedRelationshipsByConsciousness(Primitive primitive)
```
Return all of the relationships of the type, sorted by consciousness level.

orderedRelationshipsByConsciousness
```
java.util.List<Relationship> orderedRelationshipsByConsciousness(Vertex relationshipType)
```
Return all of the relationships of the type, sorted by consciousness level.

orderedRelations
```
java.util.List<Vertex> orderedRelations(Primitive primitive)
```
Return all of the relationships targets of the primitive type, sorted by index.

orderedRelations
```
java.util.List<Vertex> orderedRelations(Vertex relationshipType)
```
Return all of the relationship targets of the type, sorted by index.

getRelationship
```
Vertex getRelationship(Primitive type)
```
Return any relationship target of the primitive type.

getRelationship
```
Vertex getRelationship(Vertex type)
```
Return any relationship target of the type.

getRelationships

java.util.Collection<Relationship> getRelationships(Primitive type)

Return any relationship target of the primitive type.

getRelationship

Relationship getRelationship(Primitive type,
                             Primitive target)

Return the relationship to the target of the primitive type.

getRelationship

Relationship getRelationship(Primitive type,
                             Vertex target)

Return the relationship to the target of the primitive type.

getRelationship

Relationship getRelationship(Vertex type,
                             Vertex target)

Return the relationship to the target of the primitive type.

getRelationships
```
java.util.Collection<Relationship> getRelationships(Vertex relationshipType)
```
Return all relationships of the type. A vertex may have a relation to any other vertex including itself, relations may be of different types such as "classification", "belongs", "contained", etc. The real knowledge of the vertex is define by its relationships.

lastRelationship
```
Vertex lastRelationship(Vertex type)
```
Return the last of the ordered relationship, or null.

fixRelationships
```
void fixRelationships(Vertex type)
```
Fix the corrupted relationship index order. The order can get corrupted when relationships are forgotten.

isDirty
```
boolean isDirty()
```
Return the the vertex has exceeded it relationships maximum.

setIsDirty
```
void setIsDirty(boolean isDirty)
```
Mark the vertex for forgetfullness.

lastRelationship
```
Vertex lastRelationship(Vertex type,
                        int fromLast)
```
Return the fromLast last of the ordered relationship, or null. i.e. 2nd last, or 3rd last, etc.

lastRelationship
```
Vertex lastRelationship(Primitive type,
                        int fromLast)
```
Return the fromLast last of the ordered relationship, or null. i.e. 2nd last, or 3rd last, etc.

lastRelationship
```
Vertex lastRelationship(Primitive type)
```
Return the last of the ordered relationship, or null.

mostConscious
```
Vertex mostConscious(Vertex type)
```
Return the target vertex related by the type, with the high consciousness level.

mostConscious
```
Vertex mostConscious(Primitive type)
```
Return the target vertex related by the type, with the high consciousness level.

mostConscious
```
Vertex mostConscious(Vertex type,
                     float min)
```
Return the target vertex related by the type, with the high consciousness level greater than the value.

mostConsciousRelationship
```
Relationship mostConsciousRelationship(Primitive type)
```
Return the relationship related by the type, with the high consciousness level.

mostConsciousRelationship
```
Relationship mostConsciousRelationship(Primitive type,
                                       float min)
```
Return the relationship related by the type, with the high consciousness level and correctness greater than the value.

mostConsciousRelationship
```
Relationship mostConsciousRelationship(Vertex type)
```
Return the relationship related by the type, with the high consciousness level.

mostConscious
```
Vertex mostConscious(Primitive type,
                     float min)
```
Return the target vertex related by the type, with the high consciousness level and correctness greater than the value.

nextMostConscious
```
Vertex nextMostConscious(Primitive type,
                         java.util.Set<Vertex> ignoring)
```
Return the target vertex related by the type, with the high consciousness level and correctness greater than the value.

nextMostConscious

Vertex nextMostConscious(Vertex type,
                         java.util.Set<Vertex> ignoring,
                         float min,
                         boolean inverse)

Return the target vertex related by the type, with the high consciousness level and correctness greater than the value.

nextMostConsciousRelationship

Relationship nextMostConsciousRelationship(Vertex type,
                                           java.util.Set<Vertex> ignoring,
                                           float min,
                                           boolean inverse)

Return the target vertex related by the type, with the high consciousness level and correctness greater than the value.

nextMostConscious

Vertex nextMostConscious(Vertex type,
                         Vertex ignoring,
                         float min)

Return the target vertex related by the type, with the high consciousness level and correctness greater than the value.

nextMostConsciousRelationship

Relationship nextMostConsciousRelationship(Vertex type,
                                           Vertex ignoring)

Return the relationship related by the type, with the high consciousness level.

nextMostConsciousRelationship

Relationship nextMostConsciousRelationship(Primitive type,
                                           Vertex ignoring)

Return the relationship related by the type, with the high consciousness level.

nextMostConsciousRelationship

Relationship nextMostConsciousRelationship(Primitive type,
                                           Vertex ignoring,
                                           float min)

Return the relationship related by the type, with the high consciousness level greater than the value.

nextMostConscious

Vertex nextMostConscious(Primitive type,
                         Vertex ignoring,
                         float min)

Return the target vertex related by the type, with the high consciousness level greater than the value.

mostConscious
```
Vertex mostConscious(Vertex type,
                     Vertex classification)
```
Return the target vertex related by the type, of the classification, with the high consciousness level.

mostConscious
```
Vertex mostConscious(Vertex type,
                     float min,
                     boolean inverse)
```
Return the target vertex inversely/negatively related by the type, with the high consciousness level.