Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/gunksd/data-structure-course-design
用C语言写的数据结构课程设计作业(2024.2.22)
https://github.com/gunksd/data-structure-course-design
c data-structures
Last synced: 6 days ago
JSON representation
用C语言写的数据结构课程设计作业(2024.2.22)
- Host: GitHub
- URL: https://github.com/gunksd/data-structure-course-design
- Owner: gunksd
- Created: 2024-02-22T07:47:48.000Z (12 months ago)
- Default Branch: main
- Last Pushed: 2024-08-14T10:33:42.000Z (6 months ago)
- Last Synced: 2024-12-16T01:12:20.328Z (2 months ago)
- Topics: c, data-structures
- Language: C++
- Homepage:
- Size: 1.5 MB
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Campus Navigation System - Data Structure Course Design
**Date:** 2024.2.22## Overview
This is a simplistic campus navigation system developed as part of a data structure course design project. The system is implemented in C and leverages graph theory, specifically using Floyd's algorithm for shortest path computation.**Note:** All distances and routes are fictional. Any resemblance to real locations or situations is purely coincidental.
## Features
- **Graph Representation:** The campus is represented as a graph, where buildings or locations are nodes, and paths between them are edges with associated distances.
- **Floyd's Algorithm:** The system employs Floyd's algorithm to calculate the shortest paths between all pairs of nodes, ensuring efficient navigation across the campus.
- **User Interaction:** Users can input start and end locations to get the shortest route between them.## Technical Details
- **Language:** C
- **Data Structures Used:**
- **Graph:** Represented using adjacency matrices.
- **Array:** Used for storing distances and paths.
- **Input/Output Handling:** Standard C I/O functions for user interaction.