You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 
notes/classes/algorithms/traversing_graphs.md

792 B

Traversing Graphs

from algorithms

The number of times you must traverse a graphs depends on whether or not it's directional, if it is nondirectional the number of times is equal to the number of edges, otherwise it is equal to the number of connections (so two-way graph edges are counted twice).

The most common ways to traverse a graph are a breadth_first_search and a depth_first_search

when you are attempting to traverse spanning_tree, the most common algorithms are prims_algorithm and kruskals_algorithm

You always know you have found a graph in the minimum number of traversals if the number of edges is equal to the number of verticies -1

see also

list without id file.inlinks
where file.name = this.file.name