TEI P4 Beta: Reference Documentation

`<node>` | encodes a node, a possibly labeled point in a graph.
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
| Legal values: |
`initial` | initial node in a transition network
`final` | final node in a transition network
| Default: #IMPLIED
`adjTo` | gives the IDs of the nodes which are adjacent to the current node.
| Datatype: IDREFS
| Values: A list of IDs.
| Default: #IMPLIED
`adjFrom` | gives the IDs of the nodes which are adjacent from the current node.
| Datatype: IDREFS
| Values: A list of IDs.
| Default: #IMPLIED
`adj` | gives the IDs of the nodes which are both adjacent to and adjacent from the current node.
| Datatype: IDREFS
| Values: A list of IDs.
| 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: NUMBER
| Values: A nonnegative integer.
| Default: #IMPLIED
`outDegree` | gives the out degree of the node, the number of nodes which are adjacent to the given node.
| Datatype: NUMBER
| Values: A nonnegative integer.
| Default: #IMPLIED
`degree` | gives the degree of the node, the number of arcs with which the node is incident.
| Datatype: NUMBER
| Values: A nonnegative 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' inDegree=2 outDegree=0 type='final'>

Tagset additional tag set for graphs, networks, and trees
Class
Filename `teinet2`
Content: empty
Parents graph
Children [none]
Declaration

    <!ELEMENT node          - O  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           NUMBER              #IMPLIED
              outDegree          NUMBER              #IMPLIED
              degree             NUMBER              #IMPLIED       >

See 21.1

Back to index