boost/graph
2
0
Fork 0
mirror of https://github.com/boostorg/graph.git synced 2026-01-19 04:12:11 +00:00
Code Issues Projects Releases Wiki Activity

fix typos

Browse Source
This commit is contained in:
John Zhang
2018-05-12 13:27:24 +08:00
parent 4c752ee2f1
commit 30d0faa665
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
doc/two_graphs_common_spanning_trees.html
View File

@@ -6,7 +6,7 @@
http://www.boost.org/LICENSE_1_0.txt)
Two Graphs Common Spanning Trees Algorithm
Based on academic article of Mint, Read and Tarjan
Based on academic article of Minty, Read and Tarjan
Efficient Algorithm for Common Spanning Tree Problem
Electron. Lett., 28 April 1983, Volume 19, Issue 9, p.346–347
-->
@@ -20,7 +20,7 @@
<h1><tt><a name="sec:two-graphs-common-spanning-trees">Two-Graphs Common Spanning Trees (MRT Algorithm)</a></tt></h1>
<p>
The <b>MRT</b> algorithm, based on an academic article of <b>Mint</b>, <b>Read</b> and
The <b>MRT</b> algorithm, based on an academic article of <b>Minty</b>, <b>Read</b> and
<b>Tarjan</b>, is an efficient algorithm for the common spanning tree problem.<br/>
This kind of algorithm is widely used in electronics, being the basis of the
analysis of electrical circuits. Another area of interest may be that of the