I strongly agree with you, I had no idea how I was supposed to have done KT until way after I finished it. I've just never been sure what to do differently about it because I think it is a very valuable project even though I've seen a lot of people with that same problem.

I like the idea of a more abstract graph project to warm up and am on board with your proposal, but before you proceed I'd like to see if any other @TheOdinProject/maintainers object.

I think it's potentially a cool idea, but I'd also be interested in seeing what this would like. One of the "challenges" maybe is that unlike the other structures talked about, graphs are very abstract and can have several different concrete implementations (which is why people can solve Knight Travails in a bunch of different ways).

@JoshDevHub

I think it could be like this:
Introduce the topic
Point at some resources to read if more detail is needed
A few paragraphs describing some common implementations (adjacency matrix etc)

Assignment begins - specify the implementation they should use for the exercise
I would like to write a visualiser method that displays a graph too. I think that would be really valuable, similar to pretty print in trees

Contributor

Just did this problem yesterday, and had to go to Reddit and StackOverflow to have a better idea on how to solve. Looking back, what are your thoughts around:

1. linking GeekforGeeks article - article not only tabulates the differences, but also uses the word "node" explicitly from the start, which might trigger learnings from previous lessons where you created a Node class / factory -> learner will feel familiarity and eventually come to conclusion that the "node" are positions on a chess board
2. hint thinking towards whether the knight's movements, represented as "nodes", should be directed or undirected (like whether the knight should be able to move in a "cycle", or it is more like the hockey example (see screenshot) in the existing Khan Academy article:
   
3. hint thinking that, if directed, how the learner could visually represent that to data structures they already know (essentially how to turn the graph into a tree-like structure). think about how many maximum valid moves are available at any given position (ans: 8).

This issue is stale because it has had no activity for the last 30 days.

My thoughts are that graphs is such a big topic we probably need more material to cover it for sure and at least one other project so I'm not against a warm up project where the focus is graph abstraction.

This issue is stale because it has had no activity for the last 30 days.

@damon314159 it seems nobody has voiced opposition to the idea, is this still something you're interested in doing?

Yes, I'm still interested in pursuing it

Have at it! Thanks!

This issue is stale because it has had no activity for the last 30 days.