There are some interesting algorithms in simulation from Physics, Chemistry, and Engineering especially regarding Monte Carlo simulation: Heat Bath algorithm, Metro-Police algorithm, Markov Chain Monte Carlo, etc.

This is a(n):

• New algorithm
• Update to an existing algorithm
• Error
• Proposal to the Repository

Details:

We can make a file may be READ.

From a comment I got on YouTube that needs investigation:

"If the graph has 3 nodes - 0, 1, 2 and the indegree and outdegree of all the nodes are 0. Then, there is an empty Eulerian path, but the code results in "0". Do you think findStartNode() can be enhanced to handle this edge case?"

Relevant Videos:

Euler path/circuit existence: https://youtu.be/xR4sGgwtR2I
Euler path/circuit algori

I'd suggest a better differentiation between Best and Breadth First Search in the Graphs section.

Acronyms BFS and DFS are used all over the place, but "breadth" and "depth" aren't mentioned anywhere, making it hard for a newcomer to understand what is being referred to.

steps to reproduce

Write a loop, from 1 to 80000, each time add a random int to the max heap.

In theory it takes very little time(NlogN, N=80000, <1sec ), but the program does take a long time.

I'v also tested the BinaryHeap in https://github.com/SolutionsDesign/Algorithmia, it performs well, so it is probably due to the bad algorithm.

7 algorithms and data structures every programmer must know

Link above in readme has outdated link and website does not work.

First off, this is friggin' cool!

I would love to see three things here:

1. Benchmarks to compare how long each method takes.

2. A brief explanation of what each method is doing and how they differ (maybe strengths/weaknesses).

3. Easily change the dataset size from 10 to 100, to maybe 1,000 or 10,000.

So cool! Great job! 👏 👏