An Entity of Type: Thing, from Named Graph: http://dbpedia.org, within Data Space: dbpedia-live.demo.openlinksw.com

In graph theory, the minimum number of edges in a path connecting two vertices

Property Value
dbo:description
  • Graphentheorie (de)
  • concetto della teoria dei grafi (it)
  • la minimuma nombro de eĝoj konektantaj du verticojn en grafo (eo)
  • グラフ理論において、2つの頂点を結ぶ経路における辺の最小の数 (ja)
  • in graph theory, the minimum number of edges in a path connecting two vertices (en)
  • concept en théorie des graphes (fr)
  • gráfelméleti mennyiség (hu)
  • en teoría de grafos, número de vértices mínimo que debe recorrerse entre dos vértices de un grafo para unirlos (es)
  • תכונה של היחס בין שני קודקודים בגרף (iw)
  • çizgelerde (veya grafiklerde) iki düğüm arasındaki en kısa yolu ifade eder, düğümler arasındaki kenar sayısı ile ölçülür (tr)
  • comprimento do caminho mais curto entre dois nós de um grafo (pt)
  • 圖上兩頂點的最短距離 (zh)
  • в теории графов - число рёбер в кратчайшем пути (ru)
dbo:thumbnail
dbo:wikiPageWikiLink
dbp:wikiPageUsesTemplate
dct:subject
rdfs:label
  • Distance (graph theory) (en)
  • Distància (teoria de grafs) (ca)
  • Vzdálenost (teorie grafů) (cs)
  • Distancia (teoría de grafos) (es)
  • Distance (théorie des graphes) (fr)
  • 거리 (그래프 이론) (ko)
  • Odległość (teoria grafów) (pl)
  • Distância (teoria dos grafos) (pt)
  • Метрика кратчайшего пути (ru)
  • Відстань (теорія графів) (uk)
  • 距离 (图论) (zh)
owl:sameAs
prov:wasDerivedFrom
foaf:depiction
foaf:isPrimaryTopicOf
is dbo:wikiPageDisambiguates of
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
is rdfs:seeAlso of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 4.0 International