Files

76 lines
2.1 KiB
Plaintext
Raw Permalink Normal View History

2025-12-17 11:00:57 +08:00
.. _create_graph :
CREATE_GRAPH
> Create a node or dual (element) adjacency graph. If node option is selected,
the graph of node adjacency is created, if dual option is selected, the graph
of element adjacency (dual graph) is created.
For details of METIS algorithms and descriptions of the third command line
argument see:
[http://glaros.dtc.umn.edu/gkhome/views/metis](http://glaros.dtc.umn.edu/gkhom
e/views/metis)
See [METIS ](metis.html)documentation for description of graph format.
The default name of the attributes that are created are different depending on
which option (metis or lagrit) is used.
>
> `create_graph / metis / [node | dual] / [nxadj] / [nadjncy]
create_graph/ lagrit / dual / jtetoff / jtet
`
>
> See the [dump](DUMP2.html) command for options to output the adjacency graph
to a file.`
`
LIMITATIONS
> The metis option will not work on a hybrid mesh. Supported element types are
tri, tet, quad, hex.
>
> The /lagrit/ option will only produce the dual adjacency graph. The only
option for the name of the graph arrays are jtetoff and jtet. The present
implementation is just a wrapper on the [geniee](GENIEE.html) command.
>
> See instructions in documentation of the [metis](metis.html) command.
METIS Interface to LaGriT
> METIS can be freely distributed provided that:
* A reference to the following paper is included: _ "A Fast and Highly Quality Multilevel Scheme for Partitioning Irregular Graphs". George Karypis and Vipin Kumar. SIAM Journal on Scientific Computing, Vol. 20, No. 1, pp. 359--392, 1999._
* The original documentation ([PDF file of the manual](http://glaros.dtc.umn.edu/gkhome/fetch/sw/metis/manual.pdf)) and copyright notice is include
* METIS 4.0 Copyright 2001-06, Regents of the University of Minnesota
FORMAT:
> `create_graph / metis / [node | dual] / [nxadj] / [nadjncy]`
EXAMPLES:
> `create_graph / metis / dual / -def- / -def-
create_graph / metis / node / -def- / -def-
create_graph / metis / dual / ie1 / ieadj1
create_graph / metis / node / in1 / inadj1
create_graph / lagrit / dual / jtetoff / jtet`