Packages

class GraphMetrics extends AnyRef

The GraphMetrics class provides methods for determining graph metrics that can be efficiently computed using Breadth-First Search (BFS). This works for undirected graphs. If a directed graph is passed in, it will be converted to a corresponding undirected graph.

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. GraphMetrics
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new GraphMetrics(g: Graph, isUndirected: Boolean = true)

    g

    the graph whose metrics are sought

    isUndirected

    indicates whether the graph is undirected

Value Members

  1. def central: Array[Int]

    Return the central vertices, those with eccentricities equal to the radius.

  2. def diam: Int

    Compute the diameter of graph 'g' (i.e., maximum eccentricity).

    Compute the diameter of graph 'g' (i.e., maximum eccentricity). This also equals the "longest shortest path" between any pair of vertices in graph 'g'.

  3. def ecc(i: Int): Int

    Compute the eccentricity of vertex 'i' (the length of the longest path from vertex 'i' to any other vertex).

    Compute the eccentricity of vertex 'i' (the length of the longest path from vertex 'i' to any other vertex).

    i

    the vertex whose eccentricity is sought

  4. val g: Graph
  5. def rad: Int

    Compute the radius of graph 'g' (i.e., minimum eccentricity).