Scholarlink

Let us view a graph G = (V,E) as a network: its edges carry some kind of flow – of water, electricity, data or similar. How could we model this precisely? For a start, we ought to know how much flow passes through each edge e = xy, and in which direction.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Flows

  • 章节

  • 发表日期：

    2025年

查看全文
  • Reinhard Diestel

摘要

Let us view a graph G = (V,E) as a network: its edges carry some kind of flow – of water, electricity, data or similar. How could we model this precisely? For a start, we ought to know how much flow passes through each edge e = xy, and in which direction.