Simple Browser : Welcome guest : log in
Home |  Graph |  ]  KB:  Language:   

Formal Language: 



KB Term: 

  GraphPath

Sigma KEE - GraphPath
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 内の2つの GraphNode 間の単一 の指向ルート。正式には、DirectedGraphは、元の GraphsubGraph であり、DirectedGraph 内の2つの GraphArc が同じ初期ノード (InitialNodeFn を参照) または同じ端末ノード (TerminalNodeFn を参照)を持たない。
Relationships      
Parents 有向グラフ 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).
Children グラフ回路A GraphPath that begins (see BeginNodeFn) and ends (see EndNodeFn) at the same GraphNode.


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