Elementary Combinatorial Algorithms

In this book chapter, we present elementary algorithms for searching and exploring a graph. Our focus is on the following searching algorithms: The breadth-first search and the depth-first search. Before this, we learn how to represent a graph in a way that we can use such a representation as an input for the searching algorithm.

Related Organizations

University of Jordan
Jordan

Keywords

Graph representations, Testing bipartiteness, Depth-first search algorithm, Breadth-first search algorithm, Elementary Combinatorial Algorithms, Computing shortest paths, Computing spanning trees, Finding connected components, Detecting cycles, Topological sorting

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	0
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average