liveBook · Manning

Sink node

As explained in Advanced Algorithms and Data Structures

A sink is the distinguished network vertex into which flow is delivered and which has no outbound flow.

In a flow network, the sink is the destination vertex: flow arrives there through incoming edges, and it has no outgoing edges. The maximum-flow problem aims to maximize the total flow delivered to the sink. section 18.4.1

Figure 18.22 An example of a network, whose maximum flow is 6.

The network diagram illustrates a sink as the endpoint of flow. section 18.4.1

How Advanced Algorithms and Data Structures covers it

How deep it goes
Defines the sink by its incoming-only edges and role in maximum flow, without detailing implementation.
Examples
Illustrates the sink as the destination in a network diagram and uses water flowing through pipes as an analogy.
What you can do after
Understand the sink’s role as the destination vertex in a maximum-flow network.
How it connects
Connects the sink to flow networks, directed graphs, edge capacities, and the source.

Also explained in

Compare how 3 books explain sink node →

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Advanced Algorithms and Data Structures. The section links point to the parts of the book it draws on.