Browsing Interface : Welcome guest : log in
|
Browsing Interface : Welcome guest : log in |
[
Home |
Graph |
LogLearn |
Editor |
]
KB:
Language:
Formal Language:
|
DirectedGraph(directed graph)
|
| appearance as argument number 1 |
|
| (subclass DirectedGraph Graph) | Merge.kif 5788-5788 | Directed graph is a subclass of graph |
| (documentation DirectedGraph EnglishLanguage "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).") | Merge.kif 5790-5793 | Directed graph is a subclass of graph |
| (externalImage DirectedGraph "http://upload.wikimedia.org/wikipedia/commons/ a/ a2/ Directed.svg") | pictureList.kif 1727-1727 | Directed graph is a subclass of graph |
| appearance as argument number 2 |
|
|
| (subclass Tree DirectedGraph) | Merge.kif 5805-5805 | Tree is a subclass of directed graph |
| (subclass GraphPath DirectedGraph) | Merge.kif 5838-5838 | Graph path is a subclass of directed graph |
| (termFormat EnglishLanguage DirectedGraph "directed graph") | english_format.kif 1079-1079 | Graph path is a subclass of directed graph |
| antecedent |
|
|
| (=> (and (instance ?GRAPH DirectedGraph) (instance ?ARC GraphArc) (graphPart ?ARC ?GRAPH)) (exists (?NODE1 ?NODE2) (and (equal (InitialNodeFn ?ARC) ?NODE1) (equal (TerminalNodeFn ?ARC) ?NODE2)))) |
Merge.kif 5795-5803 | If X is an instance of directed graph, Y is an instance of graph arc, and Y is a part of X, then there exist Z, W such that equal the starting node of Y, Z, equal the terminal node of Y, and W |
| (=> (and (graphPart ?PATH ?GRAPH) (not (instance ?GRAPH DirectedGraph))) (<=> (instance ?PATH (GraphPathFn ?NODE1 ?NODE2)) (instance ?PATH (GraphPathFn ?NODE2 ?NODE1)))) |
Merge.kif 6181-6187 | If X is a part of Y and Y is not an instance of directed graph, then X is an instance of the set of paths between Z, W if, only if X is an instance of the set of paths between W, and Z |
|