hi David, I think (2,2) isn't a very interesting counter example,. if no loops and no multiple edges are allowed, the degree of a node must be less than the number of nodes,

Why don't we get this error on calculators? Is it because calculators don't store numbers?

Would you tell me what books are behind you?

You are THE GOAT

I've better for you: use the decimal standard module, with the Decimal class.

This is great! Thank you very much!

I really can't believe that there's such a function and it is standard.

I am working on a small project, was not sure how to go further your video helped a lot. Thanks man!

Hi David, I am a bit surprised. In your video the nodes have labels (1,2,3, etc) but the python code has no such assignment. Is this a mistake on my part?

1:25 that's the exact same thing I also feel. That's why I'm here looking for this series.

Amazing material!

legend

I have it.

Awesomatic video

Hello. In case you're wondering, your face looks a lot like mine)

Another great video, well worth the time, thanks.

I enjoyed this quite a bit. I thought the Python could have been a bit more "dumbed down" to be more approachable for others (since you clearly are quite good at it), but that's a minor quibble. I was able to follow it. I also enjoyed the historical details, as another poster mentioned.

noice, i've been obsessed trying to explain people how graphs are the epitome of real applications of maths, i'm an engineer so i couldn't are less about axioms and arbitrary mathematician tricks, your channel is a breath of fresh air, i only found idiots such as the sourcerer and other narcissists... thanks

Thank you so much

Real Python is great!

Euler was such a badass

Nice, only if it was louder 😊

I have that book! Bought it several years ago. RJ

Wow ... thanks lot

Could you review Reinhard Diestel any edition ? Then it would be interesting to have a playlist of a Survey over course-required texts across the major Ivys / Polytechnics; book:101-class /per video, with comparison and wrap up at series end.

Please continue Sir. Eventually if you can start a series on Directed Acyclic Graphs and Causal Calculus, I would be so happy.

you seem a genuinly good person and mostly you are very clear. thank you david!

Ctidp

def radio_labeling(order, diameter): labels = [0] * order # Assign label 1 to vertex 0 labels[0] = 1 # Assign label 2 to the neighbors of vertex 0 for i in range(1, min(diameter + 1, order)): labels[i] = 2 # Assign labels to the remaining vertices for i in range(diameter + 1, order): # Check the labels of neighbors used_labels = set() for neighbor in range(i - diameter, i): used_labels.add(labels[neighbor]) # Find the smallest unused label j = 1 while j in used_labels: j += 1 # Assign the label to the current vertex labels[i] = j return labels # Example usage order = 10 # Number of vertices in the graph diameter = 3 # Diameter of the graph labels = radio_labeling(order, diameter) print(labels)

Thank you for helping your video sir. Can you send me radio labeling algorithm using python ?

Thank you for this serie can you do a video about finding cycles in graphs ?

The best video I have seen so far on graph representation in Python. Thank you!

Awesome video

Do visdcc plz

Great series.. But please lose the music.. Ahhhhh

Actually comparison of floating point defaults linguistically to exact comparisons without tolerance. Comparing those is also interesting as NaN and even +/-zero must be checked first. Not to mention inequalities. What you are showing is inexact comparison which practically useful, it's way too misleading to say this is how to compare floats. In some contexts this method would cause a system failure. NASA won't be hiring you if you disregard exact comparison, needless to say

i find that i've actually never had to check equality of floats, except 0.f or 1.f when i know i just assigned it i try to keep as few floats in my code as possible for consistency

The other common way to deal with this is to not use floats, and instead use a type that basically avoids the base translation (accepting that it uses a bit more memory). Imagine using four bits per decimal digit (16 possible values, but only 10 used in practice). The actual implementation is no doubt more efficient, but this shows that it's at least possible.

Such a mess!!

Try comparing 0.1 + 0.2 == 0.3 in C -> it returns true. :O So why C, which uses the very same IEEE 754 standard for floating point numbers, returns the correct answer, where Python, Javascript and other interpreted programming languages gossip?

really well explained and lots of new information for me, thanks a lot and keep up the good work! :)

Awesome video! Quite interesting :) Really hope to see more of your videos!

What about just using a real language ?

Just got it recommended, great content! Shame that you stopped making it

If I found this on my own I would have indeed smashed my keyboard into my computer last time I compared something that I used .lower() on to something with a capital letter, took me an hour to find ='D

◽️

Please can you recommend any book with only results, formulas and theorems on graph theory ?

Thanks, very very very goood!

hii, I am taking a graph course in my university and from now on I'm watching your videos to get along with python etc. I just would like to know why is it necessary to declare a variable in available_bridhes and iterate over it, like: available_bridges = [ bridge for bridge in bridges: ] not simply: available_bridges = [ for bridge in bridges ]