page541.html

来自「Data Structures And Algorithms With Obje」· HTML 代码 · 共 42 行

HTML
42 行
字号 
<HTML><HEAD><TITLE>Directed Graphs</TITLE></HEAD><BODY bgcolor="#FFFFFF"> <a href="../index.html" target="_top"><img src="../icons/usins.gif" alt="Logo" align=right></a><b>Data Structures and Algorithms with Object-Oriented Design Patterns in Python</b><br><A NAME="tex2html7384" HREF="page542.html"><IMG WIDTH=37 HEIGHT=24 ALIGN=BOTTOM ALT="next" SRC="../icons/next_motif.gif"></A> <A NAME="tex2html7382" HREF="page532.html"><IMG WIDTH=26 HEIGHT=24 ALIGN=BOTTOM ALT="up" SRC="../icons/up_motif.gif"></A> <A NAME="tex2html7376" HREF="page540.html"><IMG WIDTH=63 HEIGHT=24 ALIGN=BOTTOM ALT="previous" SRC="../icons/previous_motif.gif"></A>  <A NAME="tex2html7386" HREF="page611.html"><IMG WIDTH=43 HEIGHT=24 ALIGN=BOTTOM ALT="index" SRC="../icons/index_motif.gif"></A> <BR><HR><H2><A NAME="SECTION0016260000000000000000">Directed Graphs</A></H2><P>Program&nbsp;<A HREF="page541.html#progdigrapha"><IMG  ALIGN=BOTTOM ALT="gif" SRC="../icons/cross_ref_motif.gif"></A> introduces the <tt>Digraph</tt> class.The abstract <tt>Digraph</tt> class extendsthe abstract <tt>Graph</tt> classdefined in Programs&nbsp;<A HREF="page537.html#proggrapha"><IMG  ALIGN=BOTTOM ALT="gif" SRC="../icons/cross_ref_motif.gif"></A>, <A HREF="page538.html#proggraphb"><IMG  ALIGN=BOTTOM ALT="gif" SRC="../icons/cross_ref_motif.gif"></A> and&nbsp;<A HREF="page539.html#proggraphc"><IMG  ALIGN=BOTTOM ALT="gif" SRC="../icons/cross_ref_motif.gif"></A>.<P><P><A NAME="50002">&#160;</A><A NAME="progdigrapha">&#160;</A> <IMG WIDTH=575 HEIGHT=332 ALIGN=BOTTOM ALT="program49740" SRC="img2270.gif"  ><BR><STRONG>Program:</STRONG> Abstract <tt>Digraph</tt> class.<BR><P><P>The abstract <tt>Digraph</tt> class adds the following operationswhich apply only to directed graphs:<P><DL ><DT><STRONG><tt>isStronglyConnected</tt></STRONG><DD>	This <tt>bool</tt>-valued property is <tt>True</tt>	if the directed graph is <em>strongly connected</em>.	Strong connectedness is discussed in Section&nbsp;<A HREF="page558.html#secgraphconnected"><IMG  ALIGN=BOTTOM ALT="gif" SRC="../icons/cross_ref_motif.gif"></A>.    <DT><STRONG><tt>topologicalOrderTraversal</tt></STRONG><DD>	A topological sort is an ordering of the nodes of a directed graph.	This traversal visits the nodes of a directed graph in the order	specified by a topological sort.<P> </DL><HR><A NAME="tex2html7384" HREF="page542.html"><IMG WIDTH=37 HEIGHT=24 ALIGN=BOTTOM ALT="next" SRC="../icons/next_motif.gif"></A> <A NAME="tex2html7382" HREF="page532.html"><IMG WIDTH=26 HEIGHT=24 ALIGN=BOTTOM ALT="up" SRC="../icons/up_motif.gif"></A> <A NAME="tex2html7376" HREF="page540.html"><IMG WIDTH=63 HEIGHT=24 ALIGN=BOTTOM ALT="previous" SRC="../icons/previous_motif.gif"></A>  <A NAME="tex2html7386" HREF="page611.html"><IMG WIDTH=43 HEIGHT=24 ALIGN=BOTTOM ALT="index" SRC="../icons/index_motif.gif"></A> <P><ADDRESS><img src="../icons/bruno.gif" alt="Bruno" align=right><a href="../copyright.html">Copyright &#169; 2003</a> by <a href="../signature.html">Bruno R. Preiss, P.Eng.</a>  All rights reserved.</ADDRESS></BODY></HTML>

page541.html - 源码说明

本页面展示了「Data Structures And Algorithms With Object-Oriented Design Patterns In Python (2003) source code and」中的 page541.html 源码文件，采用 HTML 编程语言编写，共 42 行代码。您可以在线阅读完整代码内容，也可以返回资源详情页下载完整源码包进行本地学习和开发。

虫虫下载站收录了大量与Object-Oriented相关的技术资源，包括源代码、技术文档、电路图等，是电子工程师和嵌入式开发者的专业学习平台。

⌨️ 快捷键说明

复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?