Simple Browser
: Welcome guest :
log in
[
Home

Graph
 ]
KB:
SUMO
Language:
ChineseLanguage
ChinesePinyinWriting
ChineseSimplifiedWriting
ChineseTraditionalLanguage
EnglishLanguage
FrenchLanguage
GermanLanguage
HerbaceousPlant
Hindi
ItalianLanguage
JapaneseLanguage
PortugueseLanguage
SpanishLanguage
SwedishLanguage
WoodyPlant
cb
cz
de
hi
ro
sv
tg
Formal Language:
OWL
SUOKIF
TPTP
traditionalLogic
KB Term:
DirectedGraph
Sigma KEE  DirectedGraph
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
directed graph
The
Class
of directed graphs. A directed graph is a
Graph
in which all
GraphArc
s 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
GraphNode
s connected by
GraphArc
s. Note that this
Class
includes only connected graphs, i.e. graphs in which there is a
GraphPath
between any two
GraphNode
s. Note too that every
Graph
is required to contain at least two
GraphArc
s and three
GraphNode
s.
Children
graph path
Informally, a single, directed route between two
GraphNode
s in a
Graph
. Formally, a
DirectedGraph
that is a
subGraph
of the original
Graph
and such that no two
GraphArc
s 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
GraphLoop
s.
Show full definition (without tree view)
Show full definition (with tree view)
Show without tree
Sigma web home
Suggested Upper Merged Ontology (SUMO) web home
Sigma version 3.0 is
open source software
produced by
Articulate Software
and its partners