| /dports/math/coxeter3/coxeter-7b5a1f0/ |
| H A D | wgraph.h | 22 class WGraph; variable
65 class WGraph {
74 {return arena().free(ptr,sizeof(WGraph));} in delete()
75 WGraph(const Ulong &n);
76 ~WGraph();
94 inline const CoeffList& WGraph::coeffList(const Vertex& x) const in coeffList()
96 inline const LFlags& WGraph::descent(const Vertex& x) const in descent()
98 inline const EdgeList& WGraph::edge(const Vertex& x) const in edge()
100 inline const OrientedGraph& WGraph::graph() const {return *d_graph;} in graph()
103 inline Ulong WGraph::size() const {return d_graph->size();} in size()
[all …]
|
| H A D | cells.h | 44 void lWGraph(WGraph& X, kl::KLContext& kl);
45 void lWGraph(WGraph& X, const SubSet& q, kl::KLContext& kl);
46 void rWGraph(WGraph& X, kl::KLContext& kl);
47 void rWGraph(WGraph& X, const SubSet& q, kl::KLContext& kl);
48 void lrWGraph(WGraph& X, kl::KLContext& kl);
49 void lrWGraph(WGraph& X, const SubSet& q, kl::KLContext& kl);
|
| H A D | wgraph.cpp | 89 WGraph::WGraph(const Ulong& n):d_coeff(n),d_descent(n) in WGraph() function in wgraph::WGraph
99 WGraph::~WGraph() in ~WGraph()
109 void WGraph::reset() in reset()
123 void WGraph::setSize(const Ulong& n) in setSize()
138 void WGraph::print(FILE* file, const Interface& I) const in print()
|
| H A D | cells.cpp | 93 static WGraph X(0); in lCells()
204 static WGraph X(0); in rCells()
314 WGraph X(0); in lrCells()
845 void lWGraph(WGraph& X, kl::KLContext& kl) in lWGraph()
896 void lWGraph(WGraph& X, const SubSet& q, kl::KLContext& kl) in lWGraph()
973 void lrWGraph(WGraph& X, kl::KLContext& kl) in lrWGraph()
1013 void lrWGraph(WGraph& X, const SubSet& q, kl::KLContext& kl) in lrWGraph()
1090 void rWGraph(WGraph& X, kl::KLContext& kl) in rWGraph()
1130 void rWGraph(WGraph& X, const SubSet& q, kl::KLContext& kl) in rWGraph()
|
| H A D | files.hpp | 206 void makeWGraph(WGraph& X, const List<CoxNbr>& c, const LFlags& f, KL& kl) in makeWGraph()
655 WGraph X(0); in printLRWGraph()
704 WGraph X(0); in printLWGraph()
890 WGraph X(0); in printRWGraph()
1018 WGraph X(0); in printWGraphList()
|
| H A D | files.h | 67 void makeWGraph(WGraph& X, const List<CoxNbr>& c, const LFlags& f, KL& kl);
169 void printWGraph(FILE* file, const WGraph& X, const LFlags& f,
|
| H A D | files.cpp | 1218 void printWGraph(FILE* file, const WGraph& X, const LFlags& f, in printWGraph()
|
| /dports/lang/yap/yap-6.2.2/library/ |
| H A D | wdgraphs.yap | 359 wdgraph_min_path(V1, V2, WGraph, Path, Cost) :-
361 rb_lookup(V1, Edges, WGraph),
365 dijkstra(H1, V2, WGraph, Status, [], EPath),
369 rb_clone(WGraph0, Edges0, WGraph, Edges),
401 rb_lookup(V, Edges, WGraph),
415 wdgraph_min_paths(V1, WGraph, T) :-
417 rb_lookup(V1, Edges, WGraph),
421 dijkstra(H1, WGraph, Status, [], EPath),
426 dijkstra(H0, WGraph, Status, Path0, PathF) :-
434 dijkstra(H1, WGraph, Status, Path0, PathF).
[all …]
|
| H A D | dgraphs.yap | 358 dgraph_to_wdgraph(Graph, WGraph),
359 wdgraph_min_path(V1, V2, WGraph, Path, Cost).
362 dgraph_to_wdgraph(Graph, WGraph),
363 wdgraph_max_path(V1, V2, WGraph, Path, Cost).
366 dgraph_to_wdgraph(Graph, WGraph),
367 wdgraph_min_paths(V1, WGraph, Paths).
|