Partitioning a graph with non-equal number of edges per node.
Type | Attributes | Name | Initial | |||
---|---|---|---|---|---|---|
integer(kind=idx_t) | :: | n | ||||
integer(kind=idx_t) | :: | m | ||||
integer(kind=idx_t), | allocatable | :: | xadj(:) | |||
integer(kind=idx_t), | allocatable | :: | adjncy(:) | |||
integer(kind=idx_t), | allocatable | :: | part(:) | |||
integer(kind=idx_t) | :: | options(0:METIS_NOPTIONS-1) | ||||
integer(kind=idx_t) | :: | ios | ||||
integer(kind=idx_t) | :: | ncon | ||||
integer(kind=idx_t) | :: | objval |