dijkstra

Implement the Dijkstra's algorithm to find the shortest paths from the source node to
all nodes in the given network.

Network functionalities specialized for data generated from input-output tables.

Shiying Xiao

ionet

Network Analysis for Input-Output Tables

Jun Yan

Panpan Zhang

dijkstra function

<dl><dt>adjmat</dt>
<dd>The adjacency matrix of a directed, weighted network.</dd>
<dt>src</dt>
<dd>An integer specifying the given source node to find the shortest distance.</dd></dl>

Arguments

Dijkstra's algorithm — dijkstra

<dl>

<dt>adjmat</dt>
<dd>The adjacency matrix of a directed, weighted network.</dd>


<dt>src</dt>
<dd>An integer specifying the given source node to find the shortest distance.</dd>

</dl>

dijkstra: Dijkstra's algorithm

Description

Usage

Value

Arguments

References