Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

I believe that mentioning the adjacency list with this line can reall… #29058

Open
wants to merge 1 commit into
base: main
Choose a base branch
from

Conversation

massoncorlette
Copy link

@massoncorlette massoncorlette commented Nov 7, 2024

…y add a lot of value for this exercise, I struggled far too long overlooking the added line

Because

This PR

Issue

Closes #XXXXX

Additional Information

Pull Request Requirements

  • I have thoroughly read and understand The Odin Project curriculum contributing guide
  • The title of this PR follows the location of change: brief description of change format, e.g. Intro to HTML and CSS lesson: Fix link text
  • The Because section summarizes the reason for this PR
  • The This PR section has a bullet point list describing the changes in this PR
  • If this PR addresses an open issue, it is linked in the Issue section
  • If any lesson files are included in this PR, they have been previewed with the Markdown preview tool to ensure it is formatted correctly
  • If any lesson files are included in this PR, they follow the Layout Style Guide

…y add a lot of value for this exercise, I struggled far too long overlooking the added line
@github-actions github-actions bot added the Content: JavaScript Involves the JavaScript course label Nov 7, 2024
@rlmoser99 rlmoser99 requested review from a team and CouchofTomato and removed request for a team November 8, 2024 01:14
@@ -20,7 +20,8 @@ Thus, the problem of finding the shortest path for the knight’s movement becom
#### Vertices and Edges

The vertices in this graph are each of the possible positions on the chessboard, represented by a pair of coordinates like `[x, y]`, where x and y are between 0 and 7.
The edges are the valid knight moves between vertices. For example, from `[0,0]`, a knight can move to `[2,1]`, `[1,2]`, and so on. Each of these moves represents a connection between the vertex `[0,0]` and the other reachable vertices.
The edges are the valid knight moves between vertices. For example, from `[0,0]`, a knight can move to `[2,1]`, `[1,2]`, and so on. Each of these moves represents a connection between the vertex `[0,0]` and the other reachable vertices. Consider how you can use an adjacency list in
order to return the shortest path.
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Is there a reason this is on a new line?

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
Content: JavaScript Involves the JavaScript course
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants