answersLogoWhite

0

Sequence diagram (UML), activity diagram (UML), traditional flow chart (may be more...)

User Avatar

Wiki User

12y ago

What else can I help you with?

Related Questions

How do you use a graph to predict?

The graph can be linear, if is just draw the line in the same path and see the Y axis answer. Sorry if you don't understand. =\


Is every tree a bipartite graph?

Yes, every tree ia a bipartite graph (just see wikipedia).


How can you understand a given graph is Euler or not?

The definition of an Eulerian path is a path in a graph which visits each edge exactly once. Intuitively, think of tracing the path with a pencil without lifting the pencil's edge from the page. One definition of an Eulerian graph is that every vertex has an even degree. You can check this by counting the degrees. Please see the related link for details.


What are the values of i x and y upon completion of the execution of this code segment?

To provide an accurate answer, I would need to see the specific code segment in question. Please share the code, and I can help determine the values of i, x, and y upon completion of its execution.


How do you get a friend code in Naruto path of ninja 2?

You have to connect to wifi and it will give you a friend code. to see if you have a friend code go to the menu and look at "user" then "view friend code." Credit: Aliel3333333


When do you use a graph?

you use a graph to see your progress


What is comparing graph?

A comparing graph is a graph that compares number to see if they similar or different.


What information does this graph give you?

If I can't see the graph then how will I know the answer?


What does the point N on the graph represent?

We would have to see the graph.


What does a mode mean on a line graph?

it means what you see the most on the graph


What is bias in a graph?

A bias in a graph is when you can actually see much of a difference.


What is the axis of symmetry of the function shown in the graph?

I regret that I can see no function shown.