I am a Computer Engineer with a Master's in IT who changed careers to Nursing, got a Master's degree in Nursing Informatics and have learned more relevant coding from your videos than from my entire college catalog. Love what you do, you make it so entertaining and fun to learn, keep it up Mr. Shiffman!
Daniel, this BFS tutorial is golden. You have a great ability to make deceptively simple-looking topics become truly easy to understand. One of the best programming channels!
This one took me the longest to get through. for some reason got very stuck, got through the rest of the list a couple other playlists. and finally . still love it included an array of new things, "while" statements not used much. got very hung up on this one
love these two videos! watched all the way to the end. I was recently making my own implementation of BFS and i discovered that I could speed up the algo by realizing: before pushing the graph edges into the queue, you can check the edges' value and break out early if found.
I'm really loving you videos, keep it up! I have to admit that I enjoy your content covering algorithms such as A* the most, and I was wondering if you could consider doing a series on different types of sorting algorithms (quicksort, radix(!), bubble)? I think it would look very good in Processing/P5! Cheers.
Hey Dan or whoever......I'm quite new to JS ........in the graph constructor .......what exactly is "this.graph = {}" & what does it do/how does it function ?
right thanks!......I've since seen part 1 .......which led me to a vid on associative arrays.......I think i get the key:value object idea...... doesn't seem too hairy......is like css format.......though I never seen him use that approach/technique except maybe once or twice
I think there is an option in Atom allowing you to scroll past the end of the file. (You wouldn't have to press return so many times to push the file up)
Hi, so I've been making my own game lately with P5.js, and I was wondering how I would get the enemies in my game to follow/walk towards my character object, thanks
i was doing some challenges with p5 of my own, I needed to ask, are there events like mouseHover on something I draw, e.g, mouseHover on a line I draw. I am doing that with a ugly if else with mouseX and mouseY
Hello! I just finished watching your socket.io tutorials and I've learned alot, but I still have two questions: 1. How do I send data back only to the socket, which send it? 2. How to host this on online hosting?
Breadth-first search is reasonably good for solving mazes, but I think A* would work better because of the heuristic that it uses. It really depends on the maze itself (e.g. does it have loops, dead ends, straight long corridors, lots of turns, long segments without branching, etc.)
Relational databases (where tables are indexed) usually use binary trees. So when it starts looking up a value, it compares the value with the middle of the data, if it's less or more, you just eliminated half of the data, then you do the same with the next node until you find the data you're looking for, so it's a lot faster than searching the entire table. And each node in the binary tree has a pointer to the other fields in that row. If you're searching for something that's not indexed, you usually have to search the entire table, so it's less efficient.
similar situation here, i code in c++ but its still very useful to have this and often times i can figure out the code in the appropriate language, i'd say just keep watching for anyway for the concepts that he covers
You can try using Processing.py to follow along with his tutorials If you are using python for Data Science or Machine Learning, I recommend Siraj Raval's videos. You should try searching PYthon tutorials and I'm sure you'd find plenty of other youtubers as well. However, PYthon as a language is moving towards being entirely for machine learning, so if your interesting in creative coding, I'd recoomend leaning a language like Javascript (with p5js), Java (with opengl/processing), C# (with Unity), or C++ (Unreal Engine/OpenGL). If you are already comfortable with one language, learning a new language is really easy.
To add to what Ritoban said, these videos are not really about the syntax and I as a python 3 user have had no trouble following along and implementing anything I've tried to. If you are decent with python, and understand how python uses OOP, everything he teaches is relatable, and if it isn't the general concepts covered are really good stuff. If you *don't* already know python fairly well and aren't comfortable with both OOP and python's way of implementing it, you should really take Ritoban's advice and seek some of the videos he mentions. I don't however feel the same way about the future of python, but he may have a more informed opinion. I think python and processing.py are great for creative uses
Alright then. I just started trying to learn Python 3, and am taking an online course for it (SoloLearn), and I would love to do this kind of thing, but I don't want to apply it to ONLY websites :( Also I'm having issues even getting VS Code to run simple Jscripts.
Nice video! Have a lot of fun following. I tried to clean a bit the code. I encapsuled all the BFS logic in a method and removed the need to reset the graph after each search. Code can be found here: github.com/infantix/P5JS/tree/master/Breadth-First%20Search
![Apple ][ Coding Challenge: Fractal Tree](http://i.ytimg.com/vi/UNkHditYGls/mqdefault.jpg)
I am a Computer Engineer with a Master's in IT who changed careers to Nursing, got a Master's degree in Nursing Informatics and have learned more relevant coding from your videos than from my entire college catalog. Love what you do, you make it so entertaining and fun to learn, keep it up Mr. Shiffman!
JSano19 - Gamer, Nurse, Fire Fighter what is your age now?
why did you switch to nursing from a engg degree? whats nursing btw?
There's few people who can bring topis like this with your enthusiasm. Looking forward to binge watching this whole channel. Thanks!
Daniel, this BFS tutorial is golden. You have a great ability to make deceptively simple-looking topics become truly easy to understand. One of the best programming channels!
Thank you, Shiffman! You're an angel! You made it so simple!
My go to channel when I have questions about the functionality of any kind of algorithm. You saved me a lot of brain time.
Always brightens my day when I see a new video on the channel! Loved this tutorial, thanks Dan!
You are the exact professor or teacher (or whatever ) i really want.. Lovable video nd ur attitude..... :)
This one took me the longest to get through. for some reason got very stuck, got through the rest of the list a couple other playlists. and finally . still love it included an array of new things, "while" statements not used much. got very hung up on this one
You know how to make the most boring topics interesting to watch and learn. Thank you! really
You deserve the upvote :) Thank you for still being cheerful after 68.2 challenges!
love these two videos! watched all the way to the end. I was recently making my own implementation of BFS and i discovered that I could speed up the algo by realizing: before pushing the graph edges into the queue, you can check the edges' value and break out early if found.
First time I see someone coding and enjoy that.
Both videos watched from start to finish, thanks..
Thanks Shiff! Going through all these videos. Learning a lot!
Love the passion in your videos. Keep it up!
I'm really loving you videos, keep it up! I have to admit that I enjoy your content covering algorithms such as A* the most, and I was wondering if you could consider doing a series on different types of sorting algorithms (quicksort, radix(!), bubble)? I think it would look very good in Processing/P5! Cheers.
I have an idea for one of the next coding challenges, Tetris! It's an interesting game to recreate
Good job with this one! loved how it was in 3 parts, as it makes it easier to understand
Awesome job and yes, I made it all the way through! Loving your channel.
Love your videos Thankyou so much for the effort you put on those :D
Had fun watching this video, now we can extend it to the Bacon-Erdos Number!
Excellent! way of explaining #Real World Scenario#NotBored#Funfilled. Much Appreciated!.
This video is unlisted on your channel yet you linked it in your video thanks! I didn't want to have to wait for you to publish it publicly.
( entire play list ) === " PURE GOLD" ? "I am Happy " : " " ;
output : I am Happy.
best teacher
Thank you so much 🙏🙏🙏
Hey Dan or whoever......I'm quite new to JS ........in the graph constructor .......what exactly is "this.graph = {}" & what does it do/how does it function ?
right thanks!......I've since seen part 1 .......which led me to a vid on associative arrays.......I think i get the key:value object idea...... doesn't seem too hairy......is like css format.......though I never seen him use that approach/technique except maybe once or twice
I love it when you think you solved a bug in your program and it disappointingly fails even if you are 100% sure you fixed it XD
You are amazing. super smart. Thank you
I was searched exactly this video.. Ohh my goddddd.....!!! damn you always do very interesting videos!!!! I love you. keep doing it)))))
make a video for depth first search and backtracking algorithm.
awesome video...thank you for your effort
I think there is an option in Atom allowing you to scroll past the end of the file. (You wouldn't have to press return so many times to push the file up)
Which you activated, yay
Why in js is the keyword for class function?
Hi, so I've been making my own game lately with P5.js, and I was wondering how I would get the enemies in my game to follow/walk towards my character object, thanks
i was doing some challenges with p5 of my own, I needed to ask, are there events like mouseHover on something I draw, e.g, mouseHover on a line I draw.
I am doing that with a ugly if else with mouseX and mouseY
its like routing tables on routers :)
How do we know it is, in fact, the shortest path?
When 02_bfs_oop_fdg test file is executed
graph.setStart (thom);
graph.setEnd (you);
Why can not I find it?
does anyone know what font is used (algorithm) in the wikipedia page?
coding challenge idea; lissajous pattern in js/processing!
you should program an example of the chaos theory!
Hey! How do you record the screen on your laptop? I am sure you need to do that to use the greenscreen.
Hello! I just finished watching your socket.io tutorials and I've learned alot, but I still have two questions:
1. How do I send data back only to the socket, which send it?
2. How to host this on online hosting?
WIPocket, The WIZzard I already found out how to send back to a socket: io.to(socket).emit
Daniel -- You showed us how to put the canvas inside a specific div, but how do I size the canvas to fit within that divs width/height?
Thanks! I used jquery to get the width/height in a var and then used the var in createCanvas. Worked like a charm.
or use css and make width and height 100 %
What do you mean?
HTML:
CSS:
#parentdiv {
width: 600px; // change this if you want
height: 600px; // change this if you want
}
#childcanvas {
width: 100%;
height: 100%;
}
where can i download your background
why don't you use forEach()?
Great vid , I learned a few things :-)
what if you used a maze for the graph would it be an efficient system?
Breadth-first search is reasonably good for solving mazes, but I think A* would work better because of the heuristic that it uses. It really depends on the maze itself (e.g. does it have loops, dead ends, straight long corridors, lots of turns, long segments without branching, etc.)
Where is the Kevin bacon file?
You can find it here! thecodingtrain.com/CodingChallenges/068.2-bfs-kevin-bacon (check under "view code")
thx! :) my head hurts.. but thx! :)
20:35 the sound of disappointment + exhaustion.
haha, so true
#SixDegreesOfKevinBaconBreadthFirstSearchAlgorithmWhatever Great video Daniel!
Amazing!!
Is this how relational databases work?
Relational databases (where tables are indexed) usually use binary trees. So when it starts looking up a value, it compares the value with the middle of the data, if it's less or more, you just eliminated half of the data, then you do the same with the next node until you find the data you're looking for, so it's a lot faster than searching the entire table. And each node in the binary tree has a pointer to the other fields in that row. If you're searching for something that's not indexed, you usually have to search the entire table, so it's less efficient.
Delaunay Triangulation could be cool to solve for a coding challenge.
alma rodriguez I'm trying that now. It's such a tough nut to crack, for me at least.
What's going on man? You havn't uploaded anything now for a while :(
Great!!!!
New Here, whats your upload schedule like?
nice good vid
I love this guy's videos. But I'm learning python D: is there someone like this guy for Python?
similar situation here, i code in c++ but its still very useful to have this and often times i can figure out the code in the appropriate language, i'd say just keep watching for anyway for the concepts that he covers
You can try using Processing.py to follow along with his tutorials If you are using python for Data Science or Machine Learning, I recommend Siraj Raval's videos. You should try searching PYthon tutorials and I'm sure you'd find plenty of other youtubers as well. However, PYthon as a language is moving towards being entirely for machine learning, so if your interesting in creative coding, I'd recoomend leaning a language like Javascript (with p5js), Java (with opengl/processing), C# (with Unity), or C++ (Unreal Engine/OpenGL). If you are already comfortable with one language, learning a new language is really easy.
To add to what Ritoban said, these videos are not really about the syntax and I as a python 3 user have had no trouble following along and implementing anything I've tried to. If you are decent with python, and understand how python uses OOP, everything he teaches is relatable, and if it isn't the general concepts covered are really good stuff.
If you *don't* already know python fairly well and aren't comfortable with both OOP and python's way of implementing it, you should really take Ritoban's advice and seek some of the videos he mentions. I don't however feel the same way about the future of python, but he may have a more informed opinion. I think python and processing.py are great for creative uses
Alright then. I just started trying to learn Python 3, and am taking an online course for it (SoloLearn), and I would love to do this kind of thing, but I don't want to apply it to ONLY websites :( Also I'm having issues even getting VS Code to run simple Jscripts.
20:52 lowkey rap god.
lucky i left Engeneering, i think i could never handle these things!
but i have respect for them...
Story of your life please
why are you not posting videos.
Am I the only one who wanted to badly hear the This Dot song?
i love your videos #sixdegreesofkevinbaconbreathfirstsearchalgorithmwhatever
applause applause
Code Atari Breakdown and Pacman Please.
#codechallenge
#10min
#pacman
#ataribreakdown
20:50 lol
why has it been a long time since posting a video
this.KevinBacon
Nice video! Have a lot of fun following. I tried to clean a bit the code. I encapsuled all the BFS logic in a method and removed the need to reset the graph after each search. Code can be found here: github.com/infantix/P5JS/tree/master/Breadth-First%20Search
Nice work! You can submit a link to the coding train website if you like!
github.com/CodingTrain/website/wiki/Community-Contributions-Guide
#SixDegreesOfKevinBaconBreadthFirstSearchAlgorithmWhatever
This series is lacking in depth.
A sun child also added.
#SixDegreesOfKevinBaconBreadthFirstSearchAlgorithmWhatever
#SixDegreesOfKevinBaconBreadthFirstSearchAlgorithmWhatever
#SixDegreesOfKevinBaconBreadthFirstSearchAlgorithmWhatever
#SixDegreesOfKevinBaconBreadthFirstSearchAlgorithmWhatever
#SixDegreesOfKevinBaconBreadthFirstSearchAlgorithmWhatever