Home
last modified time | relevance | path

Searched refs:adjedges (Results 1 – 11 of 11) sorted by relevance

/dports/math/SCIP/scip-7.0.3/src/tclique/
H A Dtclique_graph.c189 (*tcliquegraph)->adjedges = NULL; in tcliqueCreate()
346 assert(tcliquegraph->adjedges[node].last == tcliquegraph->adjedges[node].first); in tcliqueAddNode()
529 for( i = tcliquegraph->adjedges[n].first; i < tcliquegraph->adjedges[n].last-1; ++i ) in tcliqueFlush()
749 for( j = tcliquegraph->adjedges[i].first; j < tcliquegraph->adjedges[i].last; j++ ) in tcliqueSaveFile()
797 HEAD_ADJ* adjedges; in tcliqueGetFirstAdjedge() local
804 adjedges = tcliquegraph->adjedges; in tcliqueGetFirstAdjedge()
805 assert(adjedges != NULL); in tcliqueGetFirstAdjedge()
821 HEAD_ADJ* adjedges; in tcliqueGetLastAdjedge() local
831 adjedges = tcliquegraph->adjedges; in tcliqueGetLastAdjedge()
835 assert(adjedges != NULL); in tcliqueGetLastAdjedge()
[all …]
/dports/math/igraph/igraph-0.9.5/src/constructors/
H A Dlinegraph.c35 igraph_vector_t adjedges, adjedges2; in igraph_i_linegraph_undirected() local
40 IGRAPH_VECTOR_INIT_FINALLY(&adjedges, 0); in igraph_i_linegraph_undirected()
50 IGRAPH_CHECK(igraph_incident(graph, &adjedges, (igraph_integer_t) from, in igraph_i_linegraph_undirected()
53 n = igraph_vector_size(&adjedges); in igraph_i_linegraph_undirected()
55 long int e = (long int) VECTOR(adjedges)[j]; in igraph_i_linegraph_undirected()
76 igraph_vector_destroy(&adjedges); in igraph_i_linegraph_undirected()
91 igraph_vector_t adjedges; in igraph_i_linegraph_directed() local
96 IGRAPH_VECTOR_INIT_FINALLY(&adjedges, 0); in igraph_i_linegraph_directed()
107 n = igraph_vector_size(&adjedges); in igraph_i_linegraph_directed()
109 long int e = (long int) VECTOR(adjedges)[j]; in igraph_i_linegraph_directed()
[all …]
/dports/graphics/opensubdiv/OpenSubdiv-3_4_4/examples/glEvalLimit/
H A Dparticles.h83 FaceInfo() : adjedges(0), flags(0) { in FaceInfo()
101 adjedges = (e0&3) | ((e1&3)<<2) | ((e2&3)<<4) | ((e3&3)<<6); in setadjedges()
106 int adjedge(int eid) const { return int((adjedges >> (2*eid)) & 3); } in adjedge()
110 unsigned int adjedges :8, member
H A Dparticles.cpp142 adjedges[4]; in STParticles() local
149 ptexIndices.GetAdjacency(refiner, face, 0, adjfaces, adjedges); in STParticles()
150 _adjacency[ptexface] = FaceInfo(adjfaces, adjedges, false); in STParticles()
154 ptexIndices.GetAdjacency(refiner, face, vert, adjfaces, adjedges); in STParticles()
156 FaceInfo(adjfaces, adjedges, true); in STParticles()
/dports/graphics/ptex/ptex-2.3.2/src/ptex/
H A DPtexture.h244 uint8_t adjedges; ///< Adjacent edges, 2 bits per edge. member
249 FaceInfo() : res(), adjedges(0), flags(0) in FaceInfo()
255 FaceInfo(Res res_) : res(res_), adjedges(0), flags(0) in FaceInfo()
269 EdgeId adjedge(int eid) const { return EdgeId((adjedges >> (2*eid)) & 3); } in adjedge()
292 { adjedges = (uint8_t)((e0&3) | ((e1&3)<<2) | ((e2&3)<<4) | ((e3&3)<<6)); } in setadjedges()
H A DPtexWriter.cpp349 f.adjedges &= 0x3f; // clear all but bottom six bits in storeFaceInfo()
/dports/graphics/ptex/ptex-2.3.2/src/tests/
H A Dwtest.cpp73 static int adjedges[][4] = {{ 2, 3, 0, 1 }, in main() local
126 w->writeFace(i, Ptex::FaceInfo(res[i], adjfaces[i], adjedges[i]), buff); in main()
/dports/math/R-cran-igraph/igraph/src/
H A Dcomponents.c929 igraph_vector_int_t *adjedges; in igraph_biconnected_components() local
996 adjedges = igraph_inclist_get(&inclist, act); in igraph_biconnected_components()
997 n = igraph_vector_int_size(adjedges); in igraph_biconnected_components()
1000 long int edge = (long int) VECTOR(*adjedges)[actnext]; in igraph_biconnected_components()
H A Dstructural_properties.c4049 igraph_vector_t adjedges, adjedges2; in igraph_i_linegraph_undirected() local
4054 IGRAPH_VECTOR_INIT_FINALLY(&adjedges, 0); in igraph_i_linegraph_undirected()
4064 IGRAPH_CHECK(igraph_incident(graph, &adjedges, (igraph_integer_t) from, in igraph_i_linegraph_undirected()
4067 n = igraph_vector_size(&adjedges); in igraph_i_linegraph_undirected()
4069 long int e = (long int) VECTOR(adjedges)[j]; in igraph_i_linegraph_undirected()
4090 igraph_vector_destroy(&adjedges); in igraph_i_linegraph_undirected()
4105 igraph_vector_t adjedges; in igraph_i_linegraph_directed() local
4110 IGRAPH_VECTOR_INIT_FINALLY(&adjedges, 0); in igraph_i_linegraph_directed()
4121 n = igraph_vector_size(&adjedges); in igraph_i_linegraph_directed()
4123 long int e = (long int) VECTOR(adjedges)[j]; in igraph_i_linegraph_directed()
[all …]
/dports/math/igraph/igraph-0.9.5/src/connectivity/
H A Dcomponents.c971 igraph_vector_int_t *adjedges; in igraph_biconnected_components() local
1038 adjedges = igraph_inclist_get(&inclist, act); in igraph_biconnected_components()
1039 n = igraph_vector_int_size(adjedges); in igraph_biconnected_components()
1042 long int edge = (long int) VECTOR(*adjedges)[actnext]; in igraph_biconnected_components()
/dports/math/moab/fathomteam-moab-7bde9dfb84a8/src/DiscreteGeometry/
H A DHiReconstruction.cpp721 std::vector<EntityHandle> adjedges; in average_vertex_tangent() local
722 error = vertex_get_incident_elements(vid,1,adjedges); MB_CHK_ERR(error); in average_vertex_tangent()
723 int nedges = adjedges.size(); in average_vertex_tangent()
731 error = mbImpl->get_connectivity(&adjedges[i],1,edgeconn); in average_vertex_tangent()