How asad-maiga/singlylinkedlist works
This is a small C singly linked-list library with a demonstration program. The demo builds a list, exercises insertion, sorting, printing, rotation, deletion, reversal, and cleanup; the library implements those operations over heap-allocated nodes. The README is empty, so this map follows the sampled C source and does not infer additional capabilities.
Main entry points: main_singlyLinkedList.c List demo · singlyLinkedList.c Linked list
Components 12
Other components
- List demo
Scripts/main_singlyLinkedList.c - Linked list
Scripts/singlyLinkedList.c - List node
Scripts/singlyLinkedList.c - Create node
Scripts/singlyLinkedList.c - Insert nodes
Scripts/singlyLinkedList.c - Sort list
Scripts/singlyLinkedList.c - Print list
Scripts/singlyLinkedList.c - Rotate ends
Scripts/singlyLinkedList.c - Delete node
Scripts/singlyLinkedList.c - Reverse list
Scripts/singlyLinkedList.c - Free list
Scripts/singlyLinkedList.c - Terminal
Connections 17
- List demo → Insert nodes: calls
- List demo → Sort list: calls
- List demo → Print list: calls
- List demo → Rotate ends: calls
- List demo → Delete node: calls
- List demo → Reverse list: calls
- List demo → Free list: calls
- Insert nodes → Create node: allocates
- Create node → List node: creates
- Insert nodes → Linked list: updates
- Sort list → Linked list: reorders
- Print list → Linked list: traverses
- Print list → Terminal: prints
- Rotate ends → Linked list: relinks
- Delete node → Linked list: removes
- Reverse list → Linked list: reverses
- Free list → Linked list: frees