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

Formal Language: 




Sigma KEE - DirectedGraph
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
有向グラフ
有向グラフの Class。 有向グラフは、すべての GraphArcs が方向を持つ Graph である。 すなわち、すべての GraphArc には初期ノード (InitialNodeFn を参照) とターミナルノード (TerminalNodeFn を参照) がある。
Relationships      
Parents グラフ 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 グラフパス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).
 ツリーA Tree is a DirectedGraph that has no GraphLoops.


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