https://github.com/vedant1100/graph
https://github.com/vedant1100/graph
Last synced: 3 months ago
JSON representation
- Host: GitHub
- URL: https://github.com/vedant1100/graph
- Owner: vedant1100
- Created: 2023-09-14T16:28:20.000Z (almost 2 years ago)
- Default Branch: master
- Last Pushed: 2023-09-14T16:52:05.000Z (almost 2 years ago)
- Last Synced: 2025-01-21T03:44:39.030Z (5 months ago)
- Language: C++
- Size: 20.5 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
There are flight paths between cities. If there is a flight between city A and city B then there is an edge between the cities. The cost of the edge can be the time that flight take to reach city B from A, or the amount of fuel used for the journey. Represent this as a graph. The node can be represented by airport name or name of the city. Use adjacency list representation of the graph or use adjacency matrix representation of the graph. Check whether the graph is connected or not.