dalicious ~master (2019-07-04T14:03:58Z)
Dub
Repo
Graph.opBinaryRight
dalicious
math
Graph
Check if edge/node exists in this graph. Ignores the weight if weighted.
bool
opBinaryRight
(
in
Node
node
)
struct
Graph
(Node, Weight = void, Flag!"isDirected" isDirected = No.isDirected, EdgePayload = void)
bool
opBinaryRight
const pure nothrow
(
string
op
)
(
in
Node
node
)
if
(
op
== "in"
)
bool
opBinaryRight
(
in
Edge
edge
)
bool
has
(
in
Node
node
)
Meta
Source
See Implementation
dalicious
math
Graph
constructors
this
functions
adjacencyList
bulkAddForce
degree
forceAdd
get
has
inDegree
inEdges
incidentEdges
indexOf
opBinaryRight
opOpAssign
outDegree
outEdges
replaceEdge
properties
edges
nodes
static functions
edge
structs
ConflictStrategy
Edge
Check if edge/node exists in this graph. Ignores the weight if weighted.