Disentangle-Graph/net.walend.disentangle.graph/AdjacencyUndigraph

AdjacencyUndigraph

net.walend.disentangle.graph.AdjacencyUndigraph

See theAdjacencyUndigraph companion object

case class AdjacencyUndigraph[Node](outNodes: IndexedSet[Node], adjacencyMatrix: Vector[IndexedSet[NodePair[Node]]]) extends IndexedUndigraph[Node]

Provides constant-time access for edges of a node.

The constructor is O(n + a ln(n))

Attributes

Since:: v0.2.1
Companion:: object
Graph
Supertypes: trait Serializable
trait Product
trait Equals
trait IndexedUndigraph[Node]
trait Undigraph[Node]
trait Graph[Node]
class Object
trait Matchable
class Any

Members list

Concise view

Type members

Classlikes

Attributes

Graph
Supertypes: trait Serializable
trait Product
trait Equals
trait InnerIndexedNodeTrait
trait UndigraphInnerNodeTrait
trait InnerNodeTrait
class Object
trait Matchable
class Any

Attributes

Companion:: object
Graph
Supertypes: trait Serializable
trait Product
trait Equals
trait UndigraphInnerEdgeTrait
trait InnerEdgeTrait
class Object
trait Matchable
class Any

Attributes

Companion:: class
Graph
Supertypes: trait Product
trait Mirror
class Object
trait Matchable
class Any
Self type: InnerEdge.type

Inherited classlikes

An internal representation of edges within the graph

Attributes

Inherited from:: Graph
Graph
Supertypes: class Object
trait Matchable
class Any
Known subtypes: trait DigraphInnerEdgeTrait
class InnerEdge
trait LabelDigraphEdgeTrait
class InnerEdge
class InnerEdge
trait UndigraphInnerEdgeTrait
class InnerEdge
class InnerEdge

An internal representation of nodes within the graph

Attributes

Inherited from:: IndexedUndigraph
Graph
Supertypes: trait UndigraphInnerNodeTrait
trait InnerNodeTrait
class Object
trait Matchable
class Any
Known subtypes: class InNode

An internal representation of nodes within the graph

Attributes

Inherited from:: Graph
Graph
Supertypes: class Object
trait Matchable
class Any
Known subtypes: trait DigraphInnerNodeTrait
class InNode
class InnerNode
class InnerNode
trait InnerIndexedNodeTrait
class InNode
trait UndigraphInnerNodeTrait
trait InnerIndexedNodeTrait
class InNode

Attributes

Inherited from:: Undigraph
Graph
Supertypes: trait InnerEdgeTrait
class Object
trait Matchable
class Any
Known subtypes: class InnerEdge
class InnerEdge

Attributes

Inherited from:: Undigraph
Graph
Supertypes: trait InnerNodeTrait
class Object
trait Matchable
class Any
Known subtypes: class InNode
trait InnerIndexedNodeTrait
class InNode

Types

The edge type returned by this graph representation

Attributes

The type of InnerNodeTrait for this digraph representation

Attributes

Inherited types

The edge type used to build this graph representation

Attributes

Inherited from:: IndexedUndigraph

Value members

Concrete methods

Compares the receiver object (this) with the argument object (that) for equivalence.

Any implementation of this method should be an equivalence relation:

It is reflexive: for any instance x of type Any, x.equals(x) should return true.
It is symmetric: for any instances x and y of type Any, x.equals(y) should return true if and only if y.equals(x) returns true.
It is transitive: for any instances x, y, and z of type Any if x.equals(y) returns true and y.equals(z) returns true, then x.equals(z) should return true.

If you override this method, you should verify that your implementation remains an equivalence relation. Additionally, when overriding this method it is usually necessary to override hashCode to ensure that objects which are "equal" (o1.equals(o2) returns true) hash to the same scala.Int. (o1.hashCode.equals(o2.hashCode)).

Attributes

that: the object to compare against this object for equality.
Returns:: true if the receiver object is equivalent to the argument; false otherwise.
Definition Classes: Equals -> Any

O(ln(n))

Attributes

Returns:: Some inner node if it exists in the digraph or None
Definition Classes: Graph

O(1)

Attributes

Definition Classes: IndexedUndigraph

O(1)

Attributes

Returns:: InnerNode representation of all of the nodes in the graph.
Definition Classes: IndexedUndigraph -> Graph

O(1)

Attributes

Definition Classes: IndexedUndigraph

Attributes

Returns:: number of nodes in the graph
Definition Classes: Graph

All the nodes in the graph, in an indexed set

Attributes

Returns a string representation of the object.

The default representation is platform dependent.

Attributes

Returns:: a string representation of the object.
Definition Classes: Any

Inherited methods

Attributes

Inherited from:: Product

Attributes

Inherited from:: Product

Concrete fields

O(n^2)

Attributes

Returns:: All of the edges in the graph

Calculate a hash code value for the object.

The default hashing algorithm is platform dependent.

Note that it is allowed for two objects to have identical hash codes (o1.hashCode.equals(o2.hashCode)) yet not be equal (o1.equals(o2) returns false). A degenerate implementation could always return 0. However, it is required that if two objects are equal (o1.equals(o2) returns true) that they have identical hash codes (o1.hashCode.equals(o2.hashCode)). Therefore, when overriding this method, be sure to verify that the behavior is consistent with the equals method.

Attributes

Returns:: the hash code value for this object.

Attributes

Returns:: A Traversable of the edges as represented in the graph

Generated with