Save
Busy. Please wait.
or

show password
Forgot Password?

Don't have an account?  Sign up 
or

Username is available taken
show password

why


Make sure to remember your password. If you forget it there is no way for StudyStack to send you a reset link. You would need to create a new account.
We do not share your email address with others. It is only used to allow you to reset your password. For details read our Privacy Policy and Terms of Service.


Already a StudyStack user? Log In

Reset Password
Enter the associated with your account, and we'll email you a link to reset your password.
focusNode
Didn't know it?
click below
 
Knew it?
click below
Don't know (0)
Remaining cards (0)
Know (0)
0:00
share
Embed Code - If you would like this activity on your web page, copy the script below and paste it into your web page.

  Normal Size     Small Size show me how

D1 Definitions

QuestionAnswer
Median member of a list? 0.5(N+1) if N is odd and 0.5(N+2) if N is even; that is, always round up.
What is a graph? A graph consists of points (vertices) which are connected by lines (edges)
What is a subgraph of a graph G? A graph each of whose vertices and edges belongs to G.
What is a network? A graph with a number (weight) associated with each edge.
What is the degree of a vertex? The number of edges incident to it.
What is a path? A finite sequence of edges such that the end vertex of one edge in the sequence is the start vertex of the next, and no vertex appears more than once.
What is a cycle? A closed path such that the end vertex of the last edge is the start vertex of the first edge.
When are two vertices connected? If a path exists between them.
When is a graph connected? When all of its vertices are connected to one another.
What is a digraph? A graph where all the edges have a direction associated with them.
What is a tree? A connected graph that lacks cycles.
What is a spanning tree of a graph G? A subgraph of G which includes all the vertices of G and is a tree.
What is a minimum spanning tree? A spanning tree such that the total length of its arcs is as small as possible.
What is a complete graph? A graph in which each of the vertices is linked by one edge to every other vertex.
What is the total float? F(i,j) = lj - ei - duration(i,j)
What is a bipartite graph? A graph consisting of two sets of vertices X and Y. The edges only join vertices in X to vertices in Y, and not vertices within either set.
What is denoted by Kr and Krs? The complete graph with r vertices; the complete bipartite graph with r and s vertices in respective sets.
What is a matching? A pairing of some of the members of a set X with elements of another set Y.
What is a complete matching? A matching such that each member of the set X is paired with a member of Y.
Created by: krollo
 

 



Voices

Use these flashcards to help memorize information. Look at the large card and try to recall what is on the other side. Then click the card to flip it. If you knew the answer, click the green Know box. Otherwise, click the red Don't know box.

When you've placed seven or more cards in the Don't know box, click "retry" to try those cards again.

If you've accidentally put the card in the wrong box, just click on the card to take it out of the box.

You can also use your keyboard to move the cards as follows:

If you are logged in to your account, this website will remember which cards you know and don't know so that they are in the same box the next time you log in.

When you need a break, try one of the other activities listed below the flashcards like Matching, Snowman, or Hungry Bug. Although it may feel like you're playing a game, your brain is still making more connections with the information to help you out.

To see how well you know the information, try the Quiz or Test activity.

Pass complete!

"Know" box contains:
Time elapsed:
Retries:
restart all cards