Skip to content
/ map Public

An app for creating and traversing through maps using graph datastructure

License

Notifications You must be signed in to change notification settings

ja-odur/map

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

14 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Map

An app for creating and traversing through maps using graph datastructure.

Prerequisites

Cloning and installing dependencies

  • After installing the prerequisites above, clone the repository Develop branch using this command git clone -b develop https://github.com/ja-odur/map.git
  • Change into the newly cloned repo through cd map

Installing virtual environment

  • Using pipenv, start the environment and install requirements
  • $ pipenv shell
  • $ pipenv install. That didn't work, try pipenv install --skip-lock

Usage

  • Import the Map class from map import Map
  • Instantiate the Map class graph = Map(['place1', 'place2', 'place3'])
  • Add edges between any of the places graph.add_edge('place1', 'place3')
  • Find the shortest path between two places graph.shortest_path('place1', 'place3')
  • Topologically sort DAG (Directed Acyclic Graphs) graph.topological_sort()
  • Establish the minimum spanning tree graph.minimum_spanning_tree()

About

An app for creating and traversing through maps using graph datastructure

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages