An Improved Technique for Generating Test Cases with Depth-First Search Algorithms

2019 ◽  
Vol 09 (07) ◽  
pp. 1245-1254
Author(s):  
婷婷 王
1986 ◽  
Vol 9 (1) ◽  
pp. 85-94
Author(s):  
Robert Endre Tarjan

Many linear-time graph algorithms using depth-first search have been invented. We propose simplified versions of two such algorithms, for computing a bipolar orientation or st-numbering of an undirected graph and for finding all feedback vertices of a directed graph.


2020 ◽  
Vol 21 (1) ◽  
Author(s):  
Sarah M. Kim ◽  
Matthew I. Peña ◽  
Mark Moll ◽  
George N. Bennett ◽  
Lydia E. Kavraki

Abstract Background The rapid growth of available knowledge on metabolic processes across thousands of species continues to expand the possibilities of producing chemicals by combining pathways found in different species. Several computational search algorithms have been developed for automating the identification of possible heterologous pathways; however, these searches may return thousands of pathway results. Although the large number of results are in part due to the large number of possible compounds and reactions, a subset of core reaction modules is repeatedly observed in pathway results across multiple searches, suggesting that some subpaths between common compounds were more consistently explored than others.To reduce the resources spent on searching the same metabolic space, a new meta-algorithm for metabolic pathfinding, Hub Pathway search with Atom Tracking (HPAT), was developed to take advantage of a precomputed network of subpath modules. To investigate the efficacy of this method, we created a table describing a network of common hub metabolites and how they are biochemically connected and only offloaded searches to and from this hub network onto an interactive webserver capable of visualizing the resulting pathways. Results A test set of nineteen known pathways taken from literature and metabolic databases were used to evaluate if HPAT was capable of identifying known pathways. HPAT found the exact pathway for eleven of the nineteen test cases using a diverse set of precomputed subpaths, whereas a comparable pathfinding search algorithm that does not use precomputed subpaths found only seven of the nineteen test cases. The capability of HPAT to find novel pathways was demonstrated by its ability to identify novel 3-hydroxypropanoate (3-HP) synthesis pathways. As for pathway visualization, the new interactive pathway filters enable a reduction of the number of displayed pathways from hundreds down to less than ten pathways in several test cases, illustrating their utility in reducing the amount of presented information while retaining pathways of interest. Conclusions This work presents the first step in incorporating a precomputed subpath network into metabolic pathfinding and demonstrates how this leads to a concise, interactive visualization of pathway results. The modular nature of metabolic pathways is exploited to facilitate efficient discovery of alternate pathways.


This paper is about implementing pacman game with AI.The Game Pac-Man is a very challenging video game that can be useful in conducting AI(Artificial Intelligence) research. Here,the reason we have implemented various AI algorithms for pacman game is that it helps us to study AI by using visualizations through which we can understand AI more ef- fectively.The main aim is to build an intelligent pacman agent which finds optimal paths through the maze to find a particular goal such as a particular food position,escaping from ghosts.For that, we have implemented AI search algorithms like Depth first search,Breadth first search,A*search,Uniform cost search.We have also implemented multi-agents like Reflex agent,Minimax agent,Alpha-beta agent.Through these multiagent algorithms,we can make pacman to react from its environmental conditions and escape from ghosts to get high score.We have also done the visualization part of the above AI algorithms by which anyone can learn and understand AI algorithms easily.For visualisation of algorithms,we have used python libraries matplotlib and Networkx.


Compiler ◽  
2014 ◽  
Vol 3 (2) ◽  
Author(s):  
Muhammad Syaifuddin ◽  
Anton Setiawan Honggowibowo

It is a must for children (infants and toddlers) to get more attention due to their health because their body’s protections are not yet strong. This makes them susceptible for germs, bacteria, and viruses attacks. Those attacks cause disease. This disease symptom could appear all of sudden to the children. It makes their parents afraid, especially for those who have less sensitiveness for the symptom. For this reason, I make an application based on android smartphone expert system to provide information on type of disease, treatment, and prevention based on the symptoms given. This application uses forward chaining and backward chaining inference engine to make conclusion, and Depth First Search algorithms for searching the method. The result shows that this application could help parents in giving some information about common diseases attacked to infants and toddlers. This application facilitates them in delivering information which can be accessed anywhere as first aid for infants and toddlers who indicated disease.


Sign in / Sign up

Export Citation Format

Share Document