Monday 18 February 2019

Graph Properties

A graph can be connected, strongly connected and a graph can have different properties ...

Connected undirected graph : An undirected graph is said to be connected connected if there is a path from every vertex to every other vertex.

A component : A component of a graph is a maximal subset of the vertices such that every vertex is reachable from each other vertex in the component.

Strongly connected directed graph : A directed graph is said to be strongly connected if there is a path from every vertex to every other vertex.

A strongly connected component of a directed graph : is a vertex u and the collection of all vertices v such that there is a path from u to v and a path from v to u.
at
Labels:

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)

std::next_permutation(arr.begin(),arr.end());

What is next_permutation(a.begin(),a.end()) ? Next permutation is like what its name says, finds the next permutation of a and assigns ...

  • __int128_t and __float128 in GNU
    Usage of __int128_t: supports really big intermediate numbers, from -2^128 + 1 to 2^128 - 1 it has 128 bits Usage of __float128 : ...
  • Extensions of GNU
    Here are some extensions that I have found. Some of them are more useful than others. indexed set power(x,y) rope indexed set is j...
  • Fastest way to read input from stdin C++
    Method 1 : A noob's way : #include <iostream> using namespace std; int main(){     int nb,a;     cin >>...