+1 (315) 557-6473 

Program To Implement Adjacent Lists and Graphs in C Assignment Solutions.


GET FREE QUOTE
  1. Home
  2. To Implement Graphs and Adjacent Lists in C Assignment Solutions.

Instructions

Objective
Write a C assignment program to implement graphs and adjacent lists.

Requirements and Specifications

Implement graphs and adjacent lists in C language
Implement graphs and adjacent lists in C language 1
Source Code
TEST 1
#include "t1.h"
// converts an upper case character (A-Z) to a numerical value (between 0 and 25)
static int char2val ( char c ) {
 if ( c < 'A' || c > 'Z' ) {
  return -1;
 }
 return c-'A';
}
int main(){
    int num_nodes = 6;
    Graph *graph = create_graph(num_nodes);
    add_edge(graph, char2val('A'), char2val('E'));
    add_edge(graph, char2val('B'), char2val('D'));
    add_edge(graph, char2val('A'), char2val('D'));
    add_edge(graph, char2val('A'), char2val('B'));
    add_edge(graph, char2val('B'), char2val('C'));
    add_edge(graph, char2val('C'), char2val('B'));
    add_edge(graph, char2val('E'), char2val('D'));
    add_edge(graph, char2val('D'), char2val('F'));
    add_edge(graph, char2val('F'), char2val('C'));
    add_edge(graph, char2val('C'), char2val('D'));
    dfs(graph, char2val('A'));
    bfs(graph, char2val('A'));
    delete_graph(graph);
}
TEST 2
#include "t1.h"
// converts an upper case character (A-Z) to a numerical value (between 0 and 25)
static int char2val ( char c ) {
 if ( c < 'A' || c > 'Z' ) {
  return -1;
 }
 return c-'A';
}
int main(){
    int num_nodes = 6;
    Graph *graph = create_graph(num_nodes);
    add_edge(graph, char2val('A'), char2val('E'));
    add_edge(graph, char2val('B'), char2val('D'));
    add_edge(graph, char2val('A'), char2val('D'));
    add_edge(graph, char2val('A'), char2val('B'));
    add_edge(graph, char2val('B'), char2val('C'));
    add_edge(graph, char2val('C'), char2val('B'));
    add_edge(graph, char2val('E'), char2val('D'));
    add_edge(graph, char2val('D'), char2val('F'));
    add_edge(graph, char2val('F'), char2val('C'));
    add_edge(graph, char2val('C'), char2val('D'));
    dfs(graph, char2val('A'));
    bfs(graph, char2val('A'));
    delete_graph(graph);
}