Day 369 - Teaching Kids Programming - Minimum Starting Nodes to Visit Graph (Topological Sort, Indegree)

in blurt •  3 years ago 

第369天 教娃编程 - 访问图的最少起始节点(拓扑排序、入度)

--->List of All Tutorial Videos<---

Post: Day 369 - Teaching Kids Programming - Minimum Starting Nodes to Visit Graph (Topological Sort, Indegree)

^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ Thank you for reading ^^^^^^^^^^^^^^^

NEW! Following my Trail (Upvote or/and Downvote)

Follow me for topics of Algorithms, Blockchain and Cloud.
I am @justyy - a Steem Witness
https://steemyy.com

My contributions

Delegation Service

Voting Power Considered in Voting Schema and Important Update of Delegation Service!

  • Delegate 1000 to justyy: Link
  • Delegate 5000 to justyy: Link
  • Delegate 10000 to justyy: Link

Support me

If you like my work, please:

  1. Delegate SP: https://steemyy.com/sp-delegate-form/?delegatee=justyy
  2. Vote @justyy as Witness: https://steemyy.com/witness-voting/?witness=justyy&action=approve
  3. Set @justyy as Proxy: https://steemyy.com/witness-voting/?witness=justyy&action=proxy
    Alternatively, you can vote witness or set proxy here: https://steemit.com/~witnesses

Authors get paid when people like you upvote their post.
If you enjoyed what you read here, create your account today and start earning FREE BLURT!
Sort Order:  
  ·  3 years ago  ·  

Thank you, your post has been upvoted by @blurttribe.

Curated manually by @obikay

blurtpic_1638724859649.png
:::Discord :::Whatsapp :::Facebook Page

You can delegate blurt power to @blurttribe to support curation