什么是Cyclomatic Complexity(圈复杂度)?

简介: Campwood Software   SourceMonitor Version 3.5 The freeware program SourceMonitor lets you see inside your software source code to find out how ...

 

Campwood Software

 


SourceMonitor Version 3.5

The freeware program SourceMonitor lets you see inside your software source code to find out how much code you have and to identify the relative complexity of your modules. For example, you can use SourceMonitor to identify the code that is most likely to contain defects and thus warrants formal review. SourceMonitor, written in C++, runs through your code at high speed, typically more than 10,000 lines of code per second. SourceMonitor provides the following:

  • Collects metrics in a fast, single pass through source files.
  • Measures metrics for source code written in C++, C, C#, VB.NET, Java, Delphi, Visual Basic (VB6) or HTML.
  • Includes method and function level metrics for C++, C, C#, VB.NET, Java, and Delphi.
  • Offers Modified Complexity metric option.
  • Saves metrics in checkpoints for comparison during software development projects.
  • Displays and prints metrics in tables and charts, including Kiviat diagrams.
  • Operates within a standard Windows GUI or inside your scripts using XML command files.
  • Exports metrics to XML or CSV (comma-separated-value) files for further processing with other tools.

Enhancements added in Version 3.5 are described below. Like all previous versions, this version of SourceMonitor is free [view license]. The download is a fully functional installer contained in a single file, SMSetupV346.exe. Please download the installation file and give it a try:

Download SourceMonitor V3.5.0.306 (2.47 MBytes):   via HTTP. Run the downloaded file (SMSetupV350.exe) to install SourceMonitor.

 

 

http://www.campwoodsw.com/sourcemonitor.html

 

http://www.cnblogs.com/bangerlee/archive/2011/09/18/2178172.html

http://blog.csdn.net/lg707415323/article/details/7790660

 

 

 

相关文章
|
算法 数据挖掘 调度
【算法分析与设计】贪心算法(下)
【算法分析与设计】贪心算法(下)
【算法分析与设计】贪心算法(下)
17.【快速排序及三分取中优化详解】
17.【快速排序及三分取中优化详解】
82 0
|
1月前
|
算法 开发者
【时间复杂度和空间复杂度之间的故事】
【时间复杂度和空间复杂度之间的故事】
18 5
|
3月前
|
测试技术
圈复杂度问题之什么是“气功波”式代码,它有什么问题,如何解决
圈复杂度问题之什么是“气功波”式代码,它有什么问题,如何解决
|
6月前
|
算法
算法沉淀 —— 动态规划篇(斐波那契数列模型)
算法沉淀 —— 动态规划篇(斐波那契数列模型)
52 0
|
6月前
|
人工智能
倍增LCA受到启发的一题
倍增LCA受到启发的一题
32 0
|
文字识别 搜索推荐 开发者
渐进复杂度(Progressive Complexity
渐进复杂度(Progressive Complexity)是一种设计原则,用于指导开发者在开发过程中,如何根据用户的需求和技能水平,逐渐增加功能的复杂度,以提高产品的易用性和满足高级用户的需求。渐进复杂度旨在让产品对新用户友好,同时允许他们在掌握更多技能后,探索更高级的功能。
119 8
|
11月前
|
算法 搜索推荐
算法分析 | 第一套(渐近分析)
算法分析 | 第一套(渐近分析)
60 0
|
机器学习/深度学习 存储 算法
【算法分析与设计】贪心算法(上)
【算法分析与设计】贪心算法(上)
|
存储 人工智能 算法
【算法分析与设计】动态规划(上)
【算法分析与设计】动态规划(上)