`EdgeValuedGraph<N,V>`

An `EdgeValuedGraph`

is an undirected `ValuedGraph`

where the edges have values. This structure is useful for situations in which elements of the same type can have relations to each other, and those relations have some associated value. The relations are bidirectional, so `A -> B`

also implies that `B -> A`

.

##### info

Like all `Graph`

implementations, these graphs can contain cycles and isolated nodes are allowed.

The `@rimbu/core`

package exports the following immutable EdgeValuedGraph TypeScript types:

Name | Description |
---|---|

`EdgeValuedGraph<N, V>` | a generic undirected valued graph with nodes of type N, and edge values of type V |

`EdgeValuedGraphHashed<N, V>` | a valued undirected graph with hashed nodes of type N, and edge values of type V |

`EdgevaluedGraphSorted<N, V>` | a valued undirected graph with sorted nodes of type N, and edge values of type V |