#include <stdio.h>
#include <stdlib.h>
#include <limits.h>
// Structure to represent an edge in the graph
struct Edge {
int source; // Starting vertex of the edge
int destination; // Ending vertex of the edge
int weight; // Weight or cost associated with the edge
};
// Structure to represent a graph
struct Graph {
int numVertices; // Number of vertices in the graph
int numEdges; // Number of edges in the graph
struct Edge* edges; // Array of edges in the graph
};
// Function to create a graph with a given number of vertices and edges
struct Graph* createGraph(int numVertices, int numEdges)
{
// Allocate memory for the graph structure
struct Graph* graph = (struct Graph*)malloc(sizeof(struct Graph));
graph->numVertices = numVertices;
graph->numEdges = numEdges;
// Allocate memory for the array of edges
graph->edges = (struct Edge*)malloc(numEdges * sizeof(struct Edge));
return graph;
}
// Function to print the distances from the source vertex to all other vertices
void printDistances(int dist[], int numVertices)
{
printf("Vertex Distance from Source\n");
for (int i = 0; i < numVertices; ++i)
printf("%d \t\t %d\n", i, dist[i]);
}
// Function to find the shortest path distances using the Bellman-Ford algorithm
void BellmanFord(struct Graph* graph, int source)
{
int numVertices = graph->numVertices;
int numEdges = graph->numEdges;
int distances[numVertices];
// Initialize all distances as infinity except the source vertex
for (int i = 0; i < numVertices; i++)
distances[i] = INT_MAX;
distances[source] = 0;
// Relax all edges (V-1) times to find the shortest distances
for (int i = 1; i <= numVertices - 1; i++) {
for (int j = 0; j < numEdges; j++) {
int u = graph->edges[j].source;
int v = graph->edges[j].destination;
int weight = graph->edges[j].weight;
// Check if a shorter path is available
if (distances[u] != INT_MAX && distances[u] + weight < distances[v])
distances[v] = distances[u] + weight;
}
}
// Check for negative-weight cycles
for (int i = 0; i < numEdges; i++) {
int u = graph->edges[i].source;
int v = graph->edges[i].destination;
int weight = graph->edges[i].weight;
// If a shorter path exists, a negative-weight cycle is present
if (distances[u] != INT_MAX && distances[u] + weight < distances[v]) {
printf("Graph contains negative weight cycle");
return;
}
}
// Print the shortest path distances
printDistances(distances, numVertices);
}
// Main function
int main()
{
int numVertices = 5; // Number of vertices in the graph
int numEdges = 8; // Number of edges in the graph
// Create a graph with the given number of vertices and edges
struct Graph* graph = createGraph(numVertices, numEdges);
// Set the details of each edge in the graph
graph->edges[0].source = 0;
graph->edges[0].destination = 1;
graph->edges[0].weight = -1;
graph->edges[1].source = 0;
graph->edges[1].destination = 2;
graph->edges[1].weight = 4;
graph->edges[2].source = 1;
graph->edges[2].destination = 2;
graph->edges[2].weight = 3;
graph->edges[3].source = 1;
graph->edges[3].destination = 3;
graph->edges[3].weight = 2;
graph->edges[4].source = 1;
graph->edges[4].destination = 4;
graph->edges[4].weight = 2;
graph->edges[5].source = 3;
graph->edges[5].destination = 2;
graph->edges[5].weight = 5;
graph->edges[6].source = 3;
graph->edges[6].destination = 1;
graph->edges[6].weight = 1;
graph->edges[7].source = 4;
graph->edges[7].destination = 3;
graph->edges[7].weight = -3;
// Find the shortest path distances using the Bellman-Ford algorithm
BellmanFord(graph, 0);
// Free the allocated memory
free(graph->edges);
free(graph);
return 0;
} Write, Run & Share C Language code online using OneCompiler's C online compiler for free. It's one of the robust, feature-rich online compilers for C language, running the latest C version which is C18. Getting started with the OneCompiler's C editor is really simple and pretty fast. The editor shows sample boilerplate code when you choose language as 'C' and start coding!
OneCompiler's C online editor supports stdin and users can give inputs to programs using the STDIN textbox under the I/O tab. Following is a sample C program which takes name as input and print your name with hello.
#include <stdio.h>
int main()
{
char name[50];
printf("Enter name:");
scanf("%s", name);
printf("Hello %s \n" , name );
return 0;
}
C language is one of the most popular general-purpose programming language developed by Dennis Ritchie at Bell laboratories for UNIX operating system. The initial release of C Language was in the year 1972. Most of the desktop operating systems are written in C Language.
When ever you want to perform a set of operations based on a condition if-else is used.
if(conditional-expression) {
// code
} else {
// code
}
You can also use if-else for nested Ifs and if-else-if ladder when multiple conditions are to be performed on a single variable.
Switch is an alternative to if-else-if ladder.
switch(conditional-expression) {
case value1:
// code
break; // optional
case value2:
// code
break; // optional
...
default:
// code to be executed when all the above cases are not matched;
}
For loop is used to iterate a set of statements based on a condition.
for(Initialization; Condition; Increment/decrement){
// code
}
While is also used to iterate a set of statements based on a condition. Usually while is preferred when number of iterations are not known in advance.
while(condition) {
// code
}
Do-while is also used to iterate a set of statements based on a condition. It is mostly used when you need to execute the statements atleast once.
do {
// code
} while (condition);
Array is a collection of similar data which is stored in continuous memory addresses. Array values can be fetched using index. Index starts from 0 to size-1.
data-type array-name[size];
data-type array-name[size][size];
Function is a sub-routine which contains set of statements. Usually functions are written when multiple calls are required to same set of statements which increases re-usuability and modularity.
Two types of functions are present in C
Library functions are the in-built functions which are declared in header files like printf(),scanf(),puts(),gets() etc.,
User defined functions are the ones which are written by the programmer based on the requirement.
return_type function_name(parameters);
function_name (parameters)
return_type function_name(parameters) {
//code
}