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

Formal Language: 




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 的两个 GraphNode 之间 的单一有向的路径。形式的说,这是一个 DirectedGraph,它是原来的 GraphsubGraph,而使得 这个 DirectedGraph 里没有两个 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 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