Key |
Value |
as::build::date |
2015-05-25 |
as::origin |
http://sourceforge.net/projects/tcllib
|
category |
Tcl Data Structures |
description |
Operation for (un)directed graph objects |
entity |
package |
license |
BSD |
platform |
tcl |
require |
Tcl -require 8.4
struct::disjointset
struct::graph
struct::prioqueue
struct::queue
struct::stack
struct::tree
|
subject |
strongly connected component blocking flow loop diameter travelling salesman edge minimal spanning tree minimum degree spanning tree node vertex bfs residual graph bridge adjacency list radius augmenting network independent set matching minimum cost flow arc heuristic degree degree constrained spanning tree shortest path max cut distance subgraph connected component local searching articulation point cut edge adjacent cut vertex level graph complete graph neighbour augmenting path isthmus adjacency matrix squared graph approximation algorithm graph bipartite dijkstra vertex cover maximum flow flow network minimum diameter spanning tree eccentricity |
summary |
struct::graph::op |