Faster access than browser!
24 relations: Backtracking, Bipartite graph, Breadth-first search, Call stack, Cheney's algorithm, Computer science, Connected component (graph theory), Cuthill–McKee algorithm, Dense graph, Depth-first search, Flood fill, Flow network, Ford–Fulkerson algorithm, Graph (discrete mathematics), Maximum flow problem, Maze generation algorithm, Planarity testing, Queue (abstract data type), Recursion (computer science), Regular graph, Shortest path problem, Topological sorting, Travelling salesman problem, Tree traversal.
Backtracking
Backtracking is a general algorithm for finding all (or some) solutions to some computational problems, notably constraint satisfaction problems, that incrementally builds candidates to the solutions, and abandons a candidate ("backtracks") as soon as it determines that the candidate cannot possibly be completed to a valid solution.
New!!: Graph traversal and Backtracking · See more »
Bipartite graph
In the mathematical field of graph theory, a bipartite graph (or bigraph) is a graph whose vertices can be divided into two disjoint and independent sets U and V such that every edge connects a vertex in U to one in V. Vertex sets U and V are usually called the parts of the graph.
New!!: Graph traversal and Bipartite graph · See more »
Breadth-first search
Breadth-first search (BFS) is an algorithm for traversing or searching tree or graph data structures.
New!!: Graph traversal and Breadth-first search · See more »
Call stack
In computer science, a call stack is a stack data structure that stores information about the active subroutines of a computer program.
New!!: Graph traversal and Call stack · See more »
Cheney's algorithm
Cheney's algorithm, first described in a 1970 ACM paper by C.J. Cheney, is a stop and copy method of tracing garbage collection in computer software systems.
New!!: Graph traversal and Cheney's algorithm · See more »
Computer science
Computer science deals with the theoretical foundations of information and computation, together with practical techniques for the implementation and application of these foundations.
New!!: Graph traversal and Computer science · See more »
Connected component (graph theory)
In graph theory, a connected component (or just component) of an undirected graph is a subgraph in which any two vertices are connected to each other by paths, and which is connected to no additional vertices in the supergraph.
New!!: Graph traversal and Connected component (graph theory) · See more »
Cuthill–McKee algorithm
In numerical linear algebra, the Cuthill–McKee algorithm (CM), named for Elizabeth Cuthill and James, page 6 McKee,E.
New!!: Graph traversal and Cuthill–McKee algorithm · See more »
Dense graph
In mathematics, a dense graph is a graph in which the number of edges is close to the maximal number of edges.
New!!: Graph traversal and Dense graph · See more »
Depth-first search
Depth-first search (DFS) is an algorithm for traversing or searching tree or graph data structures.
New!!: Graph traversal and Depth-first search · See more »
Flood fill
Flood fill, also called seed fill, is an algorithm that determines the area connected to a given node in a multi-dimensional array.
New!!: Graph traversal and Flood fill · See more »
Flow network
In graph theory, a flow network (also known as a transportation network) is a directed graph where each edge has a capacity and each edge receives a flow.
New!!: Graph traversal and Flow network · See more »
Ford–Fulkerson algorithm
The Ford–Fulkerson method or Ford–Fulkerson algorithm (FFA) is a greedy algorithm that computes the maximum flow in a flow network.
New!!: Graph traversal and Ford–Fulkerson algorithm · See more »
Graph (discrete mathematics)
In mathematics, and more specifically in graph theory, a graph is a structure amounting to a set of objects in which some pairs of the objects are in some sense "related".
New!!: Graph traversal and Graph (discrete mathematics) · See more »
Maximum flow problem
In optimization theory, maximum flow problems involve finding a feasible flow through a single-source, single-sink flow network that is maximum.
New!!: Graph traversal and Maximum flow problem · See more »
Maze generation algorithm
Maze generation algorithms are automated methods for the creation of mazes.
New!!: Graph traversal and Maze generation algorithm · See more »
Planarity testing
In graph theory, the planarity testing problem is the algorithmic problem of testing whether a given graph is a planar graph (that is, whether it can be drawn in the plane without edge intersections).
New!!: Graph traversal and Planarity testing · See more »
Queue (abstract data type)
In computer science, a queue is a particular kind of abstract data type or collection in which the entities in the collection are kept in order and the principal (or only) operations on the collection are the addition of entities to the rear terminal position, known as enqueue, and removal of entities from the front terminal position, known as dequeue.
New!!: Graph traversal and Queue (abstract data type) · See more »
Recursion (computer science)
Recursion in computer science is a method of solving a problem where the solution depends on solutions to smaller instances of the same problem (as opposed to iteration).
New!!: Graph traversal and Recursion (computer science) · See more »
Regular graph
In graph theory, a regular graph is a graph where each vertex has the same number of neighbors; i.e. every vertex has the same degree or valency.
New!!: Graph traversal and Regular graph · See more »
Shortest path problem
In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized.
New!!: Graph traversal and Shortest path problem · See more »
Topological sorting
In the field of computer science, a topological sort or topological ordering of a directed graph is a linear ordering of its vertices such that for every directed edge uv from vertex u to vertex v, u comes before v in the ordering.
New!!: Graph traversal and Topological sorting · See more »
Travelling salesman problem
The travelling salesman problem (TSP) asks the following question: "Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city and returns to the origin city?" It is an NP-hard problem in combinatorial optimization, important in operations research and theoretical computer science.
New!!: Graph traversal and Travelling salesman problem · See more »
Tree traversal
In computer science, tree traversal (also known as tree search) is a form of graph traversal and refers to the process of visiting (checking and/or updating) each node in a tree data structure, exactly once.
New!!: Graph traversal and Tree traversal · See more »
Redirects here:
Graph exploration algorithm, Graph search, Graph search algorithm, Node traversal.
References
[1] https://en.wikipedia.org/wiki/Graph_traversal
