TreeView Knowledge Base Browser

Simple Browser : Welcome guest : log in

[ Home | Graph | ] KB: Language:
Formal Language:

KB Term:

Sigma KEE - DirectedGraph

directed graph

The Class of directed graphs. A directed graph is a Graph in which all GraphArcs have direction, i.e. every GraphArc has an initial node (see InitialNodeFn) and a terminal node (see TerminalNodeFn).

Relationships
Parents	graph	The Class of graphs, where a graph is understood to be a set of GraphNodes connected by GraphArcs. Note that this Class includes only connected graphs, i.e. graphs in which there is a GraphPath between any two GraphNodes. Note too that every Graph is required to contain at least two GraphArcs and three GraphNodes.
Children	graph path	Informally, a single, directed route between two GraphNodes in a Graph. Formally, a DirectedGraph that is a subGraph of the original Graph and such that no two GraphArcs in the DirectedGraph have the same initial node (see InitialNodeFn) or the same terminal node (see TerminalNodeFn).
	tree	A Tree is a DirectedGraph that has no GraphLoops.