Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Added Graph algorithms #13

Closed
wants to merge 6 commits into from
Closed

Added Graph algorithms #13

wants to merge 6 commits into from

Conversation

Abhi-1301
Copy link

@Abhi-1301 Abhi-1301 commented Oct 9, 2021

Added shortest path algorithms, minimum spamming tree algorithms and scc ones

@Abhi-1301 Abhi-1301 mentioned this pull request Oct 10, 2021
Copy link
Owner

@abxhr abxhr left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Please make the required changes

@@ -0,0 +1,90 @@
/*Articulation points are those vertices whose removal increases
Copy link
Owner

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

  • Change the location of all the files to Algorithms/graphs
  • The name of every file should not contain spaces in it.
    eg: Finding Articulation points.cpp could be finding_articulation_points.cpp

2. Articulation poit may or may not be end point of a bridge.
*/

#include <bits/stdc++.h>
Copy link
Owner

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

For every file committed, use the library which are required only. Don't import <bits/stdc++.h>

Comment on lines +10 to +34
#define ll long long int
#define pll pair<ll, ll>
#define vl vector<ll>
#define pb push_back
#define pp pop_back
#define f(i, a, b) for (ll i = a; i < b; ++i)
#define rev(i, a, b) for (ll i = a; i >= b; --i)
#define print(x) cout << x << endl
#define endl '\n'
#define F first
#define S second
#define setbits(x) __builtin_popcountll(x)
#define zerobits(x) __builtin_ctzll(x)
#define to(n) to_string(n)
#define low(v, n) lower_bound(v.begin(), v.end(), n) - v.begin()
#define upp(v, n) upper_bound(v.begin(), v.end(), n) - v.begin()
#define mod 1000000007
#define mex 100005
vl v[mex];
ll vis[mex] = {0};
ll in[mex] = {0};
ll low[mex] = {0};
ll timer = 0;
set<ll> cutpoint;

Copy link
Owner

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

For every file, use only the constants that are required in that code.

@Abhi-1301 Abhi-1301 closed this Mar 20, 2022
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

None yet

2 participants