<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://wiki.algo.informatik.tu-darmstadt.de/index.php?action=history&amp;feed=atom&amp;title=Single_source_single_target_shortest_paths</id>
	<title>Single source single target shortest paths - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://wiki.algo.informatik.tu-darmstadt.de/index.php?action=history&amp;feed=atom&amp;title=Single_source_single_target_shortest_paths"/>
	<link rel="alternate" type="text/html" href="https://wiki.algo.informatik.tu-darmstadt.de/index.php?title=Single_source_single_target_shortest_paths&amp;action=history"/>
	<updated>2026-11-16T16:05:25Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.46.2</generator>
	<entry>
		<id>https://wiki.algo.informatik.tu-darmstadt.de/index.php?title=Single_source_single_target_shortest_paths&amp;diff=1391&amp;oldid=prev</id>
		<title>JanR: Created page with &quot; == Input == # A directed graph &lt;math&gt;G=(V,A)&lt;/math&gt; # an arc weight &lt;math&gt; l(a) \in \mathbb{R}&lt;/math&gt; for each arc &lt;math&gt;a \in A&lt;/math&gt; # Two nodes &lt;math&gt; s,t \in V &lt;/math&gt;...&quot;</title>
		<link rel="alternate" type="text/html" href="https://wiki.algo.informatik.tu-darmstadt.de/index.php?title=Single_source_single_target_shortest_paths&amp;diff=1391&amp;oldid=prev"/>
		<updated>2014-10-20T10:39:11Z</updated>

		<summary type="html">&lt;p&gt;Created page with &amp;quot; == Input == # A directed graph &amp;lt;math&amp;gt;G=(V,A)&amp;lt;/math&amp;gt; # an arc weight &amp;lt;math&amp;gt; l(a) \in \mathbb{R}&amp;lt;/math&amp;gt; for each arc &amp;lt;math&amp;gt;a \in A&amp;lt;/math&amp;gt; # Two nodes &amp;lt;math&amp;gt; s,t \in V &amp;lt;/math&amp;gt;...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;&lt;br /&gt;
== Input ==&lt;br /&gt;
# A directed graph &amp;lt;math&amp;gt;G=(V,A)&amp;lt;/math&amp;gt;&lt;br /&gt;
# an arc weight &amp;lt;math&amp;gt; l(a) \in \mathbb{R}&amp;lt;/math&amp;gt; for each arc &amp;lt;math&amp;gt;a \in A&amp;lt;/math&amp;gt;&lt;br /&gt;
# Two nodes &amp;lt;math&amp;gt; s,t \in V &amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Output ==&lt;br /&gt;
The &amp;#039;&amp;#039;&amp;#039;length&amp;#039;&amp;#039;&amp;#039; of a shortest &amp;lt;math&amp;gt;(s,t)&amp;lt;/math&amp;gt;-path in &amp;lt;math&amp;gt;G&amp;lt;/math&amp;gt; subject to &amp;lt;math&amp;gt;l&amp;lt;/math&amp;gt;&lt;br /&gt;
&lt;br /&gt;
== Objective ==&lt;br /&gt;
N/A&lt;br /&gt;
&lt;br /&gt;
== Complexity ==&lt;br /&gt;
Polynomial&lt;br /&gt;
&lt;br /&gt;
== Known algorithms ==&lt;br /&gt;
* The A* variant on [[Dijkstra]].&lt;br /&gt;
&lt;br /&gt;
== Known variants ==&lt;/div&gt;</summary>
		<author><name>JanR</name></author>
	</entry>
</feed>