https://github.com/barannmeisterr/minimum-spanning-tree-prim-algorithm--and-shortest-path--dijkstra-algorithm
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.
https://github.com/barannmeisterr/minimum-spanning-tree-prim-algorithm--and-shortest-path--dijkstra-algorithm
dijkstra-algorithm dijkstra-shortest-path directed-graph java minimum-spanning-tree oop prims-algorithm prims-implementation shortest-paths singly-linked-list stack undirected-graph
Last synced: 12 days ago
JSON representation
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.
- Host: GitHub
- URL: https://github.com/barannmeisterr/minimum-spanning-tree-prim-algorithm--and-shortest-path--dijkstra-algorithm
- Owner: barannmeisterr
- License: mit
- Created: 2024-06-06T19:41:50.000Z (about 1 year ago)
- Default Branch: main
- Last Pushed: 2024-06-28T14:29:17.000Z (12 months ago)
- Last Synced: 2025-05-16T22:14:30.890Z (about 1 month ago)
- Topics: dijkstra-algorithm, dijkstra-shortest-path, directed-graph, java, minimum-spanning-tree, oop, prims-algorithm, prims-implementation, shortest-paths, singly-linked-list, stack, undirected-graph
- Language: Java
- Homepage:
- Size: 15.6 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# Minimum Spanning Tree And Shortest Path
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.
## Author
- Arda Baran
## Features
- Implementing Prim's Algorithm in order to find Minimum Spanning Tree.
- Implementing Dijkstra's Algorithm in order to find shortest path from a single source to all destination.
- Prim's algorithm and Dijkstra's algorithm implemented as unique way and implementation bases on the definition of these algorithms
- Dynamic Programming
## Technologies And Data Structures Used
- Java
- Undirected Graph
- Directed Graph
- Two Dimensional Array For Adjacency Matrix Implementation(Both boolean and integer types)
- Singly Linked List
- Prim's Algorithm
- Dijkstra's Algorithm
- Object Oriented Programming
- Stack Singly Linked List Implementation
## File Structure
- src/: Contains the Java source code