×

Width:

Height:

Velocity:

max min

Start Node

Target Node

Wall Node

Key Terms

Graph

A data structure that represents relationships or connections between nodes (also called vertices) through edges (also called links or arcs). Graphs can be used to model various types of structures such as social networks, transportation systems, and computer networks.

Node (Vertex)

A fundamental unit of a graph that represents an entity, such as a person, place, or thing. Nodes are connected by edges to represent relationships or associations between entities.

Edge (Link)

A connection between two nodes in a graph that represents a relationship or association between the entities represented by the nodes. Edges can be directed or undirected, and can also have weights to represent the strength or cost of the connection.

Directed Graph

A graph where edges have a direction, indicating an asymmetric relationship between nodes. In a directed graph, each edge has an initial node (tail) and a terminal node (head).

Undirected Graph

A graph where edges do not have a direction, indicating a symmetric relationship between nodes. In an undirected graph, an edge simply connects two nodes without any specific direction.

Pathfinding-Visualizer Quiz

1. Which algorithm guarantees the shortest path?




2. Which search algorithms are guaranteed to find a path if one exists, but may not find the shortest path? (Choose all that apply)




3. Which search algorithm uses a heuristic function to guide its search and often finds a solution more quickly than other algorithms?




4. In a graph data structure, what is the term used to describe the number of edges connected to a node?




5. Which of the following graph traversal algorithms can be implemented using a stack data structure?