Walk - Any journey through a network starting and ending at any vertex, Path - A journey through a network with no repeated vertices, Cycle - A journey through a network with same start and end and doesn't visit a vertex more than once, Transversable - A network graph that can be traced without lifting pen off the paper., Eulerian Trail - A connected network that uses every edge exactly once and with exactly 2 vertices with odd degree, Eulerian Circuit - A network trail with every vertex of even degree, Hamiltonian Path - A network that travels through every vertex once only, Hamiltonian Cycle - A Hamiltonian Path that starts and finishes at the same vertex,
0%
Network Concepts Level 2
共享
共享
共享
由
Epratt1
Y11
Maths
Networks
编辑内容
打印
嵌入
更多
作业
排行榜
显示更多
显示更少
此排行榜当前是私人享有。单击
,共享
使其公开。
资源所有者已禁用此排行榜。
此排行榜被禁用,因为您的选择与资源所有者不同。
还原选项
匹配游戏
是一个开放式模板。它不会为排行榜生成分数。
需要登录
视觉风格
字体
需要订阅
选项
切换模板
显示所有
播放活动时将显示更多格式。
打开成绩
复制链接
QR 代码
删除
恢复自动保存:
?