scholarly journals Determinating shortest paths from one vertex using an algorithm of breadth-first search

2012 ◽  
Vol 1 (1) ◽  
pp. 16-20
Author(s):  
Stepan Vynnychuk
Keyword(s):  
Shortest Paths ◽  
Breadth First Search

Computer algorithms

2018 ◽  
Author(s):  
Mark Newman
Keyword(s):  
Data Structures ◽  
Analysis Of Algorithms ◽  
Shortest Paths ◽  
Minimum Cut ◽  
Network Data ◽  
Computer Algorithms ◽  
Breadth First Search ◽  
Augmenting Path ◽  
Basic Concepts ◽  
Maximum Flows

This chapter introduces some of the fundamental concepts of numerical network calculations. The chapter starts with a discussion of basic concepts of computational complexity and data structures for storing network data, then progresses to the description and analysis of algorithms for a range of network calculations: breadth-first search and its use for calculating shortest paths, shortest distances, components, closeness, and betweenness; Dijkstra's algorithm for shortest paths and distances on weighted networks; and the augmenting path algorithm for calculating maximum flows, minimum cut sets, and independent paths in networks.

Indoor landmark-based path-finding utilising the expanded connectivity of an endpoint partition

2016 ◽  
Vol 45 (2) ◽  
pp. 233-252
Author(s):  
Pepijn Viaene ◽  
Alain De Wulf ◽  
Philippe De Maeyer
Keyword(s):  
Visual Information ◽  
Spatial Configuration ◽  
Shortest Paths ◽  
Minimal Amount ◽  
Path Finding ◽  
Breadth First Search ◽  
Length Increase ◽  
Efficient Communication ◽  
Indoor Wayfinding

Landmarks are ideal wayfinding tools to guide a person from A to B as they allow fast reasoning and efficient communication. However, very few path-finding algorithms start from the availability of landmarks to generate a path. In this paper, which focuses on indoor wayfinding, a landmark-based path-finding algorithm is presented in which the endpoint partition is proposed as spatial model of the environment. In this model, the indoor environment is divided into convex sub-shapes, called e-spaces, that are stable with respect to the visual information provided by a person’s surroundings (e.g. walls, landmarks). The algorithm itself implements a breadth-first search on a graph in which mutually visible e-spaces suited for wayfinding are connected. The results of a case study, in which the calculated paths were compared with their corresponding shortest paths, show that the proposed algorithm is a valuable alternative for Dijkstra’s shortest path algorithm. It is able to calculate a path with a minimal amount of actions that are linked to landmarks, while the path length increase is comparable to the increase observed when applying other path algorithms that adhere to natural wayfinding behaviour. However, the practicability of the proposed algorithm is highly dependent on the availability of landmarks and on the spatial configuration of the building.

scholarly journals The Number of Moves of the Largest Disc in Shortest Paths on Hanoi Graphs

10.37236/4252 ◽  
2014 ◽  
Vol 21 (4) ◽  
Author(s):  
Simon Aumann ◽  
Katharina A.M. Götz ◽  
Andreas M. Hinz ◽  
Ciril Petr
Keyword(s):  
Shortest Paths ◽  
General Setting ◽  
Optimal Number ◽  
Numerical Results ◽  
Breadth First Search ◽  
Tower Of Hanoi ◽  
Optimal Paths ◽  
Widespread Interest ◽  
Binary Strings

In contrast to the widespread interest in the Frame-Stewart conjecture (FSC) about the optimal number of moves in the classical Tower of Hanoi task with more than three pegs, this is the first study of the question of investigating shortest paths in Hanoi graphs $H_p^n$ in a more general setting. Here $p$ stands for the number of pegs and $n$ for the number of discs in the Tower of Hanoi interpretation of these graphs. The analysis depends crucially on the number of largest disc moves (LDMs). The patterns of these LDMs will be coded as binary strings of length $p-1$ assigned to each pair of starting and goal states individually. This will be approached both analytically and numerically. The main theoretical achievement is the existence, at least for all $n\geqslant p(p-2)$, of optimal paths where $p-1$ LDMs are necessary. Numerical results, obtained by an algorithm based on a modified breadth-first search making use of symmetries of the graphs, lead to a couple of conjectures about some cases not covered by our ascertained results. These, in turn, may shed some light on the notoriously open FSC.

Semi-dynamic shortest paths and breadth-first search in digraphs

1997 ◽  
pp. 33-46 ◽  
Author(s):  
Paolo Giulio Franciosa ◽  
Daniele Frigioni ◽  
Roberto Giaccio
Keyword(s):  
Shortest Paths ◽  
Breadth First Search ◽  
Dynamic Shortest Paths

scholarly journals Shortest Paths Based Web Service Selection in Internet of Things

2014 ◽  
Vol 2014 ◽  
pp. 1-10 ◽  
Author(s):  
Xiangdong Yin ◽  
Jie Yang
Keyword(s):  
Web Services ◽  
Web Service ◽  
Search Algorithm ◽  
Shortest Paths ◽  
Empirical Evaluation ◽  
Real Life ◽  
Breadth First Search ◽  
Pruning Algorithm ◽  
Smart Things ◽  
Selection Of

The connecting of things to the Internet makes it possible for smart things to access all kinds of Web services. However, smart things are energy-limited, and suitable selection of Web services will consume less resources. In this paper, we study the problem of selecting some Web service from the candidate set. We formulate this selection of Web services for smart things as single-source many-target shortest path problem. We design algorithms based on the Dijkstra and breadth-first search algorithms, propose an efficient pruning algorithm for breadth-first search, and analyze their performance of number of iterations andI/Ocost. Our empirical evaluation on real-life graphs shows that our pruning algorithm is more efficient than the breadth-first search algorithm.

scholarly journals Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths

2004 ◽  
Vol 11 (2) ◽  
Author(s):  
Gerth Stølting Brodal ◽  
Rolf Fagerberg ◽  
Ulrich Meyer ◽  
Norbert Zeh
Keyword(s):  
Data Structures ◽  
Shortest Paths ◽  
Block Size ◽  
Priority Queue ◽  
Breadth First Search ◽  
Undirected Graphs ◽  
Performance Gap ◽  
Negative Edge ◽  
Data Structures And Algorithms ◽  
Cache Oblivious

We present improved cache-oblivious data structures and algorithms for breadth-first search (BFS) on undirected graphs and the single-source shortest path (SSSP) problem on undirected graphs with non-negative edge weights. For the SSSP problem, our result closes the performance gap between the currently best <em>cache-aware</em> algorithm and the <em>cache-oblivious</em> counterpart. Our cache-oblivious SSSP-algorithm takes nearly full advantage of block transfers for <em>dense</em> graphs. The algorithm relies on a new data structure, called <em>bucket heap</em>, which is the first cache-oblivious priority queue to efficiently support a weak D<small>ECREASE</small>K<small>EY</small> operation. For the BFS problem, we reduce the number of I/Os for <em>sparse</em> graphs by a factor of nearly sqrt{B}, where B is the cache-block size, nearly closing the performance gap between the currently best <em>cache-aware</em> and <em>cache-oblivious</em> algorithms.

Research on Fast KCSP Algorithms for Searching Connecting Paths in Airline Networks

2014 ◽  
Vol 505-506 ◽  
pp. 1005-1013 ◽  
Author(s):  
Jian Fu Li ◽  
Tie Jun Li
Keyword(s):  
Rapid Development ◽  
Shortest Paths ◽  
Civil Aviation ◽  
Aviation Industry ◽  
Breadth First Search ◽  
Structure Characteristics ◽  
The World ◽  
Airline Networks ◽  
Airline Network ◽  
Transfer Times

With the rapid development of the civil aviation industry in the world, airline networks become increasingly complex and large, which provide more choices for passengers. To search in airline networks for better connecting paths, it is very time-consuming by existing general K Constrained Shortest Paths (KCSP) algorithms. According to that the acceptable transfer times is generally not more than 3, combined with the structure characteristics of the Yen algorithm, a fast algorithm named as KCSP_Yen is proposed for searching connecting paths in airline networks. At the same time, based on the bounded breadth-first search and A* search, two fast KCSP algorithms are proposed. Finally, the three algorithms are test through experiments on the world airline network.

eMap: A Web Application for Identifying and Visualizing Electron or Hole Hopping Pathways in Proteins

2019 ◽  
Author(s):  
Ruslan N. Tazhigulov ◽  
James R. Gayvert ◽  
Melissa Wei ◽  
Ksenia B. Bravaya
Keyword(s):  
Web Application ◽  
Shortest Paths ◽  
Coarse Grained ◽  
Decay Parameter ◽  
Electron Hole ◽  
Web Based ◽  
Aromatic Amino Acid Residue ◽  
Pathways Model ◽  
Visualization Tools ◽  
Effective Decay

<p>eMap is a web-based platform for identifying and visualizing electron or hole transfer pathways in proteins based on their crystal structures. The underlying model can be viewed as a coarse-grained version of the Pathways model, where each tunneling step between hopping sites represented by electron transfer active (ETA) moieties is described with one effective decay parameter that describes protein-mediated tunneling. ETA moieties include aromatic amino acid residue side chains and aromatic fragments of cofactors that are automatically detected, and, in addition, electron/hole residing sites that can be specified by the users. The software searches for the shortest paths connecting the user-specified electron/hole source to either all surface-exposed ETA residues or to the user-specified target. The identified pathways are ranked based on their length. The pathways are visualized in 2D as a graph, in which each node represents an ETA site, and in 3D using available protein visualization tools. Here, we present the capability and user interface of eMap 1.0, which is available at https://emap.bu.edu.</p>

Sign in / Sign up

Export Citation Format

Share Document