博客
关于我
Objective-C实现bellmanFord贝尔曼-福特算法(附完整源码)
阅读量:797 次
发布时间: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实现collatz sequence考拉兹序列算法(附完整源码)
查看>>
Objective-C实现Collatz 序列算法(附完整源码)
查看>>
Objective-C实现comb sort梳状排序算法(附完整源码)
查看>>
Objective-C实现combinationSum组合和算法(附完整源码)
查看>>
Objective-C实现combinations排列组合算法(附完整源码)
查看>>
Objective-C实现combine With Repetitions结合重复算法(附完整源码)
查看>>
Objective-C实现combine Without Repetitions不重复地结合算法(附完整源码)
查看>>
Objective-C实现conjugate gradient共轭梯度算法(附完整源码)
查看>>
Objective-C实现connected components连通分量算法(附完整源码)
查看>>
Objective-C实现Connected Components连通分量算法(附完整源码)
查看>>
Objective-C实现Convex hull凸包问题算法(附完整源码)
查看>>
Objective-C实现convolution neural network卷积神经网络算法(附完整源码)
查看>>
Objective-C实现convolve卷积算法(附完整源码)
查看>>
Objective-C实现coulombs law库仑定律算法(附完整源码)
查看>>
Objective-C实现counting sort计数排序算法(附完整源码)
查看>>
Objective-C实现countSetBits设置位的数量算法(附完整源码)
查看>>
Objective-C实现currency converter货币换算算法(附完整源码)
查看>>
Objective-C实现cycle sort循环排序算法(附完整源码)
查看>>
Objective-C实现data transformations数据转换算法(附完整源码)
查看>>
Objective-C实现datamatrix二维码识别 (附完整源码)
查看>>