Zvolte jazyk: english | cesky | deutsch | italiano | simplified chinese | traditional chinese | hindi
Koncept:
Anglické slovo:
Hlavní stránka

hrana grafu (GraphArc)

Graphs are comprised of GraphNodes and GraphArcs. Every GraphArc links two GraphNodes.

Ontologie

SUMO / GRAPH-THEORY

Nadtřída(y)

[tree]
entita
is subclass of
  abstraktum  
is subclass of
  prvek grafu  
is subclass of
  hrana grafu  

Podtřída(y)

smyčka grafu 

Související termín(y)

uzel grafu 

Constrains relations

initial node fn  terminal node fn  arc weight  links 

Related WordNet synsets

See more related synsets on a separate page.

Axiomy (5)

Jestliže graph je instancí třídy orientovaný graf a arc je instancí třídy hrana grafu a arc je částí graph, potom existují node1,node2 tak, že "initial node fn(arc)" se rovná node1 a "terminal node fn(arc)" se rovná node2. 
(=>
      (and
            (instance ?GRAPH DirectedGraph)
            (instance ?ARC GraphArc)
            (graphPart ?ARC ?GRAPH))
      (exists
            (?NODE1 ?NODE2)
            (and
                  (equal
                        (InitialNodeFn ?ARC)
                        ?NODE1)
                  (equal
                        (TerminalNodeFn ?ARC)
                        ?NODE2))))
(=>
      (and
            (instance ?GRAPH GraphPath)
            (instance ?ARC GraphArc)
            (graphPart ?ARC ?GRAPH))
      (=>
            (equal
                  (InitialNodeFn ?ARC)
                  ?NODE)
            (not
                  (exists
                        (?OTHER)
                        (and
                              (equal
                                    (InitialNodeFn ?OTHER)
                                    ?NODE)
                              (not
                                    (equal ?OTHER ?ARC)))))))
(=>
      (and
            (instance ?GRAPH GraphPath)
            (instance ?ARC GraphArc)
            (graphPart ?ARC ?GRAPH))
      (=>
            (equal
                  (TerminalNodeFn ?ARC)
                  ?NODE)
            (not
                  (exists
                        (?OTHER)
                        (and
                              (equal
                                    (TerminalNodeFn ?OTHER)
                                    ?NODE)
                              (not
                                    (equal ?OTHER ?ARC)))))))
prvek grafu je exhaustively partitioned into uzel grafu,hrana grafu. 
(partition GraphElement GraphNode GraphArc)
Jestliže arc je instancí třídy hrana grafu, potom existují node1,node2 tak, že arc spojuje node1 a node2. 
(=>
      (instance ?ARC GraphArc)
      (exists
            (?NODE1 ?NODE2)
            (links ?NODE1 ?NODE2 ?ARC)))