[challenge] erdoes number 👫👬👬👬👬👬1⃣2⃣3⃣4⃣5⃣6⃣

Question

Paul Erdoes was an Hungarian mathematic.
He published very much.
He has erdoes number 0.
Everyone who published together with him, has erdoes number 1
everyone who publishes with an erdoes-number 1 gets erdoes number 2...

which are the erdoes numbers of the following if they published this kind:

Algo: Ben, Cli, Erdoes, Ful
Ben: Algo, Cli, Gogo
Cli: Algo, Ben, Dodo
Dodo: Cli, Ful, Erdoes
Erdoes: Algo,Dodo
Ful: Dodo,Algo, Hum
Gogo: Ben, Hum
Hum:Ful,Gogo

Answer 1

@sayan lowest number counts

if no number than number is infinity

Answer 2

I did it with van Rossums shortest path
The details are here:

https://www.python.org/doc/essays/graphs/

And this is my implementation
https://code.sololearn.com/c6zFc27R9XYq/#py

Answer 3

@sayan congrats! solution is right!

Answer 4

@ sayan nice, DFS is what I had in mind as well. You are always the master of concise codes...I prefer a bit more clarity. :)

Answer 5

Nice little challenge, here is my code.

https://code.sololearn.com/cHyXy6K3tlvG/?ref=app

Answer 6

@ Erik...
comments added for grasp..
thanks for your words✌

Answer 7

@ oma..
heres mine

https://code.sololearn.com/cc7yZ3WWZDS4/?ref=app

Answer 8

my try.
https://code.sololearn.com/c2216Y5eqGW6/?ref=app

Answer 9

@ batman

hers my 2nd version...
smallest and most efficient so far..

(( assuming the given data as tree..its the BREADTH FIRST SEARCH method applied))

https://code.sololearn.com/cp4F70kk8Oql/?ref=app

Answer 10

woohooo
relieved..