申请试用
HOT
登录
注册
 
Graphs

Graphs

深度递归
/
发布于
/
1873
人观看
Set V of vertices/nodes v1,… , set E of edges (u,v),…. Edges might be directed and/or weighted and/or labeled Degree of v is #edges touching v Indegree and Outdegree for directed graphs Path is sequence of edges (v0,v1),(v1,v2),…. Geodesic path between u and v is shortest path connecting them Diameter is max u,v in V {length of geodesic between u,v} Effective diameter is 90th percentile Mean diameter is over connected pairs (Connected) component is subset of nodes that are all pairwise connected via paths Clique is subset of nodes that are all pairwise connected via edges Triangle is a clique of size three
12 点赞
6 收藏
0下载
相关文档
确认
3秒后跳转登录页面
去登陆