zoukankan      html  css  js  c++  java
  • 图的深度

    https://www.tutorialspoint.com/degree-of-vertex-of-a-graph

    It is the number of vertices adjacent to a vertex V.

    Notation − deg(V).

    In a simple graph with n number of vertices, the degree of any vertices is −

    deg(v) = n – 1 ∀ v ∈ G

    A vertex can form an edge with all other vertices except by itself. So the degree of a vertex will be up to the number of vertices in the graph minus 1. This 1 is for the self-vertex as it cannot form a loop by itself. If there is a loop at any of the vertices, then it is not a Simple Graph.

    Degree of vertex can be considered under two cases of graphs −

    • Undirected Graph
    • Directed Graph

    Degree of Vertex in an Undirected Graph

    An undirected graph has no directed edges. Consider the following examples.

    Example 1

    Take a look at the following graph −

    Undirected Graph

    In the above Undirected Graph,

    • deg(a) = 2, as there are 2 edges meeting at vertex 'a'.

    • deg(b) = 3, as there are 3 edges meeting at vertex 'b'.

    • deg(c) = 1, as there is 1 edge formed at vertex 'c'

      So 'c' is a pendent vertex.

    • deg(d) = 2, as there are 2 edges meeting at vertex 'd'.

    • deg(e) = 0, as there are 0 edges formed at vertex 'e'.

      So 'e' is an isolated vertex.

    Example 2

    Take a look at the following graph −

    Undirected Graph 1

    In the above graph,

    deg(a) = 2, deg(b) = 2, deg(c) = 2, deg(d) = 2, and deg(e) = 0.

    The vertex 'e' is an isolated vertex. The graph does not have any pendent vertex.

    Degree of Vertex in a Directed Graph

    In a directed graph, each vertex has an indegree and an outdegree.

    Indegree of a Graph

    • Indegree of vertex V is the number of edges which are coming into the vertex V.

    • Notation − deg−(V).

    Outdegree of a Graph

    • Outdegree of vertex V is the number of edges which are going out from the vertex V.

    • Notation − deg+(V).

    Consider the following examples.

    Example 1

    Take a look at the following directed graph. Vertex 'a' has two edges, 'ad' and 'ab', which are going outwards. Hence its outdegree is 2. Similarly, there is an edge 'ga', coming towards vertex 'a'. Hence the indegree of 'a' is 1.

    Directed Graph

    The indegree and outdegree of other vertices are shown in the following table −

    VertexIndegreeOutdegree
    a 1 2
    b 2 0
    c 2 1
    d 1 1
    e 1 1
    f 1 1
    g 0 2

    Example 2

    Take a look at the following directed graph. Vertex 'a' has an edge 'ae' going outwards from vertex 'a'. Hence its outdegree is 1. Similarly, the graph has an edge 'ba' coming towards vertex 'a'. Hence the indegree of 'a' is 1.

    Directed Graph 1

    The indegree and outdegree of other vertices are shown in the following table −

    VertexIndegreeOutdegree
    a 1 1
    b 0 2
    c 2 0
    d 1 1
    e 1 1
  • 相关阅读:
    json编解码
    Grok 正则捕获
    logstash date插件介绍
    logstash 字段类型转换后 需要刷新
    logstash 防止实际处理时间跟事件产生时间略有偏差
    导入旧数据需要 使用date插件
    nginx和tomcat的响应时间
    解决kibana 4 关于响应时间的问题
    go 可以开发桌面应用
    windows下go语言环境
  • 原文地址:https://www.cnblogs.com/kungfupanda/p/13253282.html
Copyright © 2011-2022 走看看