Home
last modified time | relevance | path

Searched refs:DirectedGraph (Results 1 – 25 of 324) sorted by relevance

12345678910>>...13

/dports/biology/abyss/abyss-2.3.1/Graph/
H A DDirectedGraph.h14 class DirectedGraph
213 const DirectedGraph* m_g;
345 DirectedGraph() { } in DirectedGraph() function
351 void swap(DirectedGraph& x) in swap()
551 DirectedGraph(const DirectedGraph&) = default;
552 DirectedGraph(DirectedGraph&&) = default;
553 DirectedGraph& operator=(const DirectedGraph&) = default;
554 DirectedGraph& operator=(DirectedGraph&&) = default;
693 DirectedGraph<VP, EP>& g) in add_edge()
703 DirectedGraph<VP, EP>& g) in remove_edge()
[all …]
/dports/devel/RStudio/rstudio-2021.09.1-372/src/gwt/src/org/rstudio/core/client/
H A DDirectedGraph.java25 public class DirectedGraph<K, V> class
37 public DirectedGraph() in DirectedGraph() method in DirectedGraph
42 public DirectedGraph(V value) in DirectedGraph() method in DirectedGraph
69 …private DirectedGraph(DirectedGraph<K, V> parent, K key, V value, DefaultConstructor<V> constructo…
92 DirectedGraph<K, V> node = this;
99 public DirectedGraph<K, V> findNode(K key)
106 DirectedGraph<K, V> node = this;
120 DirectedGraph<K, V> child = new DirectedGraph<>(this, key, null, constructor_);
125 public DirectedGraph<K, V> getChild(K key)
165 DirectedGraph<K, V> node = this;
[all …]
/dports/math/vtk8/VTK-8.2.0/Infovis/Core/
H A DvtkMutableGraphHelper.cxx33 this->DirectedGraph = nullptr; in vtkMutableGraphHelper()
76 if (this->DirectedGraph) in AddVertex()
78 return this->DirectedGraph->AddVertex(); in AddVertex()
93 if (this->DirectedGraph) in AddEdge()
95 return this->DirectedGraph->AddEdge(u, v); in AddEdge()
110 if (this->DirectedGraph) in AddGraphEdge()
127 if (this->DirectedGraph) in RemoveVertex()
144 if (this->DirectedGraph) in RemoveVertices()
161 if (this->DirectedGraph) in RemoveEdge()
163 return this->DirectedGraph->RemoveEdge(e); in RemoveEdge()
[all …]
/dports/math/vtk9/VTK-9.1.0/Infovis/Core/
H A DvtkMutableGraphHelper.cxx33 this->DirectedGraph = nullptr; in vtkMutableGraphHelper()
76 if (this->DirectedGraph) in AddVertex()
78 return this->DirectedGraph->AddVertex(); in AddVertex()
93 if (this->DirectedGraph) in AddEdge()
95 return this->DirectedGraph->AddEdge(u, v); in AddEdge()
110 if (this->DirectedGraph) in AddGraphEdge()
127 if (this->DirectedGraph) in RemoveVertex()
144 if (this->DirectedGraph) in RemoveVertices()
161 if (this->DirectedGraph) in RemoveEdge()
163 return this->DirectedGraph->RemoveEdge(e); in RemoveEdge()
[all …]
/dports/math/vtk6/VTK-6.2.0/Infovis/Core/
H A DvtkMutableGraphHelper.cxx33 this->DirectedGraph = 0; in vtkMutableGraphHelper()
76 if (this->DirectedGraph) in AddVertex()
78 return this->DirectedGraph->AddVertex(); in AddVertex()
93 if (this->DirectedGraph) in AddEdge()
95 return this->DirectedGraph->AddEdge(u, v); in AddEdge()
110 if (this->DirectedGraph) in AddGraphEdge()
127 if (this->DirectedGraph) in RemoveVertex()
144 if (this->DirectedGraph) in RemoveVertices()
161 if (this->DirectedGraph) in RemoveEdge()
163 return this->DirectedGraph->RemoveEdge(e); in RemoveEdge()
[all …]
/dports/devel/racer/racer-2.1.48/cargo-crates/rustc-ap-rustc_data_structures-722.0.0/src/graph/
H A Dmod.rs13 pub trait DirectedGraph { interface
17 pub trait WithNumNodes: DirectedGraph {
21 pub trait WithNumEdges: DirectedGraph {
25 pub trait WithSuccessors: DirectedGraph
27 Self: for<'graph> GraphSuccessors<'graph, Item = <Self as DirectedGraph>::Node>,
45 pub trait WithPredecessors: DirectedGraph
47 Self: for<'graph> GraphPredecessors<'graph, Item = <Self as DirectedGraph>::Node>,
58 pub trait WithStartNode: DirectedGraph {
63 DirectedGraph + WithStartNode + WithPredecessors + WithStartNode + WithSuccessors + WithNumNodes
69 T: DirectedGraph
[all …]
/dports/devel/racer/racer-2.1.48/cargo-crates/rustc-ap-rustc_data_structures-718.0.0/src/graph/
H A Dmod.rs13 pub trait DirectedGraph { interface
17 pub trait WithNumNodes: DirectedGraph {
21 pub trait WithNumEdges: DirectedGraph {
25 pub trait WithSuccessors: DirectedGraph
27 Self: for<'graph> GraphSuccessors<'graph, Item = <Self as DirectedGraph>::Node>,
45 pub trait WithPredecessors: DirectedGraph
47 Self: for<'graph> GraphPredecessors<'graph, Item = <Self as DirectedGraph>::Node>,
58 pub trait WithStartNode: DirectedGraph {
63 DirectedGraph + WithStartNode + WithPredecessors + WithStartNode + WithSuccessors + WithNumNodes
69 T: DirectedGraph
[all …]
/dports/lang/rust/rustc-1.58.1-src/compiler/rustc_data_structures/src/graph/
H A Dmod.rs13 pub trait DirectedGraph { trait
17 pub trait WithNumNodes: DirectedGraph {
21 pub trait WithNumEdges: DirectedGraph {
25 pub trait WithSuccessors: DirectedGraph
27 Self: for<'graph> GraphSuccessors<'graph, Item = <Self as DirectedGraph>::Node>,
45 pub trait WithPredecessors: DirectedGraph
47 Self: for<'graph> GraphPredecessors<'graph, Item = <Self as DirectedGraph>::Node>,
58 pub trait WithStartNode: DirectedGraph {
63 DirectedGraph + WithStartNode + WithPredecessors + WithSuccessors + WithNumNodes
69 T: DirectedGraph + WithStartNode + WithPredecessors + WithSuccessors + WithNumNodes
[all …]
/dports/lang/rust/rustc-1.58.1-src/vendor/rustc-ap-rustc_data_structures/src/graph/
H A Dmod.rs13 pub trait DirectedGraph { interface
17 pub trait WithNumNodes: DirectedGraph {
21 pub trait WithNumEdges: DirectedGraph {
25 pub trait WithSuccessors: DirectedGraph
27 Self: for<'graph> GraphSuccessors<'graph, Item = <Self as DirectedGraph>::Node>,
45 pub trait WithPredecessors: DirectedGraph
47 Self: for<'graph> GraphPredecessors<'graph, Item = <Self as DirectedGraph>::Node>,
58 pub trait WithStartNode: DirectedGraph {
63 DirectedGraph + WithStartNode + WithPredecessors + WithStartNode + WithSuccessors + WithNumNodes
69 T: DirectedGraph
[all …]
/dports/www/grafana8/grafana-8.3.6/vendor/gonum.org/v1/gonum/graph/simple/
H A Ddirected.go16 dg *DirectedGraph
27 type DirectedGraph struct { struct
36 func NewDirectedGraph() *DirectedGraph {
37 return &DirectedGraph{
47 func (g *DirectedGraph) AddNode(n graph.Node) { argument
66 func (g *DirectedGraph) Edges() graph.Edges { argument
83 func (g *DirectedGraph) From(id int64) graph.Nodes { argument
115 func (g *DirectedGraph) NewNode() graph.Node { argument
135 func (g *DirectedGraph) Nodes() graph.Nodes { argument
158 func (g *DirectedGraph) RemoveNode(id int64) { argument
[all …]
/dports/security/aws-iam-authenticator/aws-iam-authenticator-0.5.2/vendor/gonum.org/v1/gonum/graph/simple/
H A Ddirected.go16 dg *DirectedGraph
27 type DirectedGraph struct { struct
36 func NewDirectedGraph() *DirectedGraph {
37 return &DirectedGraph{
47 func (g *DirectedGraph) AddNode(n graph.Node) { argument
68 func (g *DirectedGraph) Edges() graph.Edges { argument
82 func (g *DirectedGraph) From(id int64) graph.Nodes { argument
124 func (g *DirectedGraph) NewNode() graph.Node { argument
141 func (g *DirectedGraph) Nodes() graph.Nodes { argument
170 func (g *DirectedGraph) RemoveNode(id int64) { argument
[all …]
/dports/sysutils/istio/istio-1.6.7/vendor/github.com/openshift/api/vendor/gonum.org/v1/gonum/graph/simple/
H A Ddirected.go16 dg *DirectedGraph
27 type DirectedGraph struct { struct
36 func NewDirectedGraph() *DirectedGraph {
37 return &DirectedGraph{
47 func (g *DirectedGraph) AddNode(n graph.Node) { argument
68 func (g *DirectedGraph) Edges() graph.Edges { argument
82 func (g *DirectedGraph) From(id int64) graph.Nodes { argument
124 func (g *DirectedGraph) NewNode() graph.Node { argument
141 func (g *DirectedGraph) Nodes() graph.Nodes { argument
170 func (g *DirectedGraph) RemoveNode(id int64) { argument
[all …]
/dports/sysutils/kubectl/kubernetes-1.22.2/vendor/gonum.org/v1/gonum/graph/simple/
H A Ddirected.go16 dg *DirectedGraph
27 type DirectedGraph struct { struct
36 func NewDirectedGraph() *DirectedGraph {
37 return &DirectedGraph{
47 func (g *DirectedGraph) AddNode(n graph.Node) { argument
66 func (g *DirectedGraph) Edges() graph.Edges { argument
80 func (g *DirectedGraph) From(id int64) graph.Nodes { argument
122 func (g *DirectedGraph) NewNode() graph.Node { argument
139 func (g *DirectedGraph) Nodes() graph.Nodes { argument
168 func (g *DirectedGraph) RemoveNode(id int64) { argument
[all …]
/dports/sysutils/istio/istio-1.6.7/vendor/github.com/openshift/api/vendor/gonum.org/v1/gonum/graph/multi/
H A Ddirected.go16 dg *DirectedGraph
29 type DirectedGraph struct { struct
39 func NewDirectedGraph() *DirectedGraph {
40 return &DirectedGraph{
51 func (g *DirectedGraph) AddNode(n graph.Node) { argument
74 func (g *DirectedGraph) Edges() graph.Edges { argument
101 func (g *DirectedGraph) From(id int64) graph.Nodes { argument
157 func (g *DirectedGraph) NewNode() graph.Node { argument
174 func (g *DirectedGraph) Nodes() graph.Nodes { argument
210 func (g *DirectedGraph) RemoveNode(id int64) { argument
[all …]
/dports/www/grafana8/grafana-8.3.6/vendor/gonum.org/v1/gonum/graph/multi/
H A Ddirected.go16 dg *DirectedGraph
29 type DirectedGraph struct { struct
39 func NewDirectedGraph() *DirectedGraph {
40 return &DirectedGraph{
51 func (g *DirectedGraph) AddNode(n graph.Node) { argument
72 func (g *DirectedGraph) Edges() graph.Edges { argument
102 func (g *DirectedGraph) From(id int64) graph.Nodes { argument
163 func (g *DirectedGraph) NewNode() graph.Node { argument
183 func (g *DirectedGraph) Nodes() graph.Nodes { argument
214 func (g *DirectedGraph) RemoveNode(id int64) { argument
[all …]
/dports/devel/RStudio/rstudio-2021.09.1-372/src/gwt/src/org/rstudio/core/client/command/
H A DKeyMap.java24 import org.rstudio.core.client.DirectedGraph;
26 import org.rstudio.core.client.DirectedGraph.DefaultConstructor;
27 import org.rstudio.core.client.DirectedGraph.ForEachNodeCommand;
47 graph_ = new DirectedGraph<>(new DefaultConstructor<List<CommandBinding>>() in KeyMap()
61 DirectedGraph<KeyCombination, List<CommandBinding>> node = graph_.ensureNode(keys.getData()); in addBinding()
91 for (DirectedGraph<KeyCombination, List<CommandBinding>> node : nodes) in clearBindings()
109 DirectedGraph<KeyCombination, List<CommandBinding>> node = graph_.findNode(keys.getData()); in getBindings()
125 List<DirectedGraph<KeyCombination, List<CommandBinding>>> bindings = idToNodeMap_.get(id); in getBindings()
144 List<DirectedGraph<KeyCombination, List<CommandBinding>>> bindings = idToNodeMap_.get(id); in getKeyCommandBindings()
183 DirectedGraph<KeyCombination, List<CommandBinding>> node = graph_.findNode(keys.getData()); in isPrefix()
[all …]
/dports/graphics/py-pygraph/pygraph-0.2.1-4-g037bb2f/tests/
H A Dutility_functions.py3 from ..pygraph import (DirectedGraph, UndirectedGraph,
11 graph = DirectedGraph()
35 graph = DirectedGraph()
46 graph = DirectedGraph()
60 graph = DirectedGraph()
77 graph = DirectedGraph()
94 graph = DirectedGraph()
158 graph = DirectedGraph()
176 graph = DirectedGraph()
195 graph = DirectedGraph()
H A Dtest_directed_graph.py5 from ..pygraph import DirectedGraph, NonexistentNodeError, NonexistentEdgeError
57 graph = DirectedGraph()
100 graph = DirectedGraph()
113 graph = DirectedGraph()
124 graph = DirectedGraph()
137 graph = DirectedGraph()
150 graph = DirectedGraph()
/dports/devel/racer/racer-2.1.48/cargo-crates/rustc-ap-rustc_data_structures-722.0.0/src/graph/iterate/
H A Dmod.rs1 use super::{DirectedGraph, WithNumNodes, WithStartNode, WithSuccessors};
9 pub fn post_order_from<G: DirectedGraph + WithSuccessors + WithNumNodes>( in post_order_from()
16 pub fn post_order_from_to<G: DirectedGraph + WithSuccessors + WithNumNodes>( in post_order_from_to()
30 fn post_order_walk<G: DirectedGraph + WithSuccessors + WithNumNodes>( in post_order_walk()
75 G: ?Sized + DirectedGraph + WithNumNodes + WithSuccessors,
84 G: ?Sized + DirectedGraph + WithNumNodes + WithSuccessors,
93 G: ?Sized + DirectedGraph + WithNumNodes + WithSuccessors,
154 G: ?Sized + DirectedGraph + WithNumNodes + WithSuccessors,
164 G: ?Sized + DirectedGraph + WithNumNodes + WithSuccessors,
248 G: ?Sized + DirectedGraph,
[all …]
/dports/devel/racer/racer-2.1.48/cargo-crates/rustc-ap-rustc_data_structures-718.0.0/src/graph/iterate/
H A Dmod.rs1 use super::{DirectedGraph, WithNumNodes, WithStartNode, WithSuccessors};
9 pub fn post_order_from<G: DirectedGraph + WithSuccessors + WithNumNodes>( in post_order_from()
16 pub fn post_order_from_to<G: DirectedGraph + WithSuccessors + WithNumNodes>( in post_order_from_to()
30 fn post_order_walk<G: DirectedGraph + WithSuccessors + WithNumNodes>( in post_order_walk()
75 G: ?Sized + DirectedGraph + WithNumNodes + WithSuccessors,
84 G: ?Sized + DirectedGraph + WithNumNodes + WithSuccessors,
93 G: ?Sized + DirectedGraph + WithNumNodes + WithSuccessors,
154 G: ?Sized + DirectedGraph + WithNumNodes + WithSuccessors,
164 G: ?Sized + DirectedGraph + WithNumNodes + WithSuccessors,
248 G: ?Sized + DirectedGraph,
[all …]
/dports/lang/rust/rustc-1.58.1-src/vendor/rustc-ap-rustc_data_structures/src/graph/iterate/
H A Dmod.rs1 use super::{DirectedGraph, WithNumNodes, WithStartNode, WithSuccessors};
9 pub fn post_order_from<G: DirectedGraph + WithSuccessors + WithNumNodes>( in post_order_from()
16 pub fn post_order_from_to<G: DirectedGraph + WithSuccessors + WithNumNodes>( in post_order_from_to()
30 fn post_order_walk<G: DirectedGraph + WithSuccessors + WithNumNodes>( in post_order_walk()
75 G: ?Sized + DirectedGraph + WithNumNodes + WithSuccessors,
84 G: ?Sized + DirectedGraph + WithNumNodes + WithSuccessors,
93 G: ?Sized + DirectedGraph + WithNumNodes + WithSuccessors,
154 G: ?Sized + DirectedGraph + WithNumNodes + WithSuccessors,
164 G: ?Sized + DirectedGraph + WithNumNodes + WithSuccessors,
248 G: ?Sized + DirectedGraph,
[all …]
/dports/lang/rust/rustc-1.58.1-src/compiler/rustc_data_structures/src/graph/iterate/
H A Dmod.rs1 use super::{DirectedGraph, WithNumNodes, WithStartNode, WithSuccessors};
9 pub fn post_order_from<G: DirectedGraph + WithSuccessors + WithNumNodes>( in post_order_from()
30 fn post_order_walk<G: DirectedGraph + WithSuccessors + WithNumNodes>( in post_order_walk()
75 G: ?Sized + DirectedGraph + WithNumNodes + WithSuccessors,
84 G: ?Sized + DirectedGraph + WithNumNodes + WithSuccessors,
130 G: ?Sized + DirectedGraph + WithNumNodes + WithSuccessors,
143 G: ?Sized + DirectedGraph + WithNumNodes + WithSuccessors,
204 G: ?Sized + DirectedGraph + WithNumNodes + WithSuccessors,
214 G: ?Sized + DirectedGraph + WithNumNodes + WithSuccessors,
298 G: ?Sized + DirectedGraph,
[all …]
/dports/science/libint2/libint-2.7.1/src/bin/libint/
H A Ddg.h63 class DirectedGraph : public EnableSafePtrFromThis<DirectedGraph> {
109 DirectedGraph();
110 ~DirectedGraph();
482 …inline const DirectedGraph::ver_ptr& vertex_ptr(const DirectedGraph::VPtrAssociativeContainer::val… in vertex_ptr()
485 …inline const DirectedGraph::ver_ptr& vertex_ptr(const DirectedGraph::VPtrSequenceContainer::value_… in vertex_ptr()
489 …inline DirectedGraph::ver_ptr& vertex_ptr(DirectedGraph::VPtrAssociativeContainer::value_type& v) { in vertex_ptr()
492 inline DirectedGraph::ver_ptr& vertex_ptr(DirectedGraph::VPtrSequenceContainer::value_type& v) { in vertex_ptr()
497 inline DirectedGraph::key_type key(const DGVertex& v);
505 bool nonunrolled_targets(const DirectedGraph::targets& targets);
508 void extract_symbols(const SafePtr<DirectedGraph>& dg);
/dports/science/PETSc/petsc-3.14.1/config/BuildSystem/
H A Dgraph.py5 class DirectedGraph(object): class
96 for vertex in DirectedGraph.breadthFirstSearch(self):
103 leaves = DirectedGraph.getLeaves(self)
105 map(lambda v: self.addEdges(v, outputs = DirectedGraph.getRoots(graph)), leaves)
110 roots = DirectedGraph.getRoots(self)
112 map(lambda v: self.addEdges(v, outputs = roots), DirectedGraph.getLeaves(graph))
138 for v2 in DirectedGraph.depthFirstVisit(graph, v, seen, returnFinished, outEdges):
156 for v in DirectedGraph.depthFirstVisit(graph, vertex, seen, returnFinished, outEdges):
167 queue = DirectedGraph.getRoots(graph)[0:1]
190 …vertices = [vertex for vertex in DirectedGraph.depthFirstSearch(graph, returnFinished = 1, outEdge…
[all …]
/dports/devel/boost-docs/boost_1_72_0/libs/graph/example/
H A Dundirected_adjacency_list.cpp38 template < typename DirectedGraph > void
42 DirectedGraph digraph(V); in directed_graph_demo()
43 typename graph_traits < DirectedGraph >::vertex_descriptor u, v; in directed_graph_demo()
44 typedef typename DirectedGraph::edge_property_type Weight; in directed_graph_demo()
45 typename property_map < DirectedGraph, edge_weight_t >::type in directed_graph_demo()
47 typename graph_traits < DirectedGraph >::edge_descriptor e1, e2; in directed_graph_demo()
112 no_property, Weight > DirectedGraph; in main() typedef
114 directed_graph_demo < DirectedGraph > (); in main()

12345678910>>...13