Unified facade for multigraph operations.
Multigraphs allow multiple (parallel) edges between the same pair of nodes. This module provides creation, modification, traversal, and algorithmic analysis for multigraphs by delegating to specialized submodules.
Summary
Functions
Adds an edge to the multigraph, returning {updated_graph, edge_id}.
Adds a node to the multigraph.
Returns all edge IDs in the graph.
Returns all node IDs in the multigraph.
Performs a Breadth-First Search from source.
Returns the total degree of a node (in-degree + out-degree for directed, out-degree for undirected).
Performs a Depth-First Search from source.
Creates a new empty directed multigraph.
Returns the number of parallel edges between from and to.
Returns all parallel edges between from and to as [{edge_id, data}].
Finds an Eulerian circuit using Hierholzer's algorithm.
Finds an Eulerian path using Hierholzer's algorithm.
Folds over nodes during multigraph traversal with metadata.
Checks if the multigraph contains at least one cycle.
Checks if a specific edge_id exists in the multigraph.
Checks if the multigraph has an Eulerian circuit.
Checks if the multigraph has an Eulerian path.
Returns the in-degree of a node.
Creates a new empty multigraph of the given type.
Returns the number of nodes.
Returns the out-degree of a node.
Returns all incoming edges to id as [{from_node, edge_id, data}].
Removes a single edge by its EdgeId.
Removes a node and all edges connected to it.
Returns the total number of edges.
Returns all outgoing edges from id as [{to_node, edge_id, data}].
Collapses the multigraph into a simple graph, keeping only the first edge between each pair.
Collapses the multigraph into a simple graph using a combining function.
Collapses parallel edges, keeping the minimum weight.
Collapses parallel edges, summing weights with the provided function.
Returns a topological ordering of nodes (directed multigraphs only).
Creates a new empty undirected multigraph.
Functions
Adds an edge to the multigraph, returning {updated_graph, edge_id}.
Adds a node to the multigraph.
Returns all edge IDs in the graph.
Returns all node IDs in the multigraph.
Performs a Breadth-First Search from source.
Returns the total degree of a node (in-degree + out-degree for directed, out-degree for undirected).
Performs a Depth-First Search from source.
Creates a new empty directed multigraph.
Returns the number of parallel edges between from and to.
Returns all parallel edges between from and to as [{edge_id, data}].
Finds an Eulerian circuit using Hierholzer's algorithm.
Finds an Eulerian path using Hierholzer's algorithm.
Folds over nodes during multigraph traversal with metadata.
@spec has_cycle?(Yog.Multi.Model.t()) :: boolean()
Checks if the multigraph contains at least one cycle.
Collapses parallel edges internally before checking.
Checks if a specific edge_id exists in the multigraph.
Checks if the multigraph has an Eulerian circuit.
Checks if the multigraph has an Eulerian path.
Returns the in-degree of a node.
Creates a new empty multigraph of the given type.
Returns the number of nodes.
Returns the out-degree of a node.
Returns all incoming edges to id as [{from_node, edge_id, data}].
Removes a single edge by its EdgeId.
Removes a node and all edges connected to it.
Returns the total number of edges.
Returns all outgoing edges from id as [{to_node, edge_id, data}].
Collapses the multigraph into a simple graph, keeping only the first edge between each pair.
Collapses the multigraph into a simple graph using a combining function.
Collapses parallel edges, keeping the minimum weight.
Collapses parallel edges, summing weights with the provided function.
@spec topological_sort(Yog.Multi.Model.t()) :: {:ok, [Yog.node_id()]} | {:error, :contains_cycle}
Returns a topological ordering of nodes (directed multigraphs only).
Collapses parallel edges internally, then applies Kahn's algorithm.
Returns {:ok, [node_id]} or {:error, :contains_cycle}.
Creates a new empty undirected multigraph.