首页 \ 问答 \ 居中我的导航(Centering My Nav)

居中我的导航(Centering My Nav)

 我需要在这个网站（ http://beautra.weebly.com/ ）中心导航，任何想法？ 这是代码，我尝试使用inspect元素工具，但我无法解决它。 代码似乎很简单，但我不知道如何使用jsfiddle。 任何帮助也将不胜感激。 谢谢，  
/* Navigation --------------------------------------------------------------------------------*/

#topnav {
    clear: both;
    text-align:center;
    background: url(nav-left.png) no-repeat;
    padding-left: 8px;
    width: 971px;
}

#nav-right {
    background: url(nav-right.png) right top no-repeat;
    padding-right: 10px;
}

#nav-inner {
    background: url(nav-inner.png) repeat-x;
    padding: 2px 5px 3px;
}

#topnav ul {
    list-style: none;
    float: none;
    background: url(nav-sep.jpg) no-repeat left center;
}

#topnav ul li {
    list-style: none;
    float: left;
    background: url(nav-sep.jpg) no-repeat right center;
    padding-right: 2px;
}

#topnav a {
    float: left;
    text-align:center;
    display: block;
    color: #989899;
    text-decoration: none;
    padding: 19px 38px;
    border: 0;
    outline: 0;
    list-style-type: none;
    font-size: .9em;
}

#topnav li#active a,
#topnav a:hover {
    transition: 0.5s; 
    -moz-transition: 0.5s; 
    -webkit-transition: 0.5s; 
    -o-transition: 0.5s; 
    color: #ed53ae;
    background: #090909 url(nav-active.png);
    border: 0;
}

I need to center the nav in this website ( http://beautra.weebly.com/ ), any ideas? Here's the code, I tried playing with the inspect element tool but I couldn't work it out. The code seems simple enough to work out but I don't know how to work with jsfiddle. Any help with that too would be appreciated. Thanks, 
/* Navigation --------------------------------------------------------------------------------*/

#topnav {
    clear: both;
    text-align:center;
    background: url(nav-left.png) no-repeat;
    padding-left: 8px;
    width: 971px;
}

#nav-right {
    background: url(nav-right.png) right top no-repeat;
    padding-right: 10px;
}

#nav-inner {
    background: url(nav-inner.png) repeat-x;
    padding: 2px 5px 3px;
}

#topnav ul {
    list-style: none;
    float: none;
    background: url(nav-sep.jpg) no-repeat left center;
}

#topnav ul li {
    list-style: none;
    float: left;
    background: url(nav-sep.jpg) no-repeat right center;
    padding-right: 2px;
}

#topnav a {
    float: left;
    text-align:center;
    display: block;
    color: #989899;
    text-decoration: none;
    padding: 19px 38px;
    border: 0;
    outline: 0;
    list-style-type: none;
    font-size: .9em;
}

#topnav li#active a,
#topnav a:hover {
    transition: 0.5s; 
    -moz-transition: 0.5s; 
    -webkit-transition: 0.5s; 
    -o-transition: 0.5s; 
    color: #ed53ae;
    background: #090909 url(nav-active.png);
    border: 0;
}

原文：https://stackoverflow.com/questions/22291485

更新时间：2022-11-27 08:11

最满意答案

 当您查找到顶点的路径而不是顶点本身时，应将顶点标记为未访问。  
 想象一下，在遍历之后，您没有将顶点标记为未访问，并且某些搜索遍历图形的一部分并且确实找到了有问题的顶点的路径。 在某些时候，搜索用完了边缘来探索和回溯它的步骤到某个早期点，从那里继续。  
 如果要搜索的顶点有另一条路径通过同样位于找到的第一条路径上的顶点，则算法将找不到第二条路径，因为它会将公共顶点视为已访问过的路径。  
 另一方面，如果您只寻找一条路径（或只是存在一个顶点，即根本没有路径），那么您可以跳过将节点标记为“在出路时未访问”。 

The vertex should be marked as not visited when you are looking for paths to a vertex instead of the vertex itself. 
Imagine you don't mark vertexes as not visited after traversing, and that some search traverses a part of the graph and does find a path to the vertex in question. At some point the search runs out of edges to explore and retraces its steps to some earlier point, continuing from there. 
If there is another path to the vertex being searched for that passes through a vertex that is also on the first path found, the algorithm would not find the second path because it would consider the common vertex as already visited. 
On the other hand, if you are looking for just one path (or for just the presence of a vertex, i.e. no paths at all) then you can skip marking nodes as not visited "on your way out".

居中我的导航(Centering My Nav)

最满意答案

相关问答

非递归深度优先搜索算法(Non-recursive depth first search algorithm)[2021-08-04]

在python中深度优先搜索算法(Depth first search algorithm in python)[2022-08-19]

对Delphi的图形进行非递归深度优先搜索(Non recursive depth first search on graphs for Delphi)[2022-02-23]

递归与深度优先搜索(Recursion vs Depth first search)[2023-06-27]

具有深度优先搜索的递归算法(Recursive algorithm with Depth First Search)[2023-09-10]

请解释递归在算法中如何工作以确定二叉树的深度？(Explain how recursion works in an algorithm to determine depth of binary tree?)[2023-03-12]

Python中的递归深度优先搜索(Recursive Depth First Search in Python)[2023-07-25]

理解这种深度优先搜索算法(Understanding This Depth First Search Algorithm)[2024-04-06]

深度优先搜索递归算法(Depth first search recursion algorithm)[2023-07-14]

递归深度优先搜索算法(Recursive Depth-first search algorithm)[2022-07-16]

相关文章

最新问答