Index: trunk/doc/TRBS/trbs.html
===================================================================
--- trunk/doc/TRBS/trbs.html	(revision 545)
+++ trunk/doc/TRBS/trbs.html	(revision 546)
@@ -109,7 +109,8 @@
 <p>
 A 2net is always starting from a vertex, will cross zero or more edges (last
 edge being part of the triangle with the ending vertex), then will connect
-to the ending vertex. This path can be searched using the A* algorithm:
+to the ending vertex. This path can be searched using the A* algorithm, on
+a graph formed by these rules:
 <ul>
 	<li> Start is the 2net starting vertex; if a neighbor vertex is the ending
 	     vertex of the 2net, and the edge connecting the two vertices doesn't