Kane or KANE may refer to:
Kane is a multi-section action game published by Mastertronic, originally for the Commodore 64 in 1986. The game was then ported to a wide variety of other home computers. The game is set in the Wild West, and its name is a reference to the main character of the film High Noon. The game consists of four distinct scenes, although some versions only contain two. A sequel to the game was released in 1988.
The player takes the role of Sheriff of the town of Kane. The game is split into four levels, two of which are shooting games using an on-screen target and two of which are side-scrolling action sequences on horseback. Only the shooting levels are present in all versions of the game. These may be played separately in the practice mode (with only one try given), but in order to complete and win the game, they must be played successively. The progress in the first scene defines the tries given in the next scenes.
Kane is the walled remains of a lunar crater that has been flooded by lava from Mare Frigoris to the south, and it lies on the northeast edge of this mare. The crater lies midway between the craters C. Mayer to the west and Democritus in the east. To the north-northeast is the crater Moigno.
The floor of this crater is flat and covered in lava flow, with no significant craters within the outer rim. Nothing remains of a central peak, if it ever possessed such a feature. The outer wall displays gaps along the south where it joins the Mare Frigoris. The remainder of the rim is circular but displays wear.
The crater is named after the American Arctic explorer Elisha Kent Kane (1820-1857).
By convention these features are identified on lunar maps by placing the letter on the side of the crater midpoint that is closest to Kane.
In graph theory, a flow network (also known as a transportation network) is a directed graph where each edge has a capacity and each edge receives a flow. The amount of flow on an edge cannot exceed the capacity of the edge. Often in operations research, a directed graph is called a network. The vertices are called nodes and the edges are called arcs. A flow must satisfy the restriction that the amount of flow into a node equals the amount of flow out of it, unless it is a source, which has only outgoing flow, or sink, which has only incoming flow. A network can be used to model traffic in a road system, circulation with demands, fluids in pipes, currents in an electrical circuit, or anything similar in which something travels through a network of nodes.
Let be a finite directed graph in
which every edge
has a non-negative, real-valued capacity
. If
, we assume that
. We distinguish two vertices: a source s and a sink t. A flow in a flow network is a real function
with the following three properties for all nodes u and v: