|Contents||Inline elements, block-level elements|
<DL> <DT><A NAME="spanning-tree">Spanning tree</A></DT> <DD> <P> A spanning tree of a graph is a <A HREF="#tree">tree</A> that contains all the vertices of the graph. There are two main types of spanning trees: </P> <DL> <DT>BFS spanning tree</DT> <DD> A spanning tree formed by a breadth-first search on the graph. </DD> <DT>DFS spanning tree</DT> <DD> A spanning tree formed by a depth-first search on the graph. </DD> </DL> </DD> <DT><A NAME=tree>Tree</A></DT> <DD> <P> A tree is a connected, undirected graph without cycles. </P> </DD> </DL>
A DD element should generally be preceded by a DT element that gives the term defined by the DD. A single definition term may have multiple definitions associated with it, and a single definition may have multiple terms.
-- More Information --
Click Here for InfiniteSurf.com Homepage