router

package

v0.1.0 Latest Latest Go to latest Published: Apr 20, 2026 License: MIT Imports: 3 Imported by: 0

Details

This section is empty.

This section is empty.

This section is empty.

type Graph struct {
	// contains filtered or unexported fields
}

Graph holds the adjacency list for BFS/Dijkstra.

func Build() *Graph

Build constructs the format graph from all registered backends.

func (g *Graph) Find(src, dst string) (*Route, error)

Find returns the lowest-cost route from src to dst, or ErrNoRoute.

func (g *Graph) Nodes() []string

Nodes returns all format IDs that appear in the graph.

type Route struct {
	Steps []Step
}

Route is an ordered sequence of steps from source to target format.

func (r *Route) TotalCost() int

TotalCost returns the sum of edge costs across all steps.

type Step struct {
	From    string
	To      string
	Backend backend.Backend
}

Step is a single conversion hop in a route.