摘要: |
本文定义了有源网络图的一种操作算子,并用其推导了一种确定有源网络拓扑分析中完全树符号的新算法.用该算法确定完全树符号时,只需依次替代电流图树(或电压图树)中的有源边,并记录替换边与被替换边的关联状况便可求出完全树的符号.此方法系统性强,易于编程. |
关键词: 有源网络,网络拓扑,图论. |
DOI: |
|
基金项目: |
|
An operator on the graph of active network and one of its application |
|
() |
Abstract: |
An operator on the graph of active network is defined in the paper, with which a new algorithm for identifying the sign of complete trees in active network is obtained. The algorithm includes two main process, one of which is to replace successively the active edges of current graph tree (or voltage graph tree) with that of voltage graph tree (or current graph free) and the other is to record the information about the replaced edges and the reptacing edges. The method is systematic and easy to carry out by use of computer. |
Key words: Active Network,Network Topology,Graph Theory |