Added a cpp file for Floyd Algorithm for cycle detection Description of Change

Checklist

• Added de

The UI of the scatterplot has got more ugly between 3.4 and the current development version.

To Reproduce

Steps to reproduce the behavior: create any scatterplot facet.

Current Results (master)

Expected Behavior (3.4)

![image](https://user-images.githubuserconten

Welcome to JavaScript community

Describe your change:

• Add an algorithm?
• Fix a bug or typo in an existing algorithm?
• Documentation change?

Checklist:

• I have read CONTRIBUTING.md.
• This pull request is all my own work -- I have not plagiarized.
• I know that p

Description of Change

1. adding new feature - articulation point algorithm. In a graph, a vertex is called an articulation point if removing it and all the edges associated with it results in the increase of the number of connected components in the graph. For example consider the graph given in following figure.
2. moving the GraphRep struct from Graph.c to Graph.h

References

<!

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.

Hi, I'm not sure if more platforms are interesting to you, but I've made a slightly more complete implementation of padding a struct to the cache line size here:

https://github.com/tinco/cache_line_size

I got the information on the cache line sizes from the Go compiler repository, so I'm pretty sure these are correct for all platforms Go runs on, which is a whole bunch.

Aforementioned article lacks the technical interview round questions. It needs to be comprehensive covering questions across all rounds. Anyone taking this issue must follow the contributing guidelines.