Breadth First Search Approach for Shortest Path Solution in Cartesian Area

Molecular enumeration plays a basic role in the design of drugs, which has been studied by mathematicians, computer scientists, and chemists for quite a long time. Although many researchers are involved in developing enumeration algorithms specific to drug design systems, molecular enumeration is still a hard problem to date due to its exponentially increasing large search space with larger number of atoms. To alleviate this defect, we propose efficient algorithms, BfsSimEnum and BfsMulEnum to enumerate tree-like molecules without and with multiple bonds, respectively, where chemical compounds are represented as molecular graphs. In order to reduce the large search space, we adjust some important concepts such as left-heavy, center-rooted, and normal form to molecular tree graphs. Different from many existing approaches, BfsSimEnum and BfsMulEnum firstly enumerate tree-like compounds by breadth-first search order. Computational experiments are performed to compare with several existing methods. The results suggest that our proposed methods are exact and more efficient.

Download Full-text

A Heuristic Search Approach for a Nonstationary Stochastic Shortest Path Problem with Terminal Cost

Transportation Science ◽

10.1287/trsc.36.2.218.562 ◽

2002 ◽

Vol 36 (2) ◽

pp. 218-230 ◽

Cited By ~ 29

Author(s):

James L. Bander ◽

Chelsea C. White

Keyword(s):

Shortest Path ◽

Heuristic Search ◽

Shortest Path Problem ◽

Stochastic Shortest Path ◽

Search Approach ◽

Stochastic Shortest Path Problem

Download Full-text

Comparative Analysis of Pathfinding Algorithms A *, Dijkstra, and BFS on Maze Runner Game

IJISTECH (International Journal Of Information System & Technology) ◽

10.30645/ijistech.v1i2.7 ◽

2018 ◽

Vol 1 (2) ◽

pp. 1 ◽

Cited By ~ 5

Author(s):

Silvester Dian Handy Permana ◽

Ketut Bayu Yogha Bintoro ◽

Budi Arifitama ◽

Ade Syahputra

Keyword(s):

Comparative Analysis ◽

Shortest Path ◽

Process Time ◽

Destination Node ◽

Comparison Process ◽

Breadth First Search ◽

Computing Process ◽

Start Node

Maze Runner game is a game that requires pathfinding algorithm to get to the destination with the shortest path. This algorithm is used in an NPC that will move from start node to destination node. However, the use of incorrect algorithms can affect the length of the computing process to find the shortest path. The longer the computing process, the longer the players have to wait. This study compared pathfinding algorithms A *, Dijkstra, and Breadth First Search (BFS) in the Maze Runner game. Comparison process of these algorithms was conducted by replacing the algorithm in the game by measuring the process time, the length of the path, and the numbers of block played in the existing computing process. The results of this study recommend which algorithm is suitable to be applied in Maze Runner Game.

Download Full-text

Scene Shortest Path Solutions Based on the Breadth First Search

Advanced Materials Research ◽

10.4028/www.scientific.net/amr.267.25 ◽

2011 ◽

Vol 267 ◽

pp. 25-29 ◽

Cited By ~ 1

Author(s):

Jing Hua Wen ◽

He Ling Jiang ◽

Mei Zhang ◽

Jun Ling Song

Keyword(s):

Data Structure ◽

Shortest Path ◽

Adjacency Matrix ◽

Shortest Path Problem ◽

Experimental Results ◽

Breadth First Search ◽

Storage Structure ◽

The City ◽

Complete Program

Breadth first search is one of the most convenient traversal methods of a graph, and the shortest path problem of the city map is a kind of traditional data structure problems. It was researched and analyzed that the breadth first search traversing algorithm which adopting the adjacency matrix as its storage structure, in VC++6.0 environment, the shortest path problem of a city map was solved with breadth first search of the graph based on the queue, and its complete program was realized in the machine. Experimental results show that taking the breadth first search to solution city shortest path is an easy to understand and feasible scheme, so it has certain popularize value.

Download Full-text

Graph and its Computer Application with C++ Using Linked Lists

Advanced Materials Research ◽

10.4028/www.scientific.net/amr.667.186 ◽

2013 ◽

Vol 667 ◽

pp. 186-192

Author(s):

Akash Shrivastava

Keyword(s):

Directed Graph ◽

Shortest Path ◽

Maximum Flow ◽

Digital Data ◽

Computer Application ◽

Graphical Form ◽

Computer Programme ◽

Breadth First Search ◽

Linked List ◽

Form Representation

An effort is made to develop a computer programme using C++ to explain the working of a adjacency linked-list representation of a directed graph or digraph and explain the allocation of data using C++. The program uses the concept of arranging a graph in the form of a linked list for the computer to understand the graphical form representation of any data. The graph algorithms are a significant field of interest within computer science. Typical higher level operations associated with graphs are; finding a path between two nodes, like depth-first search and breadth-first search and finding the shortest path from one node to another, like Dijkstra's algorithm. A solution to finding the shortest path from each node to every other node also exists in the form of the Floyd-Warshall algorithm. A directed graph can be seen as a flow network, where each edge has a capacity and each edge receives a flow. The Ford-Fulkerson algorithm is used to find out the maximum flow from a source to a sink in a graph. Conversion of a graph into a computer storable digital data is useful for nanodevices.

Download Full-text

Developing the Performance of Tiling Arrays

Methods, Models, and Computation for Medical Informatics ◽

10.4018/978-1-4666-2653-9.ch010 ◽

2012 ◽

pp. 159-169

Author(s):

Mohamed Abdelhamid Abbas

Keyword(s):

Shortest Path ◽

Tiling Array ◽

Dijkstra’S Algorithm ◽

A Algorithm ◽

Average Complexity ◽

Tiling Arrays ◽

Dijkstra's Algorithm ◽

Long Time ◽

Search Approach ◽

Minimal Tiling

Genomic tiling arrays are able to inspect the genome of haphazard species for which the sequence is known. The plan of proper oligonucleotide probes for such arrays is computationally difficult if features such as oligonucleotide quality and recurring regions are considered. Prior works have developed the minimal tiling path problem for the choice of oligonucleotides using Dijkstra’s shortest path algorithm to compute universal finest tiling paths from millions of candidate oligonucleotides on computers. Although Dijkstra’s algorithm works well, it is complicated and may take a long time for routers to process it and the efficiency of the network fails. In this paper, the author discusses a search approach that can decrease the average complexity time of tilling arrays. This aspiration is realized by searching for the shortest path to the probes using a faster algorithm. This paper enhances A* Algorithm and exploits the enhanced version, called A**, instead of Dijkstra’s algorithm. The enhanced version is more efficient and can decrease the average time complexity, thus increasing the performance of tiling array.

Download Full-text