Skip to content
#

singly-linked-list

Here are 221 public repositories matching this topic...

This project finds the smallest path with minimum spanning tree value of connection to loads and source which is Minimum Spanning Tree of the undirected graph and finds the shortest paths from a single source to all load points and the graph is directed graph.

  • Updated Jun 6, 2024
  • Java

This is a simple implementation of a singly linked-list in C. Singly linked-lists are a type of data structure that are used to store a collection of elements. Each element in a singly linked-list is called a node. Each node contains two parts: the data and a pointer to the next node. The first node in a singly linked-list is called the head.

  • Updated Dec 20, 2022
  • C

Improve this page

Add a description, image, and links to the singly-linked-list topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the singly-linked-list topic, visit your repo's landing page and select "manage topics."

Learn more