Source point

As explained in Advanced Algorithms and Data Structures

A source is the distinguished network vertex through which flow originates and which has no inbound flow.

A source point, or source vertex, is the distinguished vertex where flow begins. In a directed network, it has outgoing edges but no inbound flow; the corresponding destination is the sink. section 18.4.1

Use the source point to interpret direction and flow:

• Read each directed edge from its source vertex, the first vertex in the ordered pair, toward its destination vertex. section 14.1
• In a flow network, begin routing at the source and finish at the sink; edge weights represent capacities, while assigned values represent actual flow. section 18.4.1
• Do not confuse a network source with the source of an individual edge: a general directed graph may use source to mean that edge's first endpoint. section 14.1 section 18.4.1

A network with a source

In a network written as N=(V,E), designate s as the source and t as the sink. Flow leaves s through outgoing edges, passes through intermediate vertices, and ultimately reaches t. Figure 18.22 depicts such a network and labels a maximum flow of 6. section 18.4.1

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

Use the network diagram to locate the source, sink, directed edges, capacities, and possible flow routes. section 18.4.1

How Advanced Algorithms and Data Structures covers it

How deep it goes

Defines the source as an endpoint with only outgoing edges and contrasts it with ordinary edge-source terminology.

Examples

Uses a network diagram with vertices s and t and a stated maximum flow of 6.

What it assumes

Assumes familiarity with vertices and edges while defining source and destination terminology for directed graphs.

What you can do after

Evaluate a directed network by identifying its flow origin and distinguishing it from an edge's source endpoint.

How it connects

Connects source points to directed graphs, networks, sinks, capacities, flows, and maximum flow.

liveBookmanning.com

Read Advanced Algorithms and Data Structures on liveBook Get the book at manning.com

Also explained in

• 

  liveBookmanning.com
  Kafka Streams in Action, Second EditionA source node is the root node of a Kafka Streams topology that consumes records and forwards them into the application.
• 

  liveBookmanning.com
  Graph Algorithms for Data ScienceA source node is the starting node of a directed relationship in Neo4j Graph Data Science terminology.

Compare how 3 books explain source point →

Related concepts

• Consumedconfigured by · Consumed is a Kafka Streams configuration object that specifies input serializers and deserializers and other settings for a source node.
• Kafka brokeruses · A Kafka broker is a server process in an Apache Kafka cluster that stores records and handles producer, consumer, and other client requests.
• processor topologypart of · A processor topology is a directed graph of source, processor, and sink nodes that defines how records flow through a stream-processing application.

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.