Map library for displaying markers and finding shortest path amongst them using Dijkstra's algorithm.
Map implementation is done using efficient Kotlin library MapView by peterLaurence
Install using gradle with desired version (latest is recommended):
repositories {
...
maven { url 'https://jitpack.io' }
}
dependencies {
implementation 'com.github.unbearables:mapigate:{mapigate-version}'
}Easy ready to use implementation using MapigateFragment:
class MapFragment: MapigateFragment() {
override fun onCreateView(inflater: LayoutInflater, container: ViewGroup?,
savedInstanceState: Bundle?): View? {
return super.onCreateView(inflater, container, savedInstanceState).also {
val markers = mutableListOf<MapMarker>()
// fill markers list
populateMap(markers)
val dijkstraPaths = mutableListOf<IDjikstraPath>()
// fill markers list
initDijkstra(dijkstraPaths)
}
}
override fun configureMap(): MapConfiguration {
val topLat, rightLng, bottomLat, leftLng = ... // your coordinate bounds
return MapConfiguration(topLat, rightLng, bottomLat, leftLng, 3815, 3085, 5, 256, 4f)
}
}This project is result of a diploma thesis