Brotkrumen
一款面向 Paper 服务器的导航点与寻路插件,基于数学图论构建。
它允许你在世界中定义相互连接的节点网络,然后引导玩家沿最短路径通行。
该名称在德语中意为“面包屑”,这正是实际使用中引导路径可视化效果的大致模样。
功能介绍
Brotkrumen 为服务器管理员提供了一种构建可导航导航点图(waypoint graphs)的工具。图是由通过边(edges)连接的节点(nodes,即位置)组成的集合。边可以是普通的步行连接或传送链接,既可以在同一个图内,也可以在不同图之间。随后,你可以使用 /bk resolve 命令引导玩家沿两点间的最短路径行进,该命令会通过粒子或方块显示实体来可视化路线,并可选择自动处理传送过程。
这主要面向角色扮演或生存类服务器,需要一种结构化的方式来连接各个地点,例如城镇导航、任务路线规划或导览系统。
寻路算法
提供两种算法,并根据涉及的通行类型自动选择:
- A* —— 更快,基于启发式算法。仅用于不含任何传送的纯步行路线。
- Dijkstra —— 支持所有通行类型,包括本地传送、跨图传送和传送点(warps)。始终找到成本最低的路径。
边的权重是可配置的。传送点在图中被视为虚拟边,因此会正常参与寻路计算。
可视化
引导路径通过粒子或方块显示实体在游戏世界中渲染,具体取决于配置的选择方案(preset)。可见窗口会跟随玩家移动,随时显示前方(以及可选的后方)指定数量的节点。目的地会出现目标标记。当玩家完成某段路径或到达目标时,会播放可配置的通知(标题、消息、音效)。
如果玩家偏离路径过远,将收到警告。经过一段宽限期后,引导将会取消。
视觉预设定义在 presets.yml 中,可以通过 /bkeditor preset <name> 命令为每个图单独更改。
跨图旅行
图之间可以通过跨图边进行链接,使寻路能够透明地跨越图的边界。这些链接在编辑器中管理,可以独立启用或禁用。多个互联的图构成一个网络,解析器在计算路线时将整个网络视为一个统一的图。
语言支持
插件内置多种消息翻译。请参阅
此处
获取可用语言列表。默认区域设置可在 config.yml 中设定。
Brotkrumen
A waypoint and pathfinding plugin for Paper servers, built on mathematical graph theory.
It lets you define networks of interconnected nodes across your world, then guide players through them on the
shortest path.
The name is German for "breadcrumb", which is roughly what the guided path visualization looks like in practice.
What it does
Brotkrumen gives server administrators a tool to build navigable waypoint graphs. A graph is a collection of nodes
(locations) connected by edges. Edges can be plain walking connections or teleport links, either within a graph or
between different graphs. Players can then be guided along the shortest path between two points using the /bk resolve
command, which visualizes the route with particles or block displays and optionally handles teleports automatically.
This is mostly aimed at roleplay or survival servers that need a structured way to connect locations,
for example, town navigation, quest routing, or a guided tour system.
Pathfinding
Two algorithms are available and are selected automatically based on the traversal types involved:
- A* — faster, heuristic-based. Only used for pure walking routes without any teleports.
- Dijkstra — handles all traversal types including local teleports, inter-graph teleports, and warps. Always finds
the lowest-cost path.
Edge costs are configurable. Warps count as virtual edges in the graph, so they participate in pathfinding normally.
Visualization
The guided path is rendered in-world using either particles or block display entities, depending on the configured
preset. The visible window moves with the player, a configurable number of nodes ahead and optionally behind are shown
at any time. A goal marker appears at the destination. When a player completes a segment or reaches the goal, a
configurable notification plays (title, message, sound).
If a player strays too far from the path, they receive a warning. After a grace period the guidance cancels.
Visual presets are defined in presets.yml and can be changed per graph with /bkeditor preset <name>.
Inter-graph travel
Graphs can be linked with inter-graph edges, allowing pathfinding to cross graph boundaries transparently. These links
are managed in the editor and can be enabled or disabled independently. Multiple linked graphs form a network, and the
resolver treats the whole network as one unified graph when calculating routes.
Language support
The plugin ships with multiple message translations. See
here
for a list of available languages. The default locale is set in config.yml.
评论 0
登录后参与评分
还没有评论,来抢沙发吧