离散数学(英文版)Graph.pptVIP

  • 9
  • 0
  • 约8.89千字
  • 约 31页
  • 2017-11-20 发布于江苏
  • 举报
离散数学(英文版)Graph

Graphs Lecture 9 Discrete Mathematical Structures Problem of “Crossing River” Problem: A person(P), a wolf(W), a lamb(L) and a cabbage(C) will cross a river by a boat which can carry any two of them once. Wolf and lamb, or, lamb and cabbage, cannot stay together without the person present. Remember that only the person can run the boat. Seven Bridges at K?nigsberg Abstraction Vertices representing objects - areas Edges representing the relationship between objects – connected by a bridge Graph and Diagram Graph G is a triple: G =〈VG, EG, ?〉 VG and EG are sets,satisgying VG?EG=?, ?:EG?{{vi, v

文档评论(0)

1亿VIP精品文档

相关文档