Options
All
  • Public
  • Public/Protected
  • All
Menu

Class Graph

Hierarchy

  • Graph

Index

Constructors

Properties

Methods

Constructors

constructor

  • Returns Graph

Properties

adjacency_matrix

adjacency_matrix: (0 | 1)[][]

front

front: number[]

indexes

indexes: number[]

node_ids

node_ids: NodeID[]

nodes

nodes: Node[]

visited

visited: number[]

Static MAX_PRIORITY

MAX_PRIORITY: number = 0

Methods

_areAllSuccessorsVisited

  • _areAllSuccessorsVisited(i: number): boolean

  • Parameters

    • i: number

    Returns boolean

_getIndexesOfNodePair

  • _getIndexesOfNodePair(id_i: NodeID, id_j: NodeID): number[]

  • Parameters

    Returns number[]

_getNextNode

  • _getNextNode(): { front_node: number | null; next_node: number | null }

  • Returns { front_node: number | null; next_node: number | null }

    • front_node: number | null
    • next_node: number | null

_isNodeWithoutPredecessors

  • _isNodeWithoutPredecessors(i: number): boolean

  • Parameters

    • i: number

    Returns boolean

_isVisited

  • _isVisited(i: number): boolean

  • Parameters

    • i: number

    Returns boolean

_lookForNextNodeInCandidates

  • Parameters

    • candidates: Iterable<number>

    Returns NextNodeCandidate

_meanPriorityOfSuccessors

  • _meanPriorityOfSuccessors(i: number): number

  • Parameters

    • i: number

    Returns number

_pathExists

  • _pathExists(i: number, j: number): boolean

  • Parameters

    • i: number
    • j: number

    Returns boolean

addEdge

  • Parameters

    Returns void

addNode

  • addNode(id: NodeID, priority: number): void

  • Parameters

    Returns void

bestFirstSearch

  • bestFirstSearch(): (string | number)[]

  • Returns (string | number)[]

getNoOfNodes

  • getNoOfNodes(): number

  • Returns number

pathExists

  • Parameters

    Returns boolean

Generated using TypeDoc