mirror of
https://github.com/ElementsProject/lightning.git
synced 2025-02-24 23:18:25 +01:00
460a28bb32
Rusty: "We don't generally use NDEBUG in our code" Instead use a compile time flag ASKRENE_UNITTEST to make checks on unit tests that we don't normally need on release code. Changelog-none Signed-off-by: Lagrang3 <lagrang3@protonmail.com>
101 lines
2.8 KiB
C
101 lines
2.8 KiB
C
#include "config.h"
|
|
#include <assert.h>
|
|
#include <ccan/tal/tal.h>
|
|
#include <common/setup.h>
|
|
#include <inttypes.h>
|
|
#include <plugins/askrene/graph.h>
|
|
#include <stdio.h>
|
|
|
|
#define ASKRENE_UNITTEST
|
|
#include "../algorithm.c"
|
|
|
|
#define MAX_NODES 256
|
|
#define MAX_ARCS 256
|
|
#define DUAL_BIT 7
|
|
|
|
#define CHECK(arg) if(!(arg)){fprintf(stderr, "failed CHECK at line %d: %s\n", __LINE__, #arg); abort();}
|
|
|
|
static void show(struct graph *graph, struct node node)
|
|
{
|
|
printf("Showing node %" PRIu32 "\n", node.idx);
|
|
for (struct arc arc = node_adjacency_begin(graph, node);
|
|
!node_adjacency_end(arc); arc = node_adjacency_next(graph, arc)) {
|
|
printf("arc id: %" PRIu32 ", (%" PRIu32 " -> %" PRIu32 ")\n",
|
|
arc.idx, arc_tail(graph, arc).idx,
|
|
arc_head(graph, arc).idx);
|
|
}
|
|
printf("\n");
|
|
}
|
|
|
|
int main(int argc, char *argv[])
|
|
{
|
|
common_setup(argv[0]);
|
|
printf("Allocating a memory context\n");
|
|
tal_t *ctx = tal(NULL, tal_t);
|
|
assert(ctx);
|
|
|
|
printf("Allocating a graph\n");
|
|
struct graph *graph = graph_new(ctx, MAX_NODES, MAX_ARCS, DUAL_BIT);
|
|
assert(graph);
|
|
|
|
s64 *capacity = tal_arrz(ctx, s64, MAX_ARCS);
|
|
struct arc *prev = tal_arr(ctx, struct arc, MAX_NODES);
|
|
|
|
graph_add_arc(graph, arc_obj(0), node_obj(1), node_obj(2));
|
|
capacity[0] = 1;
|
|
graph_add_arc(graph, arc_obj(1), node_obj(1), node_obj(3));
|
|
capacity[1] = 1;
|
|
graph_add_arc(graph, arc_obj(2), node_obj(1), node_obj(6));
|
|
capacity[2] = 1;
|
|
graph_add_arc(graph, arc_obj(3), node_obj(2), node_obj(3));
|
|
capacity[3] = 1;
|
|
graph_add_arc(graph, arc_obj(4), node_obj(2), node_obj(4));
|
|
capacity[4] = 0; /* disable this arc */
|
|
graph_add_arc(graph, arc_obj(5), node_obj(3), node_obj(4));
|
|
capacity[5] = 1;
|
|
graph_add_arc(graph, arc_obj(6), node_obj(3), node_obj(6));
|
|
capacity[6] = 1;
|
|
graph_add_arc(graph, arc_obj(7), node_obj(4), node_obj(5));
|
|
capacity[7] = 1;
|
|
graph_add_arc(graph, arc_obj(8), node_obj(5), node_obj(6));
|
|
capacity[8] = 1;
|
|
|
|
show(graph, node_obj(1));
|
|
show(graph, node_obj(2));
|
|
show(graph, node_obj(3));
|
|
show(graph, node_obj(4));
|
|
show(graph, node_obj(5));
|
|
show(graph, node_obj(6));
|
|
|
|
struct node src = {.idx = 1};
|
|
struct node dst = {.idx = 5};
|
|
|
|
bool result = BFS_path(ctx, graph, src, dst, capacity, 1, prev);
|
|
assert(result);
|
|
|
|
int pathlen = 0;
|
|
int arc_sequence[] = {7, 5, 1};
|
|
int node_sequence[] = {4, 3, 1};
|
|
|
|
printf("path: ");
|
|
for (struct node cur = dst; cur.idx != src.idx;) {
|
|
struct arc arc = prev[cur.idx];
|
|
printf("node(%" PRIu32 ") arc(%" PRIu32 ") - ", cur.idx,
|
|
arc.idx);
|
|
cur = arc_tail(graph, arc);
|
|
CHECK(pathlen < 3);
|
|
CHECK(cur.idx == node_sequence[pathlen]);
|
|
CHECK(arc.idx == arc_sequence[pathlen]);
|
|
pathlen ++;
|
|
}
|
|
CHECK(pathlen == 3);
|
|
printf("node(%" PRIu32 ") arc(NONE)\n", src.idx);
|
|
printf("path length: %d\n", pathlen);
|
|
|
|
printf("Freeing memory\n");
|
|
ctx = tal_free(ctx);
|
|
|
|
common_shutdown();
|
|
return 0;
|
|
}
|
|
|