Kosaraju's algorithm

[watt_a_fruit]

33 minutes ago, Popkatapetapotapulti said:

algorithms in a nutshell is binary 1 or 0...you know half of it ...

i was just kidding dude 

itz ok baa

manaki thelenapudu oppkotame ... nothing wrong in it

I am scared of "n/~/π/∞" this family from beginning  

[watt_a_fruit]

37 minutes ago, AlaElaAlaEla said:

mari ippudu nuvvu ye tech meeda job doing ? Koncham aa tech ento cheppu fleeze 

jagamantha kutumbam naadi

anni techluuuu naavi 

It engineer nenu ... (chakram song style lo paaduko baa)

[boeing747]

3 minutes ago, watt_a_fruit said:

itz ok baa

manaki thelenapudu oppkotame ... nothing wrong in it

I am scared of "n/~/π/∞" this family from beginning  

Kurru ga, manakenduku ee saduvulu seppu 🤐

[panipoori]

4 hours ago, Popkatapetapotapulti said:

edo problem ki solution vethukuthu edi dorikindi 

https://en.wikipedia.org/wiki/Kosaraju's_algorithm

nee.. evadikaina ardam aytadi aa algorithm..

[karthikn]

4 hours ago, Popkatapetapotapulti said:

edo problem ki solution vethukuthu edi dorikindi 

https://en.wikipedia.org/wiki/Kosaraju's_algorithm

Graphs prepping aa 😀  

[watt_a_fruit]

43 minutes ago, boeing747 said:

Kurru ga, manakenduku ee saduvulu seppu 🤐

ade kada baaa

ee algorithm title chusinapude muuskoni ellipokundaa lopaliki vachi kelkaanu ... neninka raanu deenloki 

[Popkatapetapotapulti]

On 9/15/2018 at 12:20 AM, karthikn said:

Graphs prepping aa 😀  

meeku oka kramam lo velle graph echaru,  meeru kanukovalsindi enti ante aa graph ye nodes ite vere ani nodes ki velagelthayo aa nodes varusaga achu veyavalenu

[fake_Bezawada]

On 9/15/2018 at 8:20 AM, Popkatapetapotapulti said:

edo problem ki solution vethukuthu edi dorikindi 

https://en.wikipedia.org/wiki/Kosaraju's_algorithm

alage kotcherlakota therom kooda chudu https://en.wikipedia.org/wiki/Kotcherlakota_Rangadhama_Rao

[Popkatapetapotapulti]

12 hours ago, fake_Bezawada said:

alage kotcherlakota therom kooda chudu https://en.wikipedia.org/wiki/Kotcherlakota_Rangadhama_Rao

Spectroscopy in Physics manaki asalu related field ye kadu....Computer science unte chepu 

[karthikn]

48 minutes ago, Popkatapetapotapulti said:

Spectroscopy in Physics manaki asalu related field ye kadu....Computer science unte chepu 

Can you try dancing links algorithm for sudoku. Typical backtracking is moderate 

Also manachers to find longest palindromic substring length in (n) .  Typically you take each character and expand. 

[Popkatapetapotapulti]

7 hours ago, karthikn said:

Can you try dancing links algorithm for sudoku. Typical backtracking is moderate 

Also manachers to find longest palindromic substring length in (n) .  Typically you take each character and expand. 

nenu adigina question using kosaraju scc solve cheyachu..which is basically mother vertex 

I dont want to try...travelling salesman etc thiriga unapudu cheskovachu epudeu vadhu 

ya solved it sometime back longest palindromic 

[karthikn]

17 minutes ago, Popkatapetapotapulti said:

nenu adigina question using kosaraju scc solve cheyachu..which is basically mother vertex 

I dont want to try...travelling salesman etc thiriga unapudu cheskovachu epudeu vadhu 

ya solved it sometime back longest palindromic 

Could you share classes for Graph structure and adjacency list. 

I follow this

https://algs4.cs.princeton.edu/code/edu/princeton/cs/algs4/Graph.java.html

. Wanted to know how people represent vertices etc. 

[Popkatapetapotapulti]

13 minutes ago, karthikn said:

Could you share classes for Graph structure and adjacency list. 

I follow this

https://algs4.cs.princeton.edu/code/edu/princeton/cs/algs4/Graph.java.html

. Wanted to know how people represent vertices etc. 

depends on how you want to represent..I am comfortable with AL 

public class GraphAdjList
    {
        private readonly int V;
        private readonly List<int>[] Adj;

        public GraphAdjList(int v)
        {
            this.V = v;
            Adj = new List<int>[V];

            for (int i = 0; i < V; i++)
            {
                Adj[i] = new List<int>();
            }
        }

        public List<int> GetAdj(int v)
        {
            return Adj[v];
        }
          
        public int VertexCount
        {
            get
            {
                return V;
            }
        }
          
        public void AddEdge(int v, int w)
        {
            Adj[v].Add(w);
            //Adj[w].Add(v); undirected
        }
    }

 

[karthikn]

7 minutes ago, Popkatapetapotapulti said:

depends on how you want to represent..I am comfortable with AL 

public class GraphAdjList
    {
        private readonly int V;
        private readonly List<int>[] Adj;

        public GraphAdjList(int v)
        {
            this.V = v;
            Adj = new List<int>[V];

            for (int i = 0; i < V; i++)
            {
                Adj[i] = new List<int>();
            }
        }

        public List<int> GetAdj(int v)
        {
            return Adj[v];
        }
          
        public int VertexCount
        {
            get
            {
                return V;
            }
        }
          
        public void AddEdge(int v, int w)
        {
            Adj[v].Add(w);
            //Adj[w].Add(v); undirected
        }
    }

 

thanks..  also fellow c# guy