pdf

A New Algorithm for Solving Critical Path

  • 2013-09-19
  • 140.82KB
  • Points it Requires : 2

By defining the concept of node coding graph, a new algorithm for solving critical paths that does not require topological sorting is proposed. The algorithm expands the storage structure of the adjacency list of the graph so that the storage of the graph and the algorithm solving process share the same storage space. Starting from the source node of the graph, all nodes in the graph are encoded recursively using the weighted maximum operation rule and breadth-first recursion. After the coding graph is generated, reverse search is used to find all critical paths and lengths from the source point to the sink point. This algorithm is simpler and more intuitive than existing algorithms, requires less storage space, and the algorithm time complexity is reduced to O(n+e), which is better than the existing algorithm\'s O(n2). Keywords: coding graph; critical path; AOE network; breadth-first search; time complexity

unfold

You Might Like

Uploader
sinceyoulove
 

Recommended ContentMore

Popular Components

Just Take a LookMore

EEWorld
subscription
account

EEWorld
service
account

Automotive
development
circle

About Us Customer Service Contact Information Datasheet Sitemap LatestNews


Room 1530, 15th Floor, Building B, No.18 Zhongguancun Street, Haidian District, Beijing, Postal Code: 100190 China Telephone: 008610 8235 0740

Copyright © 2005-2024 EEWORLD.com.cn, Inc. All rights reserved 京ICP证060456号 京ICP备10001474号-1 电信业务审批[2006]字第258号函 京公网安备 11010802033920号
×