博客
关于我
Objective-C实现bellmanFord贝尔曼-福特算法(附完整源码)
阅读量:801 次
发布时间:2023-02-17

本文共 2329 字,大约阅读时间需要 7 分钟。

Objective-C?????-????

???-????????????????????????????????????????????????Objective-C?????????????????????

#import <Foundation/Foundation.h>

@interface Edge : NSObject

@property (nonatomic) NSInteger source;
@property (nonatomic) NSInteger destination;
@property (nonatomic) NSInteger weight;
@end>

@interface BellmanFord : NSObject

@property (nonatomic, strong) NSArray *edges;
@property (nonatomic) NSInteger sourceNode;
@property (nonatomic) NSInteger numberOfNodes;

  • (void)initializeDistances;
  • (void)relaxEdge:(Edge *)edge;
  • (void)bellmanFordAlgorithm;
  • (void)printResults;
    @end>

@implementation BellmanFord

  • (void)initializeDistances

    {
    self.distance = [NSArray array];
    for (NSInteger i = 0; i < numberOfNodes; i++)
    {
    self.distance[i] = INFINITY;
    if (i == sourceNode)
    {
    self.distance[i] = 0;
    }
    }
    }

  • (void)relaxEdge:(Edge *)edge

    {
    NSInteger u = edge.source;
    NSInteger v = edge.destination;
    NSInteger weight = edge.weight;

    if (distance[u] + weight < distance[v])

    {
    distance[v] = distance[u] + weight;
    // ?????????????????
    }
    }

  • (void)bellmanFordAlgorithm

    {
    initializeDistances();
    for (NSInteger i = 0; i < numberOfNodes; i++)
    {
    for (Edge *edge in edges)
    {
    relaxEdge(edge);
    }
    }

    // ????????

    // ???????????????
    while (true)
    {
    Boolean updated = false;
    for (Edge *edge in edges)
    {
    if (distance[edge.source] != INFINITY && distance[edge.destination] == INFINITY)
    {
    distance[edge.destination] = distance[edge.source] + edge.weight;
    updated = true;
    }
    }

    if (!updated)

    {
    break;
    }
    }

    printResults();

    }

  • (void)printResults

    {
    NSLog(@"?????");
    for (NSInteger i = 0; i < numberOfNodes; i++)
    {
    NSLog(@"?? %d ?????????? %f", i, distance[i]);
    }
    }

    ??????????????`BellmanFord`???????-???????????????

    ???

    • edges?????????
    • sourceNode????
    • numberOfNodes????????

    ?????

    ??????????????????????????????????????0?

    ???

    ??????????????????????????????????????????????????????????

    ?????

    ???-??????????????????????????????????????????????????????????

    ????

    ?????????????????????

    ????

    ??????????

    BellmanFord *bellman = [[BellmanFord alloc] init]; bellman.sourceNode = 1; bellman.numberOfNodes = 4; bellman.edges = @[[Edge edgeWithSource:1 destination:2 weight:2], [Edge edgeWithSource:1 destination:3 weight:5], [Edge edgeWithSource:2 destination:3 weight:-1]]; [bellman bellmanFordAlgorithm];

    ????????????????-???????????????????????????????????????????

转载地址:http://idnfk.baihongyu.com/

你可能感兴趣的文章
Objective-C实现Miller-Rabin素性测试程序(附完整源码)
查看>>
Objective-C实现Miller-Rabin素性测试程序(附完整源码)
查看>>
Objective-C实现min cost string conversion最低成本字符串转换算法(附完整源码)
查看>>
Objective-C实现MinhashLSH算法(附完整源码)
查看>>
Objective-C实现MinhashLSH算法(附完整源码)
查看>>
Objective-C实现MinHeap最小堆算法(附完整源码)
查看>>
Objective-C实现minimum coin change最小硬币找零算法(附完整源码)
查看>>
Objective-C实现minimum cut最小切割流算法(附完整源码)
查看>>
Objective-C实现minimum partition最小分区算法(附完整源码)
查看>>
Objective-C实现Minimum Priority Queu最小优先级队列算法(附完整源码)
查看>>
Objective-C实现Minimum Vertex Cover最小顶点覆盖算法(附完整源码)
查看>>
Objective-C实现MinimumCostPath最小成本路径算法(附完整源码)
查看>>
Objective-C实现min_heap最小堆算法(附完整源码)
查看>>
Objective-C实现mobius function莫比乌斯函数算法(附完整源码)
查看>>
Objective-C实现modular Binary Exponentiation模二进制指数算法 (附完整源码)
查看>>
Objective-C实现modular exponential模指数算法(附完整源码)
查看>>
Objective-C实现monte carlo dice蒙特卡洛骰子模拟算法(附完整源码)
查看>>
Objective-C实现monte carlo蒙特卡罗算法(附完整源码)
查看>>
Objective-C实现Mosaic Augmentation马赛克增强算法(附完整源码)
查看>>
Objective-C实现msd 基数排序算法(附完整源码)
查看>>