| /dports/math/R-cran-igraph/igraph/man/ |
| H A D | sub-.igraph.Rd | 12 from,
23 \item{i}{Index. Vertex ids or names or logical vectors. See details
26 \item{j}{Index. Vertex ids or names or logical vectors. See details
31 \item{from}{A numeric or character vector giving vertex ids or
38 \item{to}{A numeric or character vector giving vertex ids or
47 \item{edges}{Logical scalar, whether to return edge ids.}
86 \item Querying edge ids instead of the existance of edges or edge
108 removes the edge from vertex \eqn{v} to vertex \eqn{w}.
112 if \eqn{v} and \eqn{w} are vectors of edge ids or names.
117 adds an edge from every isolate vertex to vertex one,
[all …]
|
| H A D | get.edge.ids.Rd | 3 \name{get.edge.ids}
4 \alias{get.edge.ids}
5 \title{Find the edge ids based on the incident vertices of the edges}
7 get.edge.ids(graph, vp, directed = TRUE, error = FALSE, multi = FALSE)
26 ids of multiple edges are correctly reported.}
29 A numeric vector of edge ids, one for each pair of input vertices.
39 igraph vertex ids are natural numbers, starting from one, up to the number
40 of vertices in the graph. Similarly, edges are also numbered from one, up to
49 ei <- get.edge.ids(g, c(1,2, 4,5))
52 ## non-existant edge
[all …]
|
| H A D | sub-sub-.igraph.Rd | 16 \item{from}{A numeric or character vector giving vertex ids or
23 \item{to}{A numeric or character vector giving vertex ids or
24 names. Together with the \code{from} argument, it can be used to
27 and if it is present, then the \code{from} argument must be present as
32 \item{directed}{Logical scalar, whether to consider edge directions
35 \item{edges}{Logical scalar, whether to return edge ids.}
55 \item Querying the edge ids between two sets or vertices,
57 gives the edge ids of all the edges that exist from vertices
63 readable: \preformatted{ graph[[from = 1:3]]
64 graph[[from = v, to = w, edges = TRUE]]}
[all …]
|
| H A D | max_flow.Rd | 19 Note that the \code{weight} edge attribute is not used by this function.}
25 edge. For undirected graphs this entry is bit trickier, since for
26 these the flow direction is not predetermined by the edge
28 negative, this means that the flow goes from the bigger vertex id to
29 the smaller one. Positive values mean that the flow goes from
31 \item{cut}{A numeric vector of edge ids, the minimum cut corresponding
33 \item{partition1}{A numeric vector of vertex ids, the vertices in the
36 \item{partition2}{A numeric vector of vertex ids, the vertices in the
39 \item{stats}{A list with some statistics from the push-relabel
54 weighted (ie. valued) graph. A flow from \code{source} to \code{target} is
[all …]
|
| H A D | igraph-minus.Rd | 6 \title{Delete vertices or edges from a graph}
19 Delete vertices or edges from a graph
29 as a vector of vertex ids and the specified vertices will be
36 \item If it is an edge sequence (e.g. created by the \code{\link{E}}
37 function), then these edges will be deleted from the graph.
41 ids. These vertices will be removed from the graph.
42 \item If it is an object created with the \code{\link{edge}} (or the
49 g <- g - edge("e|f")
50 g <- g - edge("H")}
53 as a path along which edges will be removed from the graph.
[all …]
|
| H A D | graph_from_data_frame.Rd | 9 \title{Creating igraph graphs from data frames or vice-versa}
43 the (symbolic) edge list and edge/vertex attributes.
51 are used as a symbolic edge list and additional columns as edge attributes.
52 The names of the attributes are taken from the names of the columns.
76 will be included in these columns, for other graphs, the numeric vertex ids.
78 have an edge attribute named \code{from} or \code{to}, because then the
80 the order of their numeric ids.
83 returned. Vertices are listed in the order of their numeric vertex ids.
102 ## The typical case is that these tables are read in from files....
107 relations <- data.frame(from=c("Bob", "Cecil", "Cecil", "David",
[all …]
|
| H A D | st_min_cuts.Rd | 17 \item{capacity}{Numeric vector giving the edge capacities. If this is
18 \code{NULL} and the graph has a \code{weight} edge attribute, then this
19 attribute defines the edge capacities. For forcing unit edge capacities,
20 even for graphs that have a \code{weight} edge attribute, supply \code{NA}
25 minimum cut(s).} \item{cuts}{A list of numeric vectors containing edge ids.
27 numeric vectors containing vertex ids, they correspond to the edge cuts.
30 generates the cut that contains exactly the edges that go from \eqn{X} to
40 removing these edges from \eqn{G} there is no directed path from \eqn{s} to
51 # A difficult graph, from the Provan-Shier paper
|
| H A D | aaa-igraph-package.Rd | 32 \sQuote{\code{weight}} edge attribute is set). The fourth is
65 \code{\link{graph.atlas}} creates graph from the Graph Atlas,
68 To create graphs from field data, \code{\link{graph_from_edgelist}},
79 \section{Vertex and edge IDs}{
81 Vertices and edges have numerical vertex ids in igraph. Vertex ids are
83 \eqn{n} vertices the vertex ids are between \eqn{1} and
88 The same is true for the edges as well, edge ids are always between
92 operations, and vertex ids don't allow this because of the
106 Some vertex/edge/graph attributes are treated specially. One of them
120 The form \sQuote{\code{from|to}}, where \sQuote{\code{from}} and
[all …]
|
| /dports/devel/texlab/citeproc-rs-5252fbd8d2046a5a7d5cdcee6c6cb39bd0f1a7f3/crates/wasm/js-demo/js/ |
| H A D | GraphViz.tsx | 4 import Select from 'react-select'
5 import dot from "graphlib-dot";
6 import dagreD3 from 'dagre-d3';
39 var edge = g.edge(e);
40 let label: string = edge.label;
43 edge.labelStyle = "font-weight: bold;"
45 // edge.curve = curveBasis;
46 edge.curve = curveBundle.beta(0.8);
72 const ids = references.map(r => ({value: r.id, label: r.id}));
73 ids.splice(0, 0, { value: null, label: "None" });
[all …]
|
| /dports/math/R-cran-igraph/igraph/src/ |
| H A D | glet.c | 261 igraph_integer_t from, to; in igraph_i_subclique_next() local
263 igraph_edge(graph, edge, &from, &to); in igraph_i_subclique_next()
266 VECTOR(map)[from] = nov++; in igraph_i_subclique_next()
268 igraph_vector_int_push_back(newids, VECTOR(*ids)[from]); in igraph_i_subclique_next()
549 igraph_vector_int_t ids; in igraph_graphlets_candidate_basis() local
573 VECTOR(ids)[i] = i; in igraph_graphlets_candidate_basis() local
671 int from = VECTOR(edgelist)[i++]; in igraph_i_graphlets_project() local
673 int from_s = VECTOR(vclidx)[from]; in igraph_i_graphlets_project()
674 int from_e = VECTOR(vclidx)[from + 1]; in igraph_i_graphlets_project()
736 int edge = VECTOR(cel)[start++]; in igraph_i_graphlets_project() local
[all …]
|
| /dports/graphics/p5-Graph-Easy/Graph-Easy-0.76/lib/Graph/Easy/ |
| H A D | As_graphml.pm | 41 $ids->{$base_class} = {} unless ref $ids->{$base_class};
155 my $ids = {};
213 for my $edge (sort { $a->{id} <=> $b->{id} } @edges)
215 $txt .= $edge->as_graphml($indent,$ids); # <edge id="..." ...>
253 $t =~ s/##id##/$ids->{$n}/;
270 my ($self, $indent, $ids) = @_;
287 for my $edge (sort { $a->{id} <=> $b->{id} } @edges)
289 $txt .= $edge->as_graphml($indent.' ',$ids);
318 my ($self, $indent, $ids) = @_;
341 my $txt = $indent . '<edge source="' . $g->_safe_xml($self->{from}->{name}) .
[all …]
|
| /dports/math/igraph/igraph-0.9.5/src/cliques/ |
| H A D | glet.c | 263 igraph_integer_t from, to; in igraph_i_subclique_next() local
265 igraph_edge(graph, edge, &from, &to); in igraph_i_subclique_next()
268 VECTOR(map)[from] = nov++; in igraph_i_subclique_next()
270 igraph_vector_int_push_back(newids, VECTOR(*ids)[from]); in igraph_i_subclique_next()
551 igraph_vector_int_t ids; in igraph_graphlets_candidate_basis() local
575 VECTOR(ids)[i] = i; in igraph_graphlets_candidate_basis() local
580 igraph_vector_int_destroy(&ids); in igraph_graphlets_candidate_basis()
673 int from = VECTOR(edgelist)[i++]; in igraph_i_graphlets_project() local
675 int from_s = VECTOR(vclidx)[from]; in igraph_i_graphlets_project()
676 int from_e = VECTOR(vclidx)[from + 1]; in igraph_i_graphlets_project()
[all …]
|
| /dports/lang/racket-minimal/racket-8.3/src/expander/expand/ |
| H A D | definition-context.rkt | 26 identifier-remove-from-definition-context
41 outside-edge ; outside-edge scope for the context
42 inside-edge ; inside-edge scope for the context
67 (define inside-edge (new-scope 'intdef))
70 (set-box! def-ctx-scopes (cons inside-edge (cons outside-edge (unbox def-ctx-scopes)))))
93 (define intdef-ids (for/list ([id (in-list ids)])
171 ;; identifier-remove-from-definition-context
172 (define (identifier-remove-from-definition-context id intdef)
174 (raise-argument-error 'identifier-remove-from-definition-context "identifier?" id))
178 (raise-argument-error 'identifier-remove-from-definition-context
[all …]
|
| /dports/lang/racket/racket-8.3/src/expander/expand/ |
| H A D | definition-context.rkt | 26 identifier-remove-from-definition-context
41 outside-edge ; outside-edge scope for the context
42 inside-edge ; inside-edge scope for the context
67 (define inside-edge (new-scope 'intdef))
70 (set-box! def-ctx-scopes (cons inside-edge (cons outside-edge (unbox def-ctx-scopes)))))
93 (define intdef-ids (for/list ([id (in-list ids)])
171 ;; identifier-remove-from-definition-context
172 (define (identifier-remove-from-definition-context id intdef)
174 (raise-argument-error 'identifier-remove-from-definition-context "identifier?" id))
178 (raise-argument-error 'identifier-remove-from-definition-context
[all …]
|
| /dports/www/grafana8/grafana-8.3.6/vendor/gonum.org/v1/gonum/graph/traverse/ |
| H A D | traverse_test.go | 74 edge func(graph.Edge) bool
158 Traverse: test.edge,
186 edge func(graph.Edge) bool
267 Traverse: test.edge,
299 edge func(graph.Edge) bool
353 w.Traverse = test.edge
355 w.Traverse = test.edge
371 ids := make([]int64, len(c))
373 ids[k] = n.ID()
375 sort.Sort(ordered.Int64s(ids))
[all …]
|
| /dports/sysutils/istio/istio-1.6.7/vendor/github.com/openshift/api/vendor/gonum.org/v1/gonum/graph/traverse/ |
| H A D | traverse_test.go | 63 edge func(graph.Edge) bool
147 Traverse: test.edge,
175 edge func(graph.Edge) bool
235 Traverse: test.edge,
257 edge func(graph.Edge) bool
311 w.Traverse = test.edge
313 w.Traverse = test.edge
329 ids := make([]int64, len(c))
331 ids[k] = n.ID()
333 sort.Sort(ordered.Int64s(ids))
[all …]
|
| /dports/graphics/qgis/qgis-3.22.3/python/analysis/auto_generated/network/ |
| H A D | qgsgraph.sip.in | 2 * This file has been generated automatically from *
17 This class implements a graph edge
34 Returns edge cost calculated using specified strategy
46 Returns the index of the vertex at the end of this edge.
53 Returns the index of the vertex at the start of this edge.
89 Returns the incoming edge ids, i.e. edges which end at this node.
96 Returns outgoing edge ids, i.e. edges which start at this node.
135 Add an edge to the graph, going from the ``fromVertexIdx``
154 const QgsGraphEdge &edge( int idx ) const;
156 Returns edge at given index
[all …]
|
| /dports/graphics/qgis-ltr/qgis-3.16.16/python/analysis/auto_generated/network/ |
| H A D | qgsgraph.sip.in | 2 * This file has been generated automatically from *
17 This class implements a graph edge
34 Returns edge cost calculated using specified strategy
46 Returns the index of the vertex at the end of this edge.
53 Returns the index of the vertex at the start of this edge.
89 Returns the incoming edge ids, i.e. edges which end at this node.
96 Returns outgoing edge ids, i.e. edges which start at this node.
135 Add an edge to the graph, going from the ``fromVertexIdx``
154 const QgsGraphEdge &edge( int idx ) const;
156 Returns edge at given index
[all …]
|
| /dports/lang/racket/racket-8.3/share/pkgs/profile-lib/ |
| H A D | structs.rkt | 15 ;; start a graph traversal from the top or the bottom.
21 ;; - id, src: the corresponding values from `continuation-mark-set->context'.
22 ;; - thread-ids: the list of thread identifiers this function has been seen in.
29 ;; should be equal to the `total' time. So the edge from/to the `*-node' can
34 (define-struct node (id src thread-ids total self callers callees)
45 ;; call relative to the callee/caller (different from the above time because
48 (provide (struct-out edge))
52 (λ (edge o w?)
53 (fprintf o "#<edge:~s-~s>"
54 (or (node-id (edge-caller edge)) '???)
[all …]
|
| H A D | analyzer.rkt | 7 (provide analyze-samples (all-from-out "structs.rkt") profile-merge)
15 ;; using a topological sort from the top, and by the total time for nodes at
47 (define edge (call->edge ler lee))
48 (set-edge-caller-time! edge (+ (edge-caller-time edge) (/ msecs lee#)))
49 (set-edge-callee-time! edge (+ (edge-callee-time edge) (/ msecs ler#)))
54 (define tids (node-thread-ids node))
56 (set-node-thread-ids! node (cons thread-id tids)))
80 ;; convert the nodes from the hash to a list, do a topological sort, and then
174 …(set-node-thread-ids! node* (remove-duplicates (append (node-thread-ids node*) (node-thread-ids no…
182 (set-edge-total! e* (+ (edge-total e) (edge-total e*)))
[all …]
|
| /dports/databases/postgis32/postgis-3.2.0/liblwgeom/ |
| H A D | lwgeom_topo.c | 3034 while (from < to) in _lwt_ReverseElemidArray()
3036 t = ary[from]; in _lwt_ReverseElemidArray()
4224 ids[nids++] = edge->face_right; in _lwt_RemEdge()
4226 ids[nids++] = edge->face_left; in _lwt_RemEdge()
4282 ids[0] = eid1; in _lwt_HealEdges()
4283 ids[1] = eid2; in _lwt_HealEdges()
5992 return ids; in _lwt_AddLine()
6056 lwfree(ids); in lwt_AddPolygon()
6140 return ids; in lwt_AddPolygon()
6337 ) from++; in _lwt_FetchNextUnvisitedEdge()
[all …]
|
| /dports/databases/postgis30/postgis-3.0.4/liblwgeom/ |
| H A D | lwgeom_topo.c | 2998 while (from < to) in _lwt_ReverseElemidArray()
3000 t = ary[from]; in _lwt_ReverseElemidArray()
4169 ids[nids++] = edge->face_right; in _lwt_RemEdge()
4171 ids[nids++] = edge->face_left; in _lwt_RemEdge()
4227 ids[0] = eid1; in _lwt_HealEdges()
4228 ids[1] = eid2; in _lwt_HealEdges()
5847 return ids; in _lwt_AddLine()
5911 lwfree(ids); in lwt_AddPolygon()
5995 return ids; in lwt_AddPolygon()
6192 ) from++; in _lwt_FetchNextUnvisitedEdge()
[all …]
|
| /dports/databases/postgis31/postgis-3.1.4/liblwgeom/ |
| H A D | lwgeom_topo.c | 3017 while (from < to) in _lwt_ReverseElemidArray()
3019 t = ary[from]; in _lwt_ReverseElemidArray()
4188 ids[nids++] = edge->face_right; in _lwt_RemEdge()
4190 ids[nids++] = edge->face_left; in _lwt_RemEdge()
4246 ids[0] = eid1; in _lwt_HealEdges()
4247 ids[1] = eid2; in _lwt_HealEdges()
5869 return ids; in _lwt_AddLine()
5933 lwfree(ids); in lwt_AddPolygon()
6017 return ids; in lwt_AddPolygon()
6214 ) from++; in _lwt_FetchNextUnvisitedEdge()
[all …]
|
| /dports/databases/postgis25/postgis-2.5.5/liblwgeom/ |
| H A D | lwgeom_topo.c | 2994 while (from < to) in _lwt_ReverseElemidArray()
2996 t = ary[from]; in _lwt_ReverseElemidArray()
4158 ids[nids++] = edge->face_right; in _lwt_RemEdge()
4160 ids[nids++] = edge->face_left; in _lwt_RemEdge()
4215 ids[0] = eid1; in _lwt_HealEdges()
4216 ids[1] = eid2; in _lwt_HealEdges()
5783 return ids; in _lwt_AddLine()
5847 lwfree(ids); in lwt_AddPolygon()
5931 return ids; in lwt_AddPolygon()
6128 ) from++; in _lwt_FetchNextUnvisitedEdge()
[all …]
|
| /dports/www/grafana8/grafana-8.3.6/vendor/gonum.org/v1/gonum/graph/encoding/dot/ |
| H A D | decode.go | 93 ids: make(map[string]graph.Node),
123 ids: make(map[string]graph.Node),
144 ids map[string]graph.Node member
158 if n, ok := gen.ids[id]; ok {
166 gen.ids[id] = n
252 func applyPortsToEdge(from ast.Vertex, to *ast.Edge, edge basicEdge) {
254 if n, vertexIsNode := from.(*ast.Node); vertexIsNode {
291 dst.SetEdge(edge)
326 dst.SetEdge(edge)
459 dst.SetLine(edge)
[all …]
|