class Graphunk::WeightedUndirectedGraph(T)

Included Modules

Defined in:

graphunk/classes/graphs/weighted_undirected_graph.cr

Constructors

Instance Method Summary

Instance methods inherited from module Graphunk::UndirectedGraphMethods(T)

bipartite? bipartite?, chordal? chordal?, clique?(vertex_list) clique?, comparability? comparability?, complete? complete?, edge_exists?(v, u) edge_exists?, lexicographic_bfs lexicographic_bfs, transitive_orientation transitive_orientation

Instance methods inherited from module Graphunk::Graph(T)

add_vertex(vertex) add_vertex, add_vertices(names : Array(T))
add_vertices(*names) add_vertices, clone clone, degree(vertex) degree, edge_exists?(edge) edge_exists?, edges edges, edges_on_vertex(vertex) edges_on_vertex, neighbors(vertex) neighbors, remove_vertex(vertex) remove_vertex, vertex_exists?(vertex) vertex_exists?, vertices vertices

Constructor methods inherited from module Graphunk::Graph(T)

new(vertices = [] of T, edges = [] of Tuple(T, T)) new

Instance methods inherited from module Graphunk::WeightedGraph(T)

weights weights

Instance methods inherited from module Graphunk::Graph(T)

add_vertex(vertex) add_vertex, add_vertices(names : Array(T))
add_vertices(*names) add_vertices, clone clone, degree(vertex) degree, edge_exists?(edge) edge_exists?, edges edges, edges_on_vertex(vertex) edges_on_vertex, neighbors(vertex) neighbors, remove_vertex(vertex) remove_vertex, vertex_exists?(vertex) vertex_exists?, vertices vertices

Constructor methods inherited from module Graphunk::Graph(T)

new(vertices = [] of T, edges = [] of Tuple(T, T)) new

Constructor Detail

def self.new(vertices : Array(T) = [] of T, weights : Hash(Tuple(T, T), Int32) = {} of Tuple(T, T) => Int32) #

[View source]

Instance Method Detail

def add_edge(v, u, w) #

[View source]
def add_edge(edge : Tuple(T, T), weight) #

[View source]
def adjust_weight(v, u, w) #

[View source]
def edge_weight(v, u) #

[View source]
def edge_weight(edge) #

[View source]
def minimum_spanning_tree(algorithm = Algorithms::Prim) #

[View source]
def remove_edge(v, u) #

[View source]
def remove_edge(edge) #

[View source]