import <Foundation/Foundation.h>

@interface TopologicalSort : NSObject@property (nonatomic, assign) NSInteger vertices;@end

@implementation TopologicalSort{NSArray *vertices;NSArray *edges;NSArray *inDegree;}

(id)initWithVertices:(NSInteger)vertices {self.vertices = vertices;self.inDegree = [NSArray array];self.edges = [NSArray array];return self;}

(void)buildInDegreeAndEdges {self.inDegree = [NSArray array];self.edges = [NSArray array];
for (NSInteger i = 0; i < self.vertices; i++) {[self.inDegree addObject:0];[self.edges addObject: [NSArray array]];}
// 读取边信息并更新入度for (NSInteger i = 0; i < self.vertices; i++) {// 假设边存储为每个节点的出边列表NSArray *nodeEdges = [self.edges objectAtIndex:i];for (NSArray *edgeNode in nodeEdges) {NSInteger src = [edgeNode[0] integerValue];NSInteger dest = [edgeNode[1] integerValue];
```
[self.edges addObject: edgeNode];      [self.inDegree addObject: nil]; // 这里可能需要根据实际数据处理  }
```
}}

(void)performTopologicalSort {NSMutableArray *queue = [NSMutableArray new];for (NSInteger i = 0; i < self.inDegree.count; i++) {if (self.inDegree[i] == 0) {[queue addObject: [NSNumber numberWithInteger:i]];}}

while (!queue.isEmpty) {NSNumber *node = queue.firstObject;[queue removeObject:node];

// 处理当前节点的所有出边  NSArray *edges = [self.edges objectAtIndex: [node.integerValue]];  for (NSArray *edge in edges) {      NSInteger dest = [edge[1] integerValue];      self.inDegree[dest] -= 1;      if (self.inDegree[dest] == 0) {          [queue addObject: [NSNumber numberWithInteger:dest]];      }  }  // 在这里可以添加处理顺序的逻辑

}}

(NSArray *)getTopologicalOrder {NSMutableArray *result = [NSMutableArray new];
while (!queue.isEmpty) {NSNumber *node = queue.firstObject;[queue removeObject:node];[result addObject:node];}
return [result valueForKeyPath: @"asArray"];}

@end

转载地址：http://lmifk.baihongyu.com/

你可能感兴趣的文章