From f0bc9371b5718620193b4378509237650364d10b Mon Sep 17 00:00:00 2001 From: Peter Saint-Andre Date: Tue, 14 Oct 2008 16:14:53 +0000 Subject: [PATCH] typo git-svn-id: file:///home/ksmith/gitmigration/svn/xmpp/trunk@2382 4b5297f7-1745-476d-ba37-a9c6900126ab --- xep-0248.xml | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/xep-0248.xml b/xep-0248.xml index 2d0e9533..ed71c6f1 100644 --- a/xep-0248.xml +++ b/xep-0248.xml @@ -43,7 +43,7 @@

This section provides background information about collection nodes, with insights from graph theory. See http://en.wikipedia.org/wiki/Graph_(mathematics). The intended result is a clearer vocabulary about particular deployment scenarios. The terminology introduced in this section is used mainly in the discussion of collection node deletion.

In terms of graph theory, the set of nodes hosted at a pubsub service is a directed acyclic graph. See http://en.wikipedia.org/wiki/Directed_acyclic_graph. The particular graph types can be further described as follows:

    -
  1. If there are no collection nodes, we say that the graph is simply a flat set of nodes without connections because there are no arcs between nodes, i.e., no node is the direct predecessor of another node (here we use the less formall phrase that no node is the parent of any other child node).
    2. +
  2. If there are no collection nodes, we say that the graph is simply a flat set of nodes without connections because there are no arcs between nodes, i.e., no node is the direct predecessor of another node (here we use the less formal phrase that no node is the parent of any other child node).
  3. If there may be multiple paths between between any two given nodes (where the path may include intermediate collection nodes), the graph is a Directed Acyclic Graph or "DAG" See http://en.wikipedia.org/wiki/Directed_acyclic_graph. because a given node may be the child of multiple parents.
  4. If there is only one path between any two given nodes (where the path may include intermediate collection nodes), the graph is a Tree See http://en.wikipedia.org/wiki/Tree_(graph_theory). because a given node may be the child of only one collection node.
  5. If there is a root collection node but there are no internal collection nodes, we say informally that the graph has a depth of 1 because all of the connections from leaf nodes to the root collection node are direct (i.e., each connection is an arc); this case is equivalent to a flat set with a root collection node and is typically uninteresting.