Graphs

[Striker]

Hello everybody!

Can somebody help me with this questions?

1.What is the time complexity for (a) adding an edge, (b) checking whether there is an edge between two vertices, and (c) retrieving all vertices adjacent to a vertex in the adjacency matrix representation?

2.Explain what the largest strong component size is in a directed acyclic graph.

 

[Flown]

Hi and welcome to Java-Forum.org. FYI this is a german speaking forum but we'll try to help you anyway.

To answer your question you've to provide much more context like the assignment and/or code. In this state the answers would be to vague.

 

[stg]

First of all you should share YOUR OWN THOUGHTS.

Nobody will do your homework for you if you just Copy&Paste the questions.