Strongly connected property for directed graph guarantees that for any two graph nodes a and b routes a to b and b to a are exist.
Questions tagged [strongly-connected-graph]
52 questions
0
votes
0 answers
javascript equivalent of MATLAB for finding strongly connected components in a binary image
I am writing a prototype of an image manipulation program in MATLAB and am hoping to port it to javascript once the prototyping phase is done.
I am not very familiar with javascript but there seem to be many image processing libraries available so…
sg1234
- 600
- 4
- 19
0
votes
1 answer
Strongly Connected Component with constraint
I have come across a problem which goes something like this.
We are given an undirected graph where each edge has a value. Now the extra constraint is that one can not move from a higher value edge to a lower value edge. One always has to move from…
smashingpumpkin
- 67
- 7
0
votes
1 answer
Let G be a directed graph. There is a special vertex S such that there is a path to this vertex from every other vertex of the graph
To check if a vertex v is a special vertex is it sufficient to show that it is in a sink Strongly connected component? Don't we have to also prove that the underlying undirected graph is connected? If that is the case, what is the best way to check…
Pradeep Vairamani
- 4,004
- 3
- 36
- 59
-1
votes
1 answer
A graph with maximum number of strongly connected components
Create a directed graph with 6 nodes (say) such that it has maximum number of strongly connected components.
For example, take complete graph with 4 nodes with all edges connected. This is graph has only 1 strongly connected component, i.e entire…
Abhishek M J
- 23
- 4
-1
votes
1 answer
Strongly Connected Components Quastion
If you don't know how SCC algorithm works read this article: https://www.hackerearth.com/practice/algorithms/graphs/strongly-connected-components/tutorial/ (This is the best article I could find).
After finding finish time for each node, we reverse…
-1
votes
2 answers
Strongly component
I am trying to write an algorithm that is given a graph G and 2 nodes 'x' and 'y'as input, which returns whether there is a cyclic path from 'x' to 'y'
Is it a good idea to find the strongly connected components first and then check if x and y…
Deesha
- 538
- 8
- 27
-2
votes
3 answers
Make an already existing Graph fully connected
I have a Graph of this structure:
G = {
'1':['100', '134', '1435'],
'145':['4', '2345', '253'],
'3773':['12'], '773':['1211', '629']}
The graph is actually so large, with 6378 nodes and 39932 edges.
My problem is that the graph is…
vic
- 87
- 1
- 5