Text Encoding Initiative

The XML Version of the TEI Guidelines

<node>

<node> encodes a node, a possibly labeled point in a graph.
Attributes (In addition to global attributes)
label gives a label for a node.
Datatype: CDATA
Values: A character string.
Default: #IMPLIED
label2 gives a second label for a node.
Datatype: CDATA
Values: A character string.
Default: #IMPLIED
Note

Use this attribute together with the label attribute if a transducer is being encoded whose actions are associated with nodes rather than with arcs.
value provides the value of a node, which is a feature structure or other analytic element.
Datatype: IDREF
Values: A valid identifier.
Default: #IMPLIED
type provides a type for a node.
Datatype: CDATA
Suggested values include:
initial initial node in a transition network
final final node in a transition network
Default: #IMPLIED
adjTo gives the identifiers of the nodes which are adjacent to the current node.
Datatype: IDREFS
Values: A list of identifiers.
Default: #IMPLIED
adjFrom gives the identifiers of the nodes which are adjacent from the current node.
Datatype: IDREFS
Values: A list of identifiers.
Default: #IMPLIED
adj gives the identifiers of the nodes which are both adjacent to and adjacent from the current node.
Datatype: IDREFS
Values: A list of identifiers.
Default: #IMPLIED
Note

Use this attribute instead of the adjTo and adjFrom attributes when the graph is undirected and vice versa if the graph is directed.
inDegree gives the in degree of the node, the number of nodes which are adjacent from the given node.
Datatype: CDATA
Values: A non-negative integer.
Default: #IMPLIED
outDegree gives the out degree of the node, the number of nodes which are adjacent to the given node.
Datatype: CDATA
Values: A non-negative integer.
Default: #IMPLIED
degree gives the degree of the node, the number of arcs with which the node is incident.
Datatype: CDATA
Values: A non-negative integer.
Default: #IMPLIED
Note

Use this attribute instead of the inDegree and outDegree attributes when the graph is undirected and vice versa if the graph is directed.
Example 
<node id="t6" label="6" type="final" inDegree="2" outDegree="0"/>
Module Declared in file teinet2; Additional tag set for Graph Theory: enabled by TEI.nets
Data Description empty
May occur within graph
Declaration 
<!ELEMENT node %om.RO; EMPTY> 
<!ATTLIST node  
      %a.global;
      label CDATA #IMPLIED
      label2 CDATA #IMPLIED
      value IDREF #IMPLIED
      type CDATA #IMPLIED
      adjTo IDREFS #IMPLIED
      adjFrom IDREFS #IMPLIED
      adj IDREFS #IMPLIED
      inDegree CDATA #IMPLIED
      outDegree CDATA #IMPLIED
      degree CDATA #IMPLIED>
See further 21.1 Graphs and Digraphs

Up: 35 Elements