GNMANALYSE(1)

📦
version 3.4.3 · 2 versions
, in epel 9

🦋 GNMANALYSE(1) — the girlies' guide to network analysis

okay so bestie, this is gnmanalyse from the GDAL manual, and I'm gonna walk you through it like we're texting at 2am 💖 it's literally a program that does network analysis — think paths between points, shortest routes, that whole vibe. slay.

✨ NAME ✨

gnmanalyse — analyses networks. that's it, that's the whole job. iconic.

🌸 SYNOPSIS 🌸

okay so here's the exact shape of the invocation, don't @ me, just copy it:

gnmanalyse [--help][-q][-quiet][--long-usage]
        [dijkstra <start_gfid> <end_gfid> [[-alo NAME=VALUE] ...]]]
        [kpaths <start_gfid> <end_gfid> <k> [[-alo NAME=VALUE] ...]]]
        [resource [[-alo NAME=VALUE] ...]]]
        [-ds <ds_name>][-f <ds_format>][-l <layer_name>]
        [[-dsco NAME=VALUE] ...][-lco NAME=VALUE]
        <gnm_name>

look at all those nested brackets 🫶 everything in there is optional-ish, but <gnm_name> at the end is the main character — that one you actually need.

💅 DESCRIPTION 💅

so gnmanalyse gives you the analysing capabilities of geographical networks in GDAL. the results of calculations get returned in an OGRLayer format, or as console text output if such a layer is undefined. and the important bit — all calculations are made considering the blocking state of features, so blocked stuff stays blocked, periodt.

🎀 dijkstra <start_gfid> <end_gfid>

calculates the best path between two points using the Dijkstra algorithm, going from start_gfid point to end_gfid point. classic, reliable, no cap.

🎀 kpaths <start_gfid> <end_gfid>

calculates K shortest paths between two points using Yen's algorithm — which internally uses Dijkstra algorithm for single path calculating, iykyk — from start_gfid point to end_gfid point. so you get options, not just one route. we love choices ✨

🎀 resource

calculates the "resource distribution". the connected components search is performed using breadth-first search, starting from that features which are marked by rules as 'EMITTERS'. very much the main character energy of the network, fr fr.

💜 OPTIONS 💜

  • -d <ds_name> — the name and path of the dataset to save the layer with resulting paths. not need to be existed dataset, so don't stress about pre-creating it 🫶
  • -f <ds_format> — define this to set the format of newly created dataset.
  • -l <layer_name> — the name of the resulting layer. if the layer exist already — it will be rewritten, so heads up, your old layer is gone-gone 💀
  • <gnm_name> — the network to work with (path and name). the whole reason we're here.
  • -dsco NAME=VALUE — dataset creation option (format specific).
  • -lco NAME=VALUE — layer creation option (format specific).
  • -alo NAME=VALUE — algorithm option (format specific).
ngl bestie, watch that -l one. "will be rewritten" is not a drill, it's a whole personality. back up your layer if you care about it 🙈

🌈 AUTHOR 🌈

Mikhail Gusev <gusevmihs@gmail.com>, Dmitry Baryshnikov <polimax@mail.ru> — legends, both of them 👑

1998-2026 — yeah, a whole era. periodt.

and that's the page! 🎀 this was GNMANALYSE(1) from the GDAL manual, dated Jan 08, 2026. go analyse some networks bestie, you're gonna ate 💅✨

📦 where this page comes from