Combine constructs paths between src and dst using the supplied segments.

FilterLongPaths returns a new slice containing only those paths that do not go more than twice through interfaces belonging to the same AS (thus filtering paths containing useless loops).

NewDMG creates a new graph from sets of path segments.

DMG is a Directed Multigraph.

Edge represents an edge for the DMG.

InputSegment is a local representation of a path segment that includes the segment's type.

Vertex is a union-like type for the AS vertices and Peering link vertices in a DMG that can be used as key in maps.

EdgeMap is used to keep the set of edges going from one vertex to another.

PathSolutionList is a sort.Interface implementation for a slice of solutions.

VertexInfo maps destination vertices to the list of edges that point towards them.