Average rating
Cast your vote
You can rate an item by clicking the amount of stars they wish to award to this item.
When enough users have cast their vote on this item, the average rating will also be shown.
Star rating
Your vote was cast
Thank you for your feedback
Thank you for your feedback
Authors
Muñoz Jugo, Cynthia MarielaIssue Date
2007-06-07Keywords
Algoritmos
Metadata
Show full item recordxmlui.metadata.dc.relation
http://enwikipediaorg/wiki/Graph_theoryType
info:eu-repo/semantics/learningObjectRights
Copyright © 2005 por Muñoz Jugo, Cynthia Mariela, Universidad Peruana de Ciencias Aplicadas - UPCLanguage
spaDescription
Minimimum Spanning Tree. Criterios para escoger el algoritmo de Camino Más Corto. Algoritmo de Dijkstra, Algoritmo de Bellman-Ford, Algoritmo DAG-SP. Transitive Closure de un grafo, Warshall.Collections