GIS, GeoDBMS und Programmierung
This article of 2012 at http://stegua.github.io/ shows, that the type of the priority queue of a shortest path solver is crucial for the solving time. You have to agree with that, but there is another point to mention: the choice of Read More
In the previous articles I explained the usage of the APIs of LEMON and Boost Graph Library (BGL). Now I want to sum up the differences of them. Of course this is very opinion-based. 1. Simplicity LEMON has despite its Read More
Boost Graph Library The Boost Graph library (BGL) is a part of the famous Boost library. The BGL graph interface and graph components are generic, in the same sense as the Standard Template Library (STL). As LEMON the BGL also Read More
Unter http://www.lwf.bayern.de/wks hat die LWF am Freitag 14.10.16 eine neue WebApp zur Anzeige der Witterungsdaten von Waldklimastationen aus ganz Bayern veröffentlicht. Die App wurde mit der ArcGIS Javascript API entwickelt und ist nun neben dem Borkenkäfermonitoring die zweite WebApp der Read More
Recently I signed up for a GitHub account. First I was a little annoyed reading and hearing sentences like „..and we’re also at GitHub – we’re embracing open source..“. Aha. Any company that sells proprietary software was now on GitHub: Read More
LEMON Graph Library LEMON stands for Library for Efficient Modeling and Optimization in Networks. It is a C++ template library providing efficient implementations of common data structures and algorithms with focus on combinatorial optimization tasks connected mainly with graphs and Read More
Shortest Path Problem 3 years later I’m back with a new article in my blog – time flies.. The Shortest Path Problem is a common problem to nearly anyone nowadays. Anyone who used a navigation system or Google Maps for Read More
pyMCFsimplex – a Python Wrapper for MCFSimplex pyMCFimplex is a Python-Wrapper for the C++ MCFSimplex Solver Class from the Operations Research Group at the University of Pisa. MCFSimplex is a piece of software hat solves big sized Minimum Cost Flow Read More
Push-relabel algorithm: Google or-tools At last we will solve the instance of a Minimum cost flow problem described in (1) with Google or-tools. Node 1 is the source node, nodes 2 and 3 are the transshipment nodes and node 4 Read More
Network Simplex Solver: NetworkX We will solve the instance of a Minimum cost flow problem described in (1) with NetworkX. Node 1 is the source node, nodes 2 and 3 are the transshipment nodes and node 4 is the sink Read More