D1 definitions

A few definitions........

  • Created by: Amanda
  • Created on: 02-01-12 13:03
The definition of a weighted graph is....
A graph which has a number associated with each edge.
1 of 7
In a path....
No vertex appears more than once.
2 of 7
Prims algorithm is used to....
Find a minnimum spanning tree.
3 of 7
The total float is....
The amount of time a project can be delayed by without affecting the duration of the project.
4 of 7
A walk is...
A path in which you are permitted to return to a vertex more than once.
5 of 7
An Adjacency matrix....
Records the number of direct links between vertices.
6 of 7
A maximal matching is....
A matching where the number of arcs is as large as possible.
7 of 7

Other cards in this set

Card 2

Front

In a path....

Back

No vertex appears more than once.

Card 3

Front

Prims algorithm is used to....

Back

Preview of the front of card 3

Card 4

Front

The total float is....

Back

Preview of the front of card 4

Card 5

Front

A walk is...

Back

Preview of the front of card 5
View more cards

Comments

Mankin Lee

Report

Thanks, very helpful.

Harry Bindloss

Report

Thanks for that

Similar Mathematics resources:

See all Mathematics resources »See all Graphs and transformations resources »