Simple Browser
: Welcome guest :
log in
[
Home

Graph
 ]
KB:
SUMO
Language:
ChineseLanguage
ChinesePinyinWriting
ChineseSimplifiedWriting
ChineseTraditionalLanguage
EnglishLanguage
FrenchLanguage
GermanLanguage
JapaneseLanguage
SpanishLanguage
SwedishLanguage
Formal Language:
OWL
SUOKIF
TPTP
traditionalLogic
Sigma KEE  GraphPath
KB Term:
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
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
).
Relationships
Parents
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
).
Children
graph circuit
A
GraphPath
that begins (see
BeginNodeFn
) and ends (see
EndNodeFn
) at the same
GraphNode
.
Show simplified definition with tree view
Show full definition (without tree view)
Show full definition (with tree view)
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