Skip to content
#

algorithm-competitions

Here are 136 public repositories matching this topic...

guyroznb
guyroznb commented Oct 4, 2020

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

<!

My Solutions to Leetcode problems. All solutions support C++ language, some support Java and Python. Multiple solutions will be given by most problems. Enjoy:) 我的Leetcode解答。所有的问题都支持C++语言,一部分问题支持Java语言。近乎所有问题都会提供多个算法解决。大家加油!:)

  • Updated Oct 4, 2020
  • C++
cpeditor
coder3101
coder3101 commented Aug 1, 2020

There are two sets of refactoring that can be performed on our codebase to make them more efficient and utilize the full potential offered by Qt Framework. See below:

  1. There is no need to explicitly call delete on widgets that are allocated on Heap as long as in their constructor we have specified the parent widget for it. Consider this example below:
class Widget: public QObject

Improve this page

Add a description, image, and links to the algorithm-competitions topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the algorithm-competitions topic, visit your repo's landing page and select "manage topics."

Learn more

You can’t perform that action at this time.