Daniel Michel: New Applications
https://www.maplesoft.com/applications/author.aspx?mid=211766
en-us2019 Maplesoft, A Division of Waterloo Maple Inc.Maplesoft Document SystemSat, 20 Jul 2019 16:41:06 GMTSat, 20 Jul 2019 16:41:06 GMTNew applications published by Daniel Michelhttps://www.maplesoft.com/images/Application_center_hp.jpgDaniel Michel: New Applications
https://www.maplesoft.com/applications/author.aspx?mid=211766
Kruskal's Minimum Spanning Tree: Step by Step
https://www.maplesoft.com/applications/view.aspx?SID=153975&ref=Feed
Kruskal's MST Algorithm is a well known solution to the Minimum Spanning Tree (MST) problem, which consists in finding a subset of the edges of a connected weighed graph, such that it satisfies two properties: it maintains connectivity, and the sum of the weights of the edges in the set is minimized. This implementation shows the step-by-step progress of the algorithm.
<BR><BR>
This work is part of a social service project consisting in the implementation of several graph theory algorithms with step-by-step execution, intended to be used as a teaching aid in graph theory related courses. See also applications for <A HREF="http://www.maplesoft.com/applications/view.aspx?SID=153972">Prim’s Minimum Spanning Tree</A>, <A HREF="http://www.maplesoft.com/applications/view.aspx?SID=153974">Ford-Bellman’s Shortest Path</A>, and <A HREF="http://www.maplesoft.com/applications/view.aspx?SID=153973">Dijkstra’s Shortest Path</A>.<img src="https://www.maplesoft.com/applications/images/app_image_blank_lg.jpg" alt="Kruskal's Minimum Spanning Tree: Step by Step" style="max-width: 25%;" align="left"/>Kruskal's MST Algorithm is a well known solution to the Minimum Spanning Tree (MST) problem, which consists in finding a subset of the edges of a connected weighed graph, such that it satisfies two properties: it maintains connectivity, and the sum of the weights of the edges in the set is minimized. This implementation shows the step-by-step progress of the algorithm.
<BR><BR>
This work is part of a social service project consisting in the implementation of several graph theory algorithms with step-by-step execution, intended to be used as a teaching aid in graph theory related courses. See also applications for <A HREF="http://www.maplesoft.com/applications/view.aspx?SID=153972">Prim’s Minimum Spanning Tree</A>, <A HREF="http://www.maplesoft.com/applications/view.aspx?SID=153974">Ford-Bellman’s Shortest Path</A>, and <A HREF="http://www.maplesoft.com/applications/view.aspx?SID=153973">Dijkstra’s Shortest Path</A>.https://www.maplesoft.com/applications/view.aspx?SID=153975&ref=FeedTue, 16 Feb 2016 05:00:00 ZDaniel MichelDaniel MichelPrim’s Minimum Spanning Tree: Step by Step
https://www.maplesoft.com/applications/view.aspx?SID=153972&ref=Feed
Prim's MST Algorithm is a well known solution to the Minimum Spanning Tree (MST) problem, which consists in finding a subset of the edges of a connected weighed graph, such that it satisfies two properties: it maintains connectivity, and the sum of the weights of the edges in the set is minimized. This implementation shows the step-by-step progress of the algorithm.
<BR><BR>
This work is part of a social service project consisting in the implementation of several graph theory algorithms with step-by-step execution, intended to be used as a teaching aid in graph theory related courses. See also applications for <A HREF="http://www.maplesoft.com/applications/view.aspx?SID=153975">Kruskal’s Minimum Spanning Tree</A>, <A HREF="http://www.maplesoft.com/applications/view.aspx?SID=153974">Ford-Bellman’s Shortest Path</A>, and <A HREF="http://www.maplesoft.com/applications/view.aspx?SID=153973">Dijkstra’s Shortest Path</A>.<img src="https://www.maplesoft.com/view.aspx?si=153972/prim.PNG" alt="Prim’s Minimum Spanning Tree: Step by Step" style="max-width: 25%;" align="left"/>Prim's MST Algorithm is a well known solution to the Minimum Spanning Tree (MST) problem, which consists in finding a subset of the edges of a connected weighed graph, such that it satisfies two properties: it maintains connectivity, and the sum of the weights of the edges in the set is minimized. This implementation shows the step-by-step progress of the algorithm.
<BR><BR>
This work is part of a social service project consisting in the implementation of several graph theory algorithms with step-by-step execution, intended to be used as a teaching aid in graph theory related courses. See also applications for <A HREF="http://www.maplesoft.com/applications/view.aspx?SID=153975">Kruskal’s Minimum Spanning Tree</A>, <A HREF="http://www.maplesoft.com/applications/view.aspx?SID=153974">Ford-Bellman’s Shortest Path</A>, and <A HREF="http://www.maplesoft.com/applications/view.aspx?SID=153973">Dijkstra’s Shortest Path</A>.https://www.maplesoft.com/applications/view.aspx?SID=153972&ref=FeedTue, 16 Feb 2016 05:00:00 ZDaniel MichelDaniel Michel