Spanning tree algorithms
This thesis presents a comprehensive study of spanning trees algorithm. Spanning tree is defined as a subgraph of a graph G that is said to be a tree containing all vertices of G. This could be derived by passing through all possible path in a tree. There are different ways of finding and interpreti...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Animo Repository
1997
|
| Subjects: | |
| Online Access: | https://animorepository.dlsu.edu.ph/etd_bachelors/16339 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |
| Language: | English |