Save
Upgrade to remove ads
Busy. Please wait.
Log in with Clever
or
show password
Forgot Password?
Don't have an account?  Sign up 
Sign up using Clever
or
Username is available taken
show password


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. Your email address is only used to allow you to reset your password. See 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
Remaining cards (0)
Know
0:00
edit
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

Algos

OCR-MEI algorithms

TermDefinition
Node/Vertex A point on the graph which can be connected
Arc/Edge The line which joins two nodes. An arc must have a vertex at each end.
Graph A collection of nodes joined by edges
Loop An edge which has the same vertex at both ends
Order (of an arc) Number of edges incident on an arc. (Loops count twice)
Connected Every vertex is joined by a path to every other vertex
Simple No loops and now repeated edges (UV and UV or UU)
Tree A simply connected graph with the minimum number of arcs
Complete graph (not explicitly on spec) A simply connected graph with the maximum number of edges. I.e. all pairs of arcs have an edge.
Bipartite When the vertices partition into two sets and there are no edges connecting arcs within the SAME set.
Complete Bipartite graph A simply connected bipartite graph with the max edges while still being bipartite.
Digraph A graph with directed arcs.
Network A weighted graph
Weight A numerical value assigned to an edge.
Kruskal's Continuously select the arc with the smallest weight which doesn't form a cycle until n-1 selected.
Prim's Choose any node and add it to T. Choose the arc of minimum weight from T to non-T and add the node it connects. Continue until all nodes are in T.
Tabular Prims Select a node from the columns. Cross out its row. Number 1. Select the lowest weighted arc from a numbered column not crossed out. Number the associated column and cross out its row.
Dijkstra's Starting node is order 1 label 0. Fill in all adjoining nodes with path total path length on that route. Select the node with currently shortest length, next order. Repeat.
Created by: pemmb
 

 



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