Home
last modified time | relevance | path

Searched defs:graph_t (Results 1 – 25 of 480) sorted by relevance

12345678910>>...20

/dports/math/parmetis/parmetis-4.0.3/libparmetis/
H A Dstruct.h75 typedef struct graph_t { struct
76 idx_t gnvtxs, nvtxs, nedges, ncon, nobj;
87 idx_t free_vwgt;
88 idx_t free_adjwgt;
89 idx_t free_vsize;
92 idx_t *match;
93 idx_t *cmap;
96 idx_t *label;
113 idx_t *pexadj, *peadjncy,
146 struct graph_t *coarser, *finer; argument
[all …]
/dports/math/libmesh/libmesh-1.6.2/contrib/parmetis/libparmetis/
H A Dstruct.h75 typedef struct graph_t { struct
76 idx_t gnvtxs, nvtxs, nedges, ncon, nobj;
87 idx_t free_vwgt;
88 idx_t free_adjwgt;
89 idx_t free_vsize;
92 idx_t *match;
93 idx_t *cmap;
96 idx_t *label;
113 idx_t *pexadj, *peadjncy,
146 struct graph_t *coarser, *finer; argument
[all …]
/dports/www/firefox-esr/firefox-91.8.0/gfx/harfbuzz/src/
H A Dhb-repacker.hh37 struct graph_t struct
39 struct vertex_t
91 struct overflow_record_t
97 struct clone_buffer_t
131 graph_t (const hb_vector_t<hb_serialize_context_t::object_t *>& objects) in graph_t() argument
160 ~graph_t () in ~graph_t() argument
166 bool in_error () const in in_error()
218 void sort_kahn () in sort_kahn()
473 void update_positions () in update_positions()
493 void update_distances () in update_distances()
[all …]
/dports/www/lagrange/lagrange-1.7.3/lib/harfbuzz/src/
H A Dhb-repacker.hh37 struct graph_t struct
39 struct vertex_t
91 struct overflow_record_t
97 struct clone_buffer_t
131 graph_t (const hb_vector_t<hb_serialize_context_t::object_t *>& objects) in graph_t() argument
160 ~graph_t () in ~graph_t() argument
166 bool in_error () const in in_error()
218 void sort_kahn () in sort_kahn()
473 void update_positions () in update_positions()
493 void update_distances () in update_distances()
[all …]
/dports/mail/thunderbird/thunderbird-91.8.0/gfx/harfbuzz/src/
H A Dhb-repacker.hh37 struct graph_t struct
39 struct vertex_t
91 struct overflow_record_t
97 struct clone_buffer_t
131 graph_t (const hb_vector_t<hb_serialize_context_t::object_t *>& objects) in graph_t() function
160 ~graph_t () in ~graph_t() argument
166 bool in_error () const in in_error()
218 void sort_kahn () in sort_kahn()
473 void update_positions () in update_positions()
493 void update_distances () in update_distances()
[all …]
/dports/www/firefox/firefox-99.0/gfx/harfbuzz/src/
H A Dhb-repacker.hh41 struct graph_t struct
43 struct vertex_t
143 graph_t (const hb_vector_t<hb_serialize_context_t::object_t *>& objects) in graph_t() argument
174 ~graph_t () in ~graph_t() argument
179 bool in_error () const in in_error()
191 unsigned root_idx () const in root_idx()
253 void sort_kahn () in sort_kahn()
807 void update_parents () in update_parents()
828 void update_positions () in update_positions()
848 void update_distances () in update_distances()
[all …]
/dports/print/harfbuzz/harfbuzz-3.4.0/src/
H A Dhb-repacker.hh41 struct graph_t struct
43 struct vertex_t
143 graph_t (const hb_vector_t<hb_serialize_context_t::object_t *>& objects) in graph_t() argument
174 ~graph_t () in ~graph_t() argument
179 bool in_error () const in in_error()
191 unsigned root_idx () const in root_idx()
253 void sort_kahn () in sort_kahn()
807 void update_parents () in update_parents()
828 void update_positions () in update_positions()
848 void update_distances () in update_distances()
[all …]
/dports/print/harfbuzz-icu/harfbuzz-3.4.0/src/
H A Dhb-repacker.hh41 struct graph_t struct
43 struct vertex_t
143 graph_t (const hb_vector_t<hb_serialize_context_t::object_t *>& objects) in graph_t() function
174 ~graph_t () in ~graph_t() argument
179 bool in_error () const in in_error()
191 unsigned root_idx () const in root_idx()
253 void sort_kahn () in sort_kahn()
807 void update_parents () in update_parents()
828 void update_positions () in update_positions()
848 void update_distances () in update_distances()
[all …]
/dports/print/harfbuzz-hb-view/harfbuzz-3.4.0/src/
H A Dhb-repacker.hh41 struct graph_t struct
43 struct vertex_t
143 graph_t (const hb_vector_t<hb_serialize_context_t::object_t *>& objects) in graph_t() argument
174 ~graph_t () in ~graph_t() argument
179 bool in_error () const in in_error()
191 unsigned root_idx () const in root_idx()
253 void sort_kahn () in sort_kahn()
807 void update_parents () in update_parents()
828 void update_positions () in update_positions()
848 void update_distances () in update_distances()
[all …]
/dports/math/parmetis/parmetis-4.0.3/metis/libmetis/
H A Dstruct.h82 typedef struct graph_t { struct
83 idx_t nvtxs, nedges; /* The # of vertices and edges in the graph */
84 idx_t ncon; /* The # of constrains */
85 idx_t *xadj; /* Pointers to the locally stored vertices */
86 idx_t *vwgt; /* Vertex weights */
87 idx_t *vsize; /* Vertex sizes for min-volume formulation */
88 idx_t *adjncy; /* Array that stores the adjacency lists of nvtxs */
89 idx_t *adjwgt; /* Array that stores the weights of the adjacency lists */
91 idx_t *tvwgt; /* The sum of the vertex weights in the graph */
119 struct graph_t *coarser, *finer; argument
[all …]
/dports/math/py-PyMetis/PyMetis-2020.1/src/metis/libmetis/
H A Dstruct.h82 typedef struct graph_t { struct
83 idx_t nvtxs, nedges; /* The # of vertices and edges in the graph */
84 idx_t ncon; /* The # of constrains */
85 idx_t *xadj; /* Pointers to the locally stored vertices */
86 idx_t *vwgt; /* Vertex weights */
87 idx_t *vsize; /* Vertex sizes for min-volume formulation */
88 idx_t *adjncy; /* Array that stores the adjacency lists of nvtxs */
89 idx_t *adjwgt; /* Array that stores the weights of the adjacency lists */
91 idx_t *tvwgt; /* The sum of the vertex weights in the graph */
119 struct graph_t *coarser, *finer; argument
[all …]
/dports/cad/gmsh/gmsh-4.9.2-source/contrib/metis/libmetis/
H A Dstruct.h82 typedef struct graph_t { struct
83 idx_t nvtxs, nedges; /* The # of vertices and edges in the graph */
84 idx_t ncon; /* The # of constrains */
85 idx_t *xadj; /* Pointers to the locally stored vertices */
86 idx_t *vwgt; /* Vertex weights */
87 idx_t *vsize; /* Vertex sizes for min-volume formulation */
88 idx_t *adjncy; /* Array that stores the adjacency lists of nvtxs */
89 idx_t *adjwgt; /* Array that stores the weights of the adjacency lists */
91 idx_t *tvwgt; /* The sum of the vertex weights in the graph */
119 struct graph_t *coarser, *finer; argument
[all …]
/dports/math/libmesh/libmesh-1.6.2/contrib/metis/libmetis/
H A Dstruct.h82 typedef struct graph_t { struct
83 idx_t nvtxs, nedges; /* The # of vertices and edges in the graph */
84 idx_t ncon; /* The # of constrains */
85 idx_t *xadj; /* Pointers to the locally stored vertices */
86 idx_t *vwgt; /* Vertex weights */
87 idx_t *vsize; /* Vertex sizes for min-volume formulation */
88 idx_t *adjncy; /* Array that stores the adjacency lists of nvtxs */
89 idx_t *adjwgt; /* Array that stores the weights of the adjacency lists */
91 idx_t *tvwgt; /* The sum of the vertex weights in the graph */
119 struct graph_t *coarser, *finer; argument
[all …]
/dports/science/octopus/octopus-10.5/external_libs/metis-5.1/libmetis/
H A Dstruct.h81 typedef struct graph_t { struct
82 idx_t nvtxs, nedges; /* The # of vertices and edges in the graph */
83 idx_t ncon; /* The # of constrains */
84 idx_t *xadj; /* Pointers to the locally stored vertices */
85 idx_t *vwgt; /* Vertex weights */
86 idx_t *vsize; /* Vertex sizes for min-volume formulation */
87 idx_t *adjncy; /* Array that stores the adjacency lists of nvtxs */
88 idx_t *adjwgt; /* Array that stores the weights of the adjacency lists */
90 idx_t *tvwgt; /* The sum of the vertex weights in the graph */
118 struct graph_t *coarser, *finer; argument
[all …]
/dports/math/metis/metis-5.1.0/libmetis/
H A Dstruct.h82 typedef struct graph_t { struct
83 idx_t nvtxs, nedges; /* The # of vertices and edges in the graph */
84 idx_t ncon; /* The # of constrains */
85 idx_t *xadj; /* Pointers to the locally stored vertices */
86 idx_t *vwgt; /* Vertex weights */
87 idx_t *vsize; /* Vertex sizes for min-volume formulation */
88 idx_t *adjncy; /* Array that stores the adjacency lists of nvtxs */
89 idx_t *adjwgt; /* Array that stores the weights of the adjacency lists */
91 idx_t *tvwgt; /* The sum of the vertex weights in the graph */
119 struct graph_t *coarser, *finer; argument
[all …]
/dports/devel/boost-docs/boost_1_72_0/libs/graph/test/
H A Dgraphviz_test.cpp167 vertex_p, edge_p, graph_p > graph_t; typedef
176 vertex_p, edge_p, graph_p > graph_t; typedef
189 vertex_p, edge_p, graph_p > graph_t; typedef
199 vertex_p, edge_p, graph_p > graph_t; typedef
210 vertex_p, edge_p, graph_p > graph_t; typedef
221 vertex_p, edge_p, graph_p > graph_t; typedef
274 vertex_p, edge_p, graph_p > graph_t; typedef
285 vertex_p, edge_p, graph_p > graph_t; typedef
297 vertex_p, edge_p, graph_p > graph_t; typedef
309 vertex_p, edge_p, graph_p > graph_t; typedef
[all …]
H A Ddfs_cc.cpp24 allow_parallel_edge_tag, IncidenceGraph> graph_t; in main() typedef
33 allow_parallel_edge_tag, IncidenceGraph> graph_t; in main() typedef
44 graph_t; in main() typedef
/dports/devel/boost-python-libs/boost_1_72_0/libs/graph/test/
H A Dgraphviz_test.cpp167 vertex_p, edge_p, graph_p > graph_t; typedef
176 vertex_p, edge_p, graph_p > graph_t; typedef
189 vertex_p, edge_p, graph_p > graph_t; typedef
199 vertex_p, edge_p, graph_p > graph_t; typedef
210 vertex_p, edge_p, graph_p > graph_t; typedef
221 vertex_p, edge_p, graph_p > graph_t; typedef
274 vertex_p, edge_p, graph_p > graph_t; typedef
285 vertex_p, edge_p, graph_p > graph_t; typedef
297 vertex_p, edge_p, graph_p > graph_t; typedef
309 vertex_p, edge_p, graph_p > graph_t; typedef
[all …]
/dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/graph/test/
H A Dgraphviz_test.cpp167 vertex_p, edge_p, graph_p > graph_t; typedef
176 vertex_p, edge_p, graph_p > graph_t; typedef
189 vertex_p, edge_p, graph_p > graph_t; typedef
199 vertex_p, edge_p, graph_p > graph_t; typedef
210 vertex_p, edge_p, graph_p > graph_t; typedef
221 vertex_p, edge_p, graph_p > graph_t; typedef
274 vertex_p, edge_p, graph_p > graph_t; typedef
285 vertex_p, edge_p, graph_p > graph_t; typedef
297 vertex_p, edge_p, graph_p > graph_t; typedef
309 vertex_p, edge_p, graph_p > graph_t; typedef
[all …]
/dports/databases/mysqlwsrep57-server/boost_1_59_0/libs/graph/test/
H A Dgraphviz_test.cpp167 vertex_p, edge_p, graph_p > graph_t; typedef
176 vertex_p, edge_p, graph_p > graph_t; typedef
189 vertex_p, edge_p, graph_p > graph_t; typedef
199 vertex_p, edge_p, graph_p > graph_t; typedef
210 vertex_p, edge_p, graph_p > graph_t; typedef
221 vertex_p, edge_p, graph_p > graph_t; typedef
274 vertex_p, edge_p, graph_p > graph_t; typedef
285 vertex_p, edge_p, graph_p > graph_t; typedef
297 vertex_p, edge_p, graph_p > graph_t; typedef
309 vertex_p, edge_p, graph_p > graph_t; typedef
[all …]
/dports/databases/percona57-server/boost_1_59_0/libs/graph/test/
H A Dgraphviz_test.cpp167 vertex_p, edge_p, graph_p > graph_t; typedef
176 vertex_p, edge_p, graph_p > graph_t; typedef
189 vertex_p, edge_p, graph_p > graph_t; typedef
199 vertex_p, edge_p, graph_p > graph_t; typedef
210 vertex_p, edge_p, graph_p > graph_t; typedef
221 vertex_p, edge_p, graph_p > graph_t; typedef
274 vertex_p, edge_p, graph_p > graph_t; typedef
285 vertex_p, edge_p, graph_p > graph_t; typedef
297 vertex_p, edge_p, graph_p > graph_t; typedef
309 vertex_p, edge_p, graph_p > graph_t; typedef
[all …]
/dports/databases/xtrabackup/boost_1_59_0/libs/graph/test/
H A Dgraphviz_test.cpp167 vertex_p, edge_p, graph_p > graph_t; typedef
176 vertex_p, edge_p, graph_p > graph_t; typedef
189 vertex_p, edge_p, graph_p > graph_t; typedef
199 vertex_p, edge_p, graph_p > graph_t; typedef
210 vertex_p, edge_p, graph_p > graph_t; typedef
221 vertex_p, edge_p, graph_p > graph_t; typedef
274 vertex_p, edge_p, graph_p > graph_t; typedef
285 vertex_p, edge_p, graph_p > graph_t; typedef
297 vertex_p, edge_p, graph_p > graph_t; typedef
309 vertex_p, edge_p, graph_p > graph_t; typedef
[all …]
/dports/databases/percona57-client/boost_1_59_0/libs/graph/test/
H A Dgraphviz_test.cpp167 vertex_p, edge_p, graph_p > graph_t; typedef
176 vertex_p, edge_p, graph_p > graph_t; typedef
189 vertex_p, edge_p, graph_p > graph_t; typedef
199 vertex_p, edge_p, graph_p > graph_t; typedef
210 vertex_p, edge_p, graph_p > graph_t; typedef
221 vertex_p, edge_p, graph_p > graph_t; typedef
274 vertex_p, edge_p, graph_p > graph_t; typedef
285 vertex_p, edge_p, graph_p > graph_t; typedef
297 vertex_p, edge_p, graph_p > graph_t; typedef
309 vertex_p, edge_p, graph_p > graph_t; typedef
[all …]
/dports/devel/boost-libs/boost_1_72_0/libs/graph/test/
H A Dgraphviz_test.cpp167 vertex_p, edge_p, graph_p > graph_t; typedef
176 vertex_p, edge_p, graph_p > graph_t; typedef
189 vertex_p, edge_p, graph_p > graph_t; typedef
199 vertex_p, edge_p, graph_p > graph_t; typedef
210 vertex_p, edge_p, graph_p > graph_t; typedef
221 vertex_p, edge_p, graph_p > graph_t; typedef
274 vertex_p, edge_p, graph_p > graph_t; typedef
285 vertex_p, edge_p, graph_p > graph_t; typedef
297 vertex_p, edge_p, graph_p > graph_t; typedef
309 vertex_p, edge_p, graph_p > graph_t; typedef
[all …]
/dports/devel/hyperscan/boost_1_75_0/libs/graph/test/
H A Dgraphviz_test.cpp175 graph_t; typedef
185 graph_t; typedef
199 graph_t; typedef
210 graph_t; typedef
222 graph_t; typedef
234 graph_t; typedef
308 graph_t; typedef
321 graph_t; typedef
334 graph_t; typedef
349 graph_t; typedef
[all …]

12345678910>>...20