本文介绍了实现几何构型的一个行之有效的方法——有向平面法。
This paper describes the method of the directional plane, an effective method to realize the geometrical construction.
而使用新方法可以得到NC算法,且可以证明节点和边都有容量的有向平面网络中的最小截、最大流问题都是属于NC的。
It is proved that the minimum cut and maximum flow problems in directed planar networks with both node and edge capacities are both in NC.
假如一个光子打向有两个狭缝的平面,假如有一个狭缝可以观测到,那它没有同时通过两个狭缝。
So if a photon (particle of light) is directed to a plane with two slits in it and either slit is observed, it will not go through both slits.
But in sigma orbitals, you have no nodal planes along the bond axis, so if we had a nodal plane here, we'd see an area where the wave function was equal to zero.
但在sigma轨道里,沿着轴向是没有节点平面的,如果我们有个节点,我们就会看到某个地方波函数等于0。
应用推荐