Uni- and bidirectional pseudo-generic shortest path finders in C89

I have implemented two related shortest path algorithms for unweighted graphs in C89. My attempt was to learn some more idiomatic C constructs such as genericity (a client programmer should be able to plug in his/her graph data structures to the algorithms). Some questions:

Is it a good idea to embed the unit tests of a data type in the same *.c files?

Is it a good idea to do rather explicit type casting in order to make gcc -Wall -pendatic -ansi shut up?

Might the code below rely on an antipattern?

Code

bidirectional_breadth_first_search.c

#include "bidirectional_breadth_first_search.h"

#include "list.h"

#include "queue.h"

#include "utils.h"

#include <limits.h>



#define NEIGHBOR_NODE_ITERATOR_HAS_NEXT child_node_iterator_has_next

#define NEIGHBOR_NODE_ITERATOR_NEXT     child_node_iterator_next



typedef child_node_iterator neighbor_node_iterator;



list* bidirectional_breadth_first_search(void* source_node,

                                         void* target_node,

                                         child_node_iterator* child_iterator,

                                         parent_node_iterator* parent_iterator,

                                         size_t (*hash_function)(void*),

                                         int (*equals_function)(void*, void*))

{

    queue* queue_a;

    queue* queue_b;

    unordered_map* parents_a;

    unordered_map* parents_b;

    unordered_map* distance_a;

    unordered_map* distance_b;

    size_t dist_a;

    size_t dist_b;

    size_t best_cost;

    void* touch_node;

    void* current_node;

    void* child_node;

    void* parent_node;



    if (!source_node

        || !target_node

        || !child_iterator

        || !parent_iterator

        || !hash_function

        || !equals_function)

    {

        return NULL;

    }



    queue_a = queue_alloc();

    queue_b = queue_alloc();



    parents_a = unordered_map_alloc(10,

                                    1.0f,

                                    hash_function,

                                    equals_function);



    parents_b = unordered_map_alloc(10,

                                    1.0f,

                                    hash_function, 

                                    equals_function);



    distance_a = unordered_map_alloc(10,

                                     1.0f,

                                     hash_function,

                                     equals_function);



    distance_b = unordered_map_alloc(10,

                                     1.0f,

                                     hash_function,

                                     equals_function);



    queue_push_back(queue_a, source_node);

    queue_push_back(queue_b, target_node);

    unordered_map_put(parents_a, source_node, NULL);

    unordered_map_put(parents_b, target_node, NULL);

    unordered_map_put(distance_a, source_node, 0);

    unordered_map_put(distance_b, target_node, 0);



    best_cost = UINT_MAX;

    touch_node = NULL;



    while (queue_size(queue_a) > 0 && queue_size(queue_b) > 0)

    {

        dist_a = (size_t) unordered_map_get(distance_a, queue_front(queue_a));

        dist_b = (size_t) unordered_map_get(distance_a, queue_front(queue_b));



        if (touch_node && best_cost <= dist_a + dist_b)

        {

            return trace_back_path_bidirectional(touch_node,

                                                 parents_a,

                                                 parents_b);

        }



        current_node = queue_pop_front(queue_a);

        dist_a = (size_t) unordered_map_get(parents_a, current_node);

        dist_b = (size_t) unordered_map_get(parents_b, current_node);



        if (unordered_map_contains_key(parents_b, current_node)

            &&

            best_cost > dist_a + dist_b)

        {

            best_cost = dist_a + dist_b;

            touch_node = current_node;

        }



        child_iterator->child_node_iterator_init(child_iterator, 

                                                 current_node);



        while (child_iterator->child_node_iterator_has_next(child_iterator))

        {

            child_node = child_iterator->

                         child_node_iterator_next(child_iterator);



            if (!unordered_map_contains_key(parents_a, child_node))

            {

                unordered_map_put(parents_a, child_node, current_node);

                queue_push_back(queue_a, child_node);

            }

        }



        child_iterator->child_node_iterator_free(child_iterator);

        current_node = queue_pop_front(queue_b);

        dist_a = (size_t) unordered_map_get(distance_a, current_node);

        dist_b = (size_t) unordered_map_get(distance_b, current_node);



        if (unordered_map_contains_key(parents_a, current_node)

            &&

            best_cost > dist_a + dist_b)

        {

            best_cost = dist_a + dist_b;

            touch_node = current_node;

        }



        parent_iterator->parent_node_iterator_init(parent_iterator,

                                                   current_node);



        while (parent_iterator->

               parent_node_iterator_has_next(parent_iterator))

        {

            parent_node = parent_iterator->

                          parent_node_iterator_next(parent_iterator);



            if (!unordered_map_contains_key(parents_b, parent_node))

            {

                unordered_map_put(parents_b, parent_node, current_node);

                queue_push_back(queue_b, parent_node);

            }

        }



        parent_iterator->parent_node_iterator_free(parent_iterator);

    }



    return NULL;

}

breadth_first_search.c

#include "breadth_first_search.h"

#include "directed_graph_node.h"

#include "queue.h"

#include "list.h"

#include "unordered_map.h"

#include "unordered_set.h"



static list* trace_back_path(void* target_node, unordered_map* parents)

{

    list* path = list_alloc(10);

    void* node = target_node;



    while (node)

    {

        list_push_front(path, node);

        node = unordered_map_get(parents, node);

    }



    return path;

}



list* breadth_first_search(void* source_node, 

                           void* target_node,

                           child_node_iterator* child_iterator,

                           size_t (*hash_function)   (void*),

                           int    (*equals_function) (void*, void*))

{

    queue* q = queue_alloc();

    unordered_map* parent_map = 

        unordered_map_alloc(10,

                            1.0f, 

                            hash_function, 

                            equals_function);

    void* current_node;

    void* child_node;



    if (!source_node

        || !target_node

        || !child_iterator

        || !hash_function

        || !equals_function)

    {

        return NULL;

    }



    queue_push_back(q, source_node);

    unordered_map_put(parent_map, source_node, NULL);



    while (queue_size(q) > 0)

    {

        current_node = queue_pop_front(q);



        if (equals_function(current_node, target_node))

        {

            return trace_back_path(target_node, parent_map);

        }



        child_iterator->child_node_iterator_init(child_iterator, current_node);



        while (child_iterator->child_node_iterator_has_next(child_iterator))

        {

            child_node = child_iterator->

                         child_node_iterator_next(child_iterator);



            if (!unordered_map_contains_key(parent_map, child_node))

            {

                unordered_map_put(parent_map, child_node, current_node);

                queue_push_back(q, child_node);

            }

        }



        child_iterator->child_node_iterator_free(child_iterator);

    }



    return NULL;

}

(The entire repository is here.)

asked 12 mins ago

coderodde

15.9k639129

add a comment |

Is it a good idea to embed the unit tests of a data type in the same *.c files?

Is it a good idea to do rather explicit type casting in order to make gcc -Wall -pendatic -ansi shut up?

Might the code below rely on an antipattern?

Code

bidirectional_breadth_first_search.c

#include "bidirectional_breadth_first_search.h"

#include "list.h"

#include "queue.h"

#include "utils.h"

#include <limits.h>



#define NEIGHBOR_NODE_ITERATOR_HAS_NEXT child_node_iterator_has_next

#define NEIGHBOR_NODE_ITERATOR_NEXT     child_node_iterator_next



typedef child_node_iterator neighbor_node_iterator;



list* bidirectional_breadth_first_search(void* source_node,

                                         void* target_node,

                                         child_node_iterator* child_iterator,

                                         parent_node_iterator* parent_iterator,

                                         size_t (*hash_function)(void*),

                                         int (*equals_function)(void*, void*))

{

    queue* queue_a;

    queue* queue_b;

    unordered_map* parents_a;

    unordered_map* parents_b;

    unordered_map* distance_a;

    unordered_map* distance_b;

    size_t dist_a;

    size_t dist_b;

    size_t best_cost;

    void* touch_node;

    void* current_node;

    void* child_node;

    void* parent_node;



    if (!source_node

        || !target_node

        || !child_iterator

        || !parent_iterator

        || !hash_function

        || !equals_function)

    {

        return NULL;

    }



    queue_a = queue_alloc();

    queue_b = queue_alloc();



    parents_a = unordered_map_alloc(10,

                                    1.0f,

                                    hash_function,

                                    equals_function);



    parents_b = unordered_map_alloc(10,

                                    1.0f,

                                    hash_function, 

                                    equals_function);



    distance_a = unordered_map_alloc(10,

                                     1.0f,

                                     hash_function,

                                     equals_function);



    distance_b = unordered_map_alloc(10,

                                     1.0f,

                                     hash_function,

                                     equals_function);



    queue_push_back(queue_a, source_node);

    queue_push_back(queue_b, target_node);

    unordered_map_put(parents_a, source_node, NULL);

    unordered_map_put(parents_b, target_node, NULL);

    unordered_map_put(distance_a, source_node, 0);

    unordered_map_put(distance_b, target_node, 0);



    best_cost = UINT_MAX;

    touch_node = NULL;



    while (queue_size(queue_a) > 0 && queue_size(queue_b) > 0)

    {

        dist_a = (size_t) unordered_map_get(distance_a, queue_front(queue_a));

        dist_b = (size_t) unordered_map_get(distance_a, queue_front(queue_b));



        if (touch_node && best_cost <= dist_a + dist_b)

        {

            return trace_back_path_bidirectional(touch_node,

                                                 parents_a,

                                                 parents_b);

        }



        current_node = queue_pop_front(queue_a);

        dist_a = (size_t) unordered_map_get(parents_a, current_node);

        dist_b = (size_t) unordered_map_get(parents_b, current_node);



        if (unordered_map_contains_key(parents_b, current_node)

            &&

            best_cost > dist_a + dist_b)

        {

            best_cost = dist_a + dist_b;

            touch_node = current_node;

        }



        child_iterator->child_node_iterator_init(child_iterator, 

                                                 current_node);



        while (child_iterator->child_node_iterator_has_next(child_iterator))

        {

            child_node = child_iterator->

                         child_node_iterator_next(child_iterator);



            if (!unordered_map_contains_key(parents_a, child_node))

            {

                unordered_map_put(parents_a, child_node, current_node);

                queue_push_back(queue_a, child_node);

            }

        }



        child_iterator->child_node_iterator_free(child_iterator);

        current_node = queue_pop_front(queue_b);

        dist_a = (size_t) unordered_map_get(distance_a, current_node);

        dist_b = (size_t) unordered_map_get(distance_b, current_node);



        if (unordered_map_contains_key(parents_a, current_node)

            &&

            best_cost > dist_a + dist_b)

        {

            best_cost = dist_a + dist_b;

            touch_node = current_node;

        }



        parent_iterator->parent_node_iterator_init(parent_iterator,

                                                   current_node);



        while (parent_iterator->

               parent_node_iterator_has_next(parent_iterator))

        {

            parent_node = parent_iterator->

                          parent_node_iterator_next(parent_iterator);



            if (!unordered_map_contains_key(parents_b, parent_node))

            {

                unordered_map_put(parents_b, parent_node, current_node);

                queue_push_back(queue_b, parent_node);

            }

        }



        parent_iterator->parent_node_iterator_free(parent_iterator);

    }



    return NULL;

}

breadth_first_search.c

#include "breadth_first_search.h"

#include "directed_graph_node.h"

#include "queue.h"

#include "list.h"

#include "unordered_map.h"

#include "unordered_set.h"



static list* trace_back_path(void* target_node, unordered_map* parents)

{

    list* path = list_alloc(10);

    void* node = target_node;



    while (node)

    {

        list_push_front(path, node);

        node = unordered_map_get(parents, node);

    }



    return path;

}



list* breadth_first_search(void* source_node, 

                           void* target_node,

                           child_node_iterator* child_iterator,

                           size_t (*hash_function)   (void*),

                           int    (*equals_function) (void*, void*))

{

    queue* q = queue_alloc();

    unordered_map* parent_map = 

        unordered_map_alloc(10,

                            1.0f, 

                            hash_function, 

                            equals_function);

    void* current_node;

    void* child_node;



    if (!source_node

        || !target_node

        || !child_iterator

        || !hash_function

        || !equals_function)

    {

        return NULL;

    }



    queue_push_back(q, source_node);

    unordered_map_put(parent_map, source_node, NULL);



    while (queue_size(q) > 0)

    {

        current_node = queue_pop_front(q);



        if (equals_function(current_node, target_node))

        {

            return trace_back_path(target_node, parent_map);

        }



        child_iterator->child_node_iterator_init(child_iterator, current_node);



        while (child_iterator->child_node_iterator_has_next(child_iterator))

        {

            child_node = child_iterator->

                         child_node_iterator_next(child_iterator);



            if (!unordered_map_contains_key(parent_map, child_node))

            {

                unordered_map_put(parent_map, child_node, current_node);

                queue_push_back(q, child_node);

            }

        }



        child_iterator->child_node_iterator_free(child_iterator);

    }



    return NULL;

}

(The entire repository is here.)

asked 12 mins ago

coderodde

15.9k639129

add a comment |

Is it a good idea to embed the unit tests of a data type in the same *.c files?

Is it a good idea to do rather explicit type casting in order to make gcc -Wall -pendatic -ansi shut up?

Might the code below rely on an antipattern?

Code

bidirectional_breadth_first_search.c

#include "bidirectional_breadth_first_search.h"

#include "list.h"

#include "queue.h"

#include "utils.h"

#include <limits.h>



#define NEIGHBOR_NODE_ITERATOR_HAS_NEXT child_node_iterator_has_next

#define NEIGHBOR_NODE_ITERATOR_NEXT     child_node_iterator_next



typedef child_node_iterator neighbor_node_iterator;



list* bidirectional_breadth_first_search(void* source_node,

                                         void* target_node,

                                         child_node_iterator* child_iterator,

                                         parent_node_iterator* parent_iterator,

                                         size_t (*hash_function)(void*),

                                         int (*equals_function)(void*, void*))

{

    queue* queue_a;

    queue* queue_b;

    unordered_map* parents_a;

    unordered_map* parents_b;

    unordered_map* distance_a;

    unordered_map* distance_b;

    size_t dist_a;

    size_t dist_b;

    size_t best_cost;

    void* touch_node;

    void* current_node;

    void* child_node;

    void* parent_node;



    if (!source_node

        || !target_node

        || !child_iterator

        || !parent_iterator

        || !hash_function

        || !equals_function)

    {

        return NULL;

    }



    queue_a = queue_alloc();

    queue_b = queue_alloc();



    parents_a = unordered_map_alloc(10,

                                    1.0f,

                                    hash_function,

                                    equals_function);



    parents_b = unordered_map_alloc(10,

                                    1.0f,

                                    hash_function, 

                                    equals_function);



    distance_a = unordered_map_alloc(10,

                                     1.0f,

                                     hash_function,

                                     equals_function);



    distance_b = unordered_map_alloc(10,

                                     1.0f,

                                     hash_function,

                                     equals_function);



    queue_push_back(queue_a, source_node);

    queue_push_back(queue_b, target_node);

    unordered_map_put(parents_a, source_node, NULL);

    unordered_map_put(parents_b, target_node, NULL);

    unordered_map_put(distance_a, source_node, 0);

    unordered_map_put(distance_b, target_node, 0);



    best_cost = UINT_MAX;

    touch_node = NULL;



    while (queue_size(queue_a) > 0 && queue_size(queue_b) > 0)

    {

        dist_a = (size_t) unordered_map_get(distance_a, queue_front(queue_a));

        dist_b = (size_t) unordered_map_get(distance_a, queue_front(queue_b));



        if (touch_node && best_cost <= dist_a + dist_b)

        {

            return trace_back_path_bidirectional(touch_node,

                                                 parents_a,

                                                 parents_b);

        }



        current_node = queue_pop_front(queue_a);

        dist_a = (size_t) unordered_map_get(parents_a, current_node);

        dist_b = (size_t) unordered_map_get(parents_b, current_node);



        if (unordered_map_contains_key(parents_b, current_node)

            &&

            best_cost > dist_a + dist_b)

        {

            best_cost = dist_a + dist_b;

            touch_node = current_node;

        }



        child_iterator->child_node_iterator_init(child_iterator, 

                                                 current_node);



        while (child_iterator->child_node_iterator_has_next(child_iterator))

        {

            child_node = child_iterator->

                         child_node_iterator_next(child_iterator);



            if (!unordered_map_contains_key(parents_a, child_node))

            {

                unordered_map_put(parents_a, child_node, current_node);

                queue_push_back(queue_a, child_node);

            }

        }



        child_iterator->child_node_iterator_free(child_iterator);

        current_node = queue_pop_front(queue_b);

        dist_a = (size_t) unordered_map_get(distance_a, current_node);

        dist_b = (size_t) unordered_map_get(distance_b, current_node);



        if (unordered_map_contains_key(parents_a, current_node)

            &&

            best_cost > dist_a + dist_b)

        {

            best_cost = dist_a + dist_b;

            touch_node = current_node;

        }



        parent_iterator->parent_node_iterator_init(parent_iterator,

                                                   current_node);



        while (parent_iterator->

               parent_node_iterator_has_next(parent_iterator))

        {

            parent_node = parent_iterator->

                          parent_node_iterator_next(parent_iterator);



            if (!unordered_map_contains_key(parents_b, parent_node))

            {

                unordered_map_put(parents_b, parent_node, current_node);

                queue_push_back(queue_b, parent_node);

            }

        }



        parent_iterator->parent_node_iterator_free(parent_iterator);

    }



    return NULL;

}

breadth_first_search.c

#include "breadth_first_search.h"

#include "directed_graph_node.h"

#include "queue.h"

#include "list.h"

#include "unordered_map.h"

#include "unordered_set.h"



static list* trace_back_path(void* target_node, unordered_map* parents)

{

    list* path = list_alloc(10);

    void* node = target_node;



    while (node)

    {

        list_push_front(path, node);

        node = unordered_map_get(parents, node);

    }



    return path;

}



list* breadth_first_search(void* source_node, 

                           void* target_node,

                           child_node_iterator* child_iterator,

                           size_t (*hash_function)   (void*),

                           int    (*equals_function) (void*, void*))

{

    queue* q = queue_alloc();

    unordered_map* parent_map = 

        unordered_map_alloc(10,

                            1.0f, 

                            hash_function, 

                            equals_function);

    void* current_node;

    void* child_node;



    if (!source_node

        || !target_node

        || !child_iterator

        || !hash_function

        || !equals_function)

    {

        return NULL;

    }



    queue_push_back(q, source_node);

    unordered_map_put(parent_map, source_node, NULL);



    while (queue_size(q) > 0)

    {

        current_node = queue_pop_front(q);



        if (equals_function(current_node, target_node))

        {

            return trace_back_path(target_node, parent_map);

        }



        child_iterator->child_node_iterator_init(child_iterator, current_node);



        while (child_iterator->child_node_iterator_has_next(child_iterator))

        {

            child_node = child_iterator->

                         child_node_iterator_next(child_iterator);



            if (!unordered_map_contains_key(parent_map, child_node))

            {

                unordered_map_put(parent_map, child_node, current_node);

                queue_push_back(q, child_node);

            }

        }



        child_iterator->child_node_iterator_free(child_iterator);

    }



    return NULL;

}

(The entire repository is here.)

asked 12 mins ago

coderodde

15.9k639129

Is it a good idea to embed the unit tests of a data type in the same *.c files?

Is it a good idea to do rather explicit type casting in order to make gcc -Wall -pendatic -ansi shut up?

Might the code below rely on an antipattern?

Code

bidirectional_breadth_first_search.c

#include "bidirectional_breadth_first_search.h"

#include "list.h"

#include "queue.h"

#include "utils.h"

#include <limits.h>



#define NEIGHBOR_NODE_ITERATOR_HAS_NEXT child_node_iterator_has_next

#define NEIGHBOR_NODE_ITERATOR_NEXT     child_node_iterator_next



typedef child_node_iterator neighbor_node_iterator;



list* bidirectional_breadth_first_search(void* source_node,

                                         void* target_node,

                                         child_node_iterator* child_iterator,

                                         parent_node_iterator* parent_iterator,

                                         size_t (*hash_function)(void*),

                                         int (*equals_function)(void*, void*))

{

    queue* queue_a;

    queue* queue_b;

    unordered_map* parents_a;

    unordered_map* parents_b;

    unordered_map* distance_a;

    unordered_map* distance_b;

    size_t dist_a;

    size_t dist_b;

    size_t best_cost;

    void* touch_node;

    void* current_node;

    void* child_node;

    void* parent_node;



    if (!source_node

        || !target_node

        || !child_iterator

        || !parent_iterator

        || !hash_function

        || !equals_function)

    {

        return NULL;

    }



    queue_a = queue_alloc();

    queue_b = queue_alloc();



    parents_a = unordered_map_alloc(10,

                                    1.0f,

                                    hash_function,

                                    equals_function);



    parents_b = unordered_map_alloc(10,

                                    1.0f,

                                    hash_function, 

                                    equals_function);



    distance_a = unordered_map_alloc(10,

                                     1.0f,

                                     hash_function,

                                     equals_function);



    distance_b = unordered_map_alloc(10,

                                     1.0f,

                                     hash_function,

                                     equals_function);



    queue_push_back(queue_a, source_node);

    queue_push_back(queue_b, target_node);

    unordered_map_put(parents_a, source_node, NULL);

    unordered_map_put(parents_b, target_node, NULL);

    unordered_map_put(distance_a, source_node, 0);

    unordered_map_put(distance_b, target_node, 0);



    best_cost = UINT_MAX;

    touch_node = NULL;



    while (queue_size(queue_a) > 0 && queue_size(queue_b) > 0)

    {

        dist_a = (size_t) unordered_map_get(distance_a, queue_front(queue_a));

        dist_b = (size_t) unordered_map_get(distance_a, queue_front(queue_b));



        if (touch_node && best_cost <= dist_a + dist_b)

        {

            return trace_back_path_bidirectional(touch_node,

                                                 parents_a,

                                                 parents_b);

        }



        current_node = queue_pop_front(queue_a);

        dist_a = (size_t) unordered_map_get(parents_a, current_node);

        dist_b = (size_t) unordered_map_get(parents_b, current_node);



        if (unordered_map_contains_key(parents_b, current_node)

            &&

            best_cost > dist_a + dist_b)

        {

            best_cost = dist_a + dist_b;

            touch_node = current_node;

        }



        child_iterator->child_node_iterator_init(child_iterator, 

                                                 current_node);



        while (child_iterator->child_node_iterator_has_next(child_iterator))

        {

            child_node = child_iterator->

                         child_node_iterator_next(child_iterator);



            if (!unordered_map_contains_key(parents_a, child_node))

            {

                unordered_map_put(parents_a, child_node, current_node);

                queue_push_back(queue_a, child_node);

            }

        }



        child_iterator->child_node_iterator_free(child_iterator);

        current_node = queue_pop_front(queue_b);

        dist_a = (size_t) unordered_map_get(distance_a, current_node);

        dist_b = (size_t) unordered_map_get(distance_b, current_node);



        if (unordered_map_contains_key(parents_a, current_node)

            &&

            best_cost > dist_a + dist_b)

        {

            best_cost = dist_a + dist_b;

            touch_node = current_node;

        }



        parent_iterator->parent_node_iterator_init(parent_iterator,

                                                   current_node);



        while (parent_iterator->

               parent_node_iterator_has_next(parent_iterator))

        {

            parent_node = parent_iterator->

                          parent_node_iterator_next(parent_iterator);



            if (!unordered_map_contains_key(parents_b, parent_node))

            {

                unordered_map_put(parents_b, parent_node, current_node);

                queue_push_back(queue_b, parent_node);

            }

        }



        parent_iterator->parent_node_iterator_free(parent_iterator);

    }



    return NULL;

}

breadth_first_search.c

#include "breadth_first_search.h"

#include "directed_graph_node.h"

#include "queue.h"

#include "list.h"

#include "unordered_map.h"

#include "unordered_set.h"



static list* trace_back_path(void* target_node, unordered_map* parents)

{

    list* path = list_alloc(10);

    void* node = target_node;



    while (node)

    {

        list_push_front(path, node);

        node = unordered_map_get(parents, node);

    }



    return path;

}



list* breadth_first_search(void* source_node, 

                           void* target_node,

                           child_node_iterator* child_iterator,

                           size_t (*hash_function)   (void*),

                           int    (*equals_function) (void*, void*))

{

    queue* q = queue_alloc();

    unordered_map* parent_map = 

        unordered_map_alloc(10,

                            1.0f, 

                            hash_function, 

                            equals_function);

    void* current_node;

    void* child_node;



    if (!source_node

        || !target_node

        || !child_iterator

        || !hash_function

        || !equals_function)

    {

        return NULL;

    }



    queue_push_back(q, source_node);

    unordered_map_put(parent_map, source_node, NULL);



    while (queue_size(q) > 0)

    {

        current_node = queue_pop_front(q);



        if (equals_function(current_node, target_node))

        {

            return trace_back_path(target_node, parent_map);

        }



        child_iterator->child_node_iterator_init(child_iterator, current_node);



        while (child_iterator->child_node_iterator_has_next(child_iterator))

        {

            child_node = child_iterator->

                         child_node_iterator_next(child_iterator);



            if (!unordered_map_contains_key(parent_map, child_node))

            {

                unordered_map_put(parent_map, child_node, current_node);

                queue_push_back(q, child_node);

            }

        }



        child_iterator->child_node_iterator_free(child_iterator);

    }



    return NULL;

}

(The entire repository is here.)

c library pathfinding c89

asked 12 mins ago

coderodde

15.9k639129

asked 12 mins ago

coderodde

15.9k639129

asked 12 mins ago

coderodde

15.9k639129

asked 12 mins ago

coderodde

15.9k639129

asked 12 mins ago

coderodde

15.9k639129

add a comment |

0

active

oldest

votes

Your Answer

StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["\$", "\$"]]);
});
});
}, "mathjax-editing");

StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "196"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});

}
});

draft saved

draft discarded

Sign up or log in

StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});

Post as a guest

Name

Required, but never shown

StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f216210%2funi-and-bidirectional-pseudo-generic-shortest-path-finders-in-c89%23new-answer', 'question_page');
}
);

Post as a guest

Name

Required, but never shown

0

active

oldest

votes

0

active

oldest

votes

draft saved

draft discarded

Thanks for contributing an answer to Code Review Stack Exchange!

Please be sure to answer the question. Provide details and share your research!

But avoid …

Asking for help, clarification, or responding to other answers.

Making statements based on opinion; back them up with references or personal experience.

Use MathJax to format equations. MathJax reference.

To learn more, see our tips on writing great answers.

draft saved

draft discarded

Sign up or log in

StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});

Post as a guest

Name

Required, but never shown

Post as a guest

Name

Required, but never shown

Sign up or log in

StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});

Post as a guest

Name

Required, but never shown

Sign up or log in

StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});

Post as a guest

Name

Required, but never shown

Sign up or log in

StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});

Post as a guest

Name

Required, but never shown

Name

Required, but never shown

Name

Required, but never shown

This page is only for reference, If you need detailed information, please check here

搜尋此網誌

Nsryjdtyk