About: Shortest path problem

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Shortest path problem Goto Sponge NotDistinct Permalink

An Entity of Type : dbo:Disease, within Data Space : el.dbpedia.org associated with source document(s)

In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized. The problem of finding the shortest path between two intersections on a road map may be modeled as a special case of the shortest path problem in graphs, where the vertices correspond to intersections and the edges correspond to road segments, each weighted by the length of the segment.

Attributes	Values
rdf:type	Thing disease
rdfs:label	Shortest path problem (en)
rdfs:comment	In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized. The problem of finding the shortest path between two intersections on a road map may be modeled as a special case of the shortest path problem in graphs, where the vertices correspond to intersections and the edges correspond to road segments, each weighted by the length of the segment. (en)
sameAs	Shortest path problem Shortest path problem Shortest path problem
dbp:wikiPageUsesTemplate	dbt:Authority_control dbt:Citation dbt:Cite_book dbt:Cite_conference dbt:Cite_journal dbt:Cite_report dbt:Expand_list dbt:Expand_section dbt:Harvtxt dbt:Math dbt:More_footnotes dbt:Mvar dbt:Radic dbt:Refbegin dbt:Refend dbt:Reflist dbt:Short_description dbt:Unreferenced_section dbt:Harvnb dbt:Introduction_to_Algorithms
Subject	Edsger W. Dijkstra Polynomial-time problems Graph distance Network theory Computational problems in graph theory
gold:hypernym	Problem
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Shortest_path_problem?oldid=1065830308&ns=0
Wikipage page ID	41985 (xsd:integer)
page length (characters) of wiki page	37240 (xsd:nonNegativeInteger)
Wikipage revision ID	1065830308 (xsd:integer)
has abstract	In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized. The problem of finding the shortest path between two intersections on a road map may be modeled as a special case of the shortest path problem in graphs, where the vertices correspond to intersections and the edges correspond to road segments, each weighted by the length of the segment. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Shortest_path_problem
is rdfs:seeAlso of	Mohol programming languages
is Wikipage redirect of	Algebraic path problem Applications of shortest path algorithms The Shortest Paths All-pairs shortest path All-pairs shortest path problem All pairs shortest path All pairs shortest path problem Apsp Shortest-distance problems Shortest-path Shortest-path algorithms Shortest-path problem Shortest-path problems Shortest-path routing Shortest-paths Shortest Path Algorithms Shortest path algorithm Shortest path algorithms Shortest path problems Shortest path routing Shortest paths Shortestpath Shortestpath problem Shortestpath problems Shortestpaths Shortest Path Problem Shortest path DAG shortest paths Negative cycle APSP Single-destination shortest-path problem Single-destination shortest path problem Single-destination shortestpath problem Single-pair shortest-path problem Single-source shortest-path problem Single-source shortest-paths algorithms for directed graphs with nonnegative weights Single-source shortest path problem Single-source shortestpath problem Single destination shortest-path problem Single destination shortest path problem Single destination shortestpath problem Single source shortest-path problem Single source shortest path problem Single source shortestpath problem Singledestination shortest-path problem Singledestination shortest path problem Singledestination shortestpath problem Singlesource shortest-path problem Singlesource shortest path problem Singlesource shortestpath problem
is Link from a Wikipage to another Wikipage of	Flow network Floyd–Warshall algorithm Greedy algorithm Greedy geometric spanner List of terms relating to algorithms and data structures List of unsolved problems in computer science Literatronica Alexandrov's uniqueness theorem Algebraic path problem Algorithmic technique

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (72 GB total memory, 1 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software