Use LEFT and RIGHT arrow keys to navigate between flashcards;
Use UP and DOWN arrow keys to flip the card;
H to show hint;
A reads text to speech;
8 Cards in this Set
- Front
- Back
|
Vertex |
A vertex (also called a “node”) is a fundamental part of a graph |
|
|
Edge |
An edge connects two vertices to show that there is a relationship between them.
If the edges in a graph are all one-way, we say that the graph is adirected graph, or a digraph. |
|
|
Weight |
Edges may be weighted to show that there is a cost to go from one vertex to another |
|
|
Path |
A path in a graph is a sequence of vertices that are connected by edges. |
|
|
Cycle |
A cycle in a directed graph is a path that starts and ends at the same vertex. |
|
|
Breadth first search (BFS) |
Given a graph G and a starting vertex s , a breadth first search proceeds by exploring edges in the graph to find all the vertices in G for which there is a path from s . The remarkable thing about a breadth first search is that it finds all the vertices that are a distance k from s before it finds any vertices that are a distance k+1 . One good way to visualize what the breadth first search algorithm does is to imagine that it is building a tree, one level of the tree at a time. A breadth first search adds all children of the starting vertex before it begins to discover any of the grandchildren. |
|
|
python links |
https://pythonadventures.wordpress.com/category/python/<?xml:namespace prefix = o />
http://ryrobes.com/featured-articles/using-a-simple-python-script-for-end-to-end-data-transformation-and-etl-part-1/
http://stackoverflow.com/questions/2573135/python-progression-path-from-apprentice-to-guru
|
|
|
job
|
http://www.yegor256.com/2014/10/29/how-much-do-you-cost.html
|
