Home
last modified time | relevance | path

Searched refs:AllowedEdges (Results 1 – 6 of 6) sorted by relevance

/dports/cad/zcad/zcad-8b8a693/cad_source/other/AGraphLaz/Graphs/
H A DHamilCyc.pas37 AllowedVertices, AllowedEdges: TBoolVector;
65 if AllowedEdges[E.Index] then begin
79 AllowedEdges[E.Index]:=False;
90 if (E <> Arc) and AllowedEdges[E.Index] then begin
101 AllowedEdges[E.Index]:=False;
111 if AllowedEdges[E.Index] then begin
125 if AllowedEdges[E.Index] then begin
152 AllowedEdges[E.Index]:=True;
236 AllowedEdges:=nil;
276 if AllowedEdges[E1.Index] then begin
[all …]
H A DGraphs.pas329 AllowedEdges: TBoolVector;
3214 Result:=AllowedEdges[Edge.Index];
3220 AllowedEdges:=TBoolVector.Create(EdgeCount, True);
3225 AllowedEdges.Free;
3240 EdgeFilter.AllowedEdges:=EdgeInST;
3243 EdgeFilter.AllowedEdges:=TBoolVector.Create(FEdges.Count, False);
3250 EdgeFilter.AllowedEdges[I]:=True;
3258 EdgeFilter.AllowedEdges.Free;
3275 FindSpanningTree(EdgeFilter.AllowedEdges, nil);
3277 if not EdgeFilter.AllowedEdges[I] then begin
/dports/games/openrct2/OpenRCT2-0.3.5.1/src/openrct2/world/
H A DBanner.cpp345 return AllowedEdges & 0b00001111; in GetAllowedEdges()
350 AllowedEdges &= ~0b00001111; in SetAllowedEdges()
351 AllowedEdges |= (newEdges & 0b00001111); in SetAllowedEdges()
356 AllowedEdges |= 0b00001111; in ResetAllowedEdges()
H A DTileElement.h620 uint8_t AllowedEdges; // 8 member
/dports/games/openrct2/OpenRCT2-0.3.5.1/src/openrct2/rct12/
H A DRCT12.cpp490 return AllowedEdges & 0b00001111; in GetAllowedEdges()
1007 AllowedEdges &= ~0b00001111; in SetAllowedEdges()
1008 AllowedEdges |= (newEdges & 0b00001111); in SetAllowedEdges()
H A DRCT12.h663 uint8_t AllowedEdges; // 6 member